• Journal of Convergence for Information Technology
• /
• v.9 no.12
• /
• pp.124-132
• /
• 2019

Scheduling problems can be classified into offline and online ones. This paper considers an online scheduling problem to minimize makespan on the identical parallel machines. For dynamically arrived jobs with their ready times, we show that the sequencing order according to the ERD (Earliest Ready Date) rule is optimal to minimize makespan. This paper suggests an algorithm by using the MIP(Mixed Integer Programming) formulation periodically to find a good periodic schedule and evaluates the required computational time and resulted makespan of the algorithm. The comparition with an offline scheduling shows our algorithm makes the schedule very fast and the makespan can be reduced as the period time reduction, so we can conclude that our algorithm is useful for scheduling the jobs under online environment even though the number of jobs and machines is large. We expect that the algorithm is invaluable one to find good schedules for the smart factory and online scheduler using the blockchain mechanism.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.7
• /
• pp.304-318
• /
• 2007

Grid computing is a service that share geographically distributed computing resources through high speed network. In this paper, we propose hybrid scheduling scheme which considers not only meta-scheduling scheme to distribute the job between the nodes of grid computing system but also the job scheduling to distribute the job within the local nodes. According to the number of processors needed and expected execution time, the job with high priority is allocated to job queue while the one with low priority and remote job are allocated to backfill queue. We evaluate the proposing scheme through the various experiments and the results show that the utilization of grid computing system increases and the job slowdown decreases.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.341-346
• /
• 2011

Wireless sensor networks (WSNs) are formed by a great quantity of sensor nodes, which are consisted of battery-powered and some tiny devices. In WSN, both efficient energy management and Quality of Service (QoS) are important issues for some applications. Real-time services are usually employed to satisfy QoS requirements in critical environment. This paper proposes a real-time MAC (Medium Access Control) protocol with extended backoff scheme for wireless sensor networks. The basic idea of the proposed protocol employs (m,k)-firm constraint scheduling which is to adjust the contention window (CW) around the optimal value for decreasing the dynamic failure and reducing collisions DBP (Distant Based Priority). In the proposed protocol, the scheduling algorithm dynamically assigns uniform transmitting opportunities to each node. Numerical results reveal the effect of the proposed backoff mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7B
• /
• pp.653-663
• /
• 2002

UMTS/GPRS has its own QoS architecture, but additionally needs to support IP-QoS to provide Internet services. This paper describes an IP-QoS provisioning mechanism in the MPLS-based UMTS/GPRS network. We propose a QoS framework that includes the functional architecture of the MPLS-based GPRS networks and the efficient scheduling mechanism based on Diffserv model. The proposed scheduling mechanims is especially focused on the QoS support for real-time services. It also includes a new buffer management scheme that combines the priority queuing and weighted round robin method. The ns-2 simulator has been used to verify the validity of the proposed scheduling method.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.121-124
• /
• 2003

Passive optical networks (PONs) will be the pervasive choice in the design of next-generation access networks. One possible solution to implementing Passive optical access network is to rely on wavelength-division multiplexing (WDM). In this paper, we solve the problem of providing real-time service to both hard and soft real-time messages in conjunction with a conventional vest-effort service in WDM. we propose an adaptive scheduling algorithm to schedule and manage the message transmissions in the optical access network. Proposed algorithm is MLF-MQF. Also, we suggest dynamic bandwidth algorithm(DBA) in Loop-back WDM-PON (LPB-PON).our mechanism based on bandwidth reservation protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1501-1518
• /
• 2016

This paper presents an effective management of VM (Virtual Machine) for heterogeneous cloud using Common Deployment Model (CDM) brokering mechanism. The effective utilization of VM is achieved by means of task scheduling with VM placement technique. The placements of VM for the physical machine are analyzed with respect to execution time of the task. The idle time of the VMis utilized productively in order to improve the performance. The VMs are also scheduled to maintain the state of the current VM after the task completion. CDM based algorithm maintains two directories namely Active Directory (AD) and Passive Directory (PD). These directories maintain VM with proper configuration mapping of the physical machines to perform two operations namely VM migration and VM roll back. VM migration operation is performed from AD to PD whereas VM roll back operation is performed from PD to AD. The main objectives of the proposed algorithm is to manage the VM's idle time effectively and to maximize the utilization of resources at the data center. The VM placement and VM scheduling algorithms are analyzed in various dimensions of the cloud and the results are compared with iCanCloud model.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.208-210
• /
• 2003

본 논문은 SOC 내에 존재하는 코아들을 테스트하는 과정에서 개별 코아들의 테스트 조건을 기반으로 한 스케듈링을 통해 최적의 Test ing time을 구하는 연구이다. SOC 내에 존재하는 코아들은 주어지는 TAM(Test Access Mechanism) Width에 따라 각코아들의 Width가 달라지고, 최대 Width에서 최소 Width(1)까지 각 Width 별로 Testing time을 계산할 수 있다. 코아들의 각 Width 별 Testing time을 기존의 Rectangle Packing Algorithm을 수정, 보완하여 효율적으로 구성한 수정 Rectangle Packing Algorithm에 적응하여 최적의 Testing time을 구하는 것이 본 논문의 목적이다.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.145-152
• /
• 2021

In the Recent times, various technological enhancements in the field of artificial intelligence and big data has been noticed. This advancement coupled with the evolution of the 5G communication and Internet of Things technologies, has helped in the development in the domain of smart mine construction. The development of unmanned vehicles with enhanced and smart scheduling system for open-pit mine transportation is one such much needed application. Traditional open-pit mining systems, which often cause vehicle delays and congestion, are controlled by human authority. The number of sensors has been used to operate unmanned cars in an open-pit mine. The sensors haves been used to prove the real-time data in large quantity. Using this data, we analyses and create an improved transportation scheduling mechanism so as to optimize the paths for the vehicles. Considering the huge amount the data received and aggregated through various sensors or sources like, the GPS data of the unmanned vehicle, the equipment information, an intelligent, and multi-target, open-pit mine unmanned vehicle schedules model was developed. It is also matched with real open-pit mine product to reduce transport costs, overall unmanned vehicle wait times and fluctuation in ore quality. To resolve the issue of scheduling the transportation, we prefer to use algorithms based on artificial intelligence. To improve the convergence, distribution, and diversity of the classic, rapidly non-dominated genetic trial algorithm, to solve limited high-dimensional multi-objective problems, we propose a decomposition-based restricted genetic algorithm for dominance (DBCDP-NSGA-II).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.593-609
• /
• 2012

We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in wireless access networks. We study the case where CSI is partially overheard by mobiles and thus one can suppress transmitting CSI reports for time varying channels of inferior quality. We model the mechanism of feedback suppression as a Bayesian network, and show that the problem of minimizing the average feedback overhead is NP-hard. To deal with hardness of the problem we identify a class of feedback suppression structures which allow efficient computation of the cost. Leveraging such structures we propose an algorithm which not only captures the essence of seemingly complex overhearing relations among mobiles, but also provides a simple estimate of the cost incurred by a suppression structure. Simulation results are provided to demonstrate the improvements offered by the proposed scheme, e.g., a savings of 63-83% depending on the network size.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.206-214
• /
• 2016

This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.