• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.1-17
• /
• 2016

The separated management and operation of commercial IP/optical multilayer networks makes network operators look for a unified control plane (UCP) to reduce their capital and operational expenditure. Software-defined networking (SDN) provides a central control plane with a programmable mechanism, regarded as a promising UCP for future optical networks. The general control and scheduling mechanism in SDN-based optical burst switching (OBS) networks is insufficient so the controller has to process a large number of messages per second, resulting in low network resource utilization. In view of this, this paper presents the burst-flow scheduling mechanism (BFSM) with a proposed scheduling algorithm considering channel usage. The simulation results show that, compared with the general control and scheduling mechanism, BFSM provides higher resource utilization and controller performance for the SDN-based OBS network in terms of burst loss rate, the number of messages to which the controller responds, and the average latency of the controller to process a message.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.3
• /
• pp.49-56
• /
• 2007

Grid provides a platform for the efficient execution of large-scale computing in science and engineering. In this environment, resource management and task scheduling are complex undertaking. We designed and implemented a web-based scheduling toolkit(GridTool), which can model a system and simulate scheduling scheme in Grid computing. The GridTool used GridSim, a toolkit in java-environment, as a tool for simulation. The GridTool is able to perform resource modeling, task modeling, algorithm compiling, simulation, and performance evaluation efficiently in web environment. The GridTool can be applied as a platform for Grid research and can be used to analyze the efficiency of scheduling algorithm.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.487-501
• /
• 2007

To achieve high resource utilization for multi-issue DSPs, production compiler commonly includes variants of iterative modulo scheduling algorithm. However, excessive cyclic data dependences, which exist in communication and media processing loops, unduly restrict modulo scheduling freedom. As a result, replicated functional units in multi-issue DSPs are often under-utilized. To address this resource under-utilization problem, our paper describes a novel compiler preprocessing strategy for effective modulo scheduling. The preprocessing strategy proposed capitalizes on two new transformations, which are referred to as cloning and dismantling. Our preprocessing strategy has been validated by an implementation for StarCore SC140 DSP compiler.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.318-323
• /
• 2004

In this paper, we present a reducing power consumption of a scheduling for reuse module selection under the time constraint. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed scheduling of reducing power consumption is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our approach various HLS benchmark environment using chaining and multi-cycling in the scheduling techniques.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2004.11a
• /
• pp.575-578
• /
• 2004

Since a construction project is a series of works that utilizes resources to accomplish the project goal for a given time period, efficient resource management is a prerequisite for the success of the project. Two major areas of resource management are resource constrained scheduling focusing on the limited resource availability and resource leveling focusing on smoothing resource usage pattern on the fixed project completion time. It is not available, however, to apply both techniques to a project at the same time. This paper proposes a model to enhance the minimum moment algorithm of resource leveling, aiming to find an efficient usage of resources and an appropriate project completion time. A survey is performed to evaluate the major five factors using the AHP.

• IE interfaces
• /
• v.11 no.3
• /
• pp.65-75
• /
• 1998

This research considers the problem of scheduling jobs on parallel machines with non-common due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the due dates. Job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two problems. For the first of these, the number of different types of additional: resources and resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear programming and the Lagrangian relaxation approach is used. For the second case, there exists one single type of additional resource and the resource requirements per job are zero or one. We show how to formulate the problem as an assignment problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.433-450
• /
• 1997

In this study, a heuristic algorithm is developed to solve a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories, and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The algorithm takes advantage of the basic structure of a heuristic algorithm, called the exchange heuristic, but employs different strategies on some critical steps of the original algorithm which have significant effects on the algorithm performance. The original algorithm and the modified algorithm were compared through an experimental investigation. The modified algorithm produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

• Korean Journal of Construction Engineering and Management
• /
• v.5 no.2 s.18
• /
• pp.211-218
• /
• 2004

In a large owner organization, a program manager of multiple maintenance and remodeling projects has experienced increasing scale and complexity of coordinating the M/R projects with in-house technicians who belong to multiple trade shops. This paper proposes a dual-level hierarchical planning strategy that consists of a program master plan in the long-term horizon and a master construction schedule in an operational scheduling window. A rolling horizon approach to the program master plan is proposed to deal with the external uncertainty of unknown stream of project requests. A resource-constrained scheduling algorithm is developed to generate the master construction schedule in a scheduling window. During development of the algorithm, more emphasis is placed on long-term organizational resource continuity, especially flow management of program constraint resources, than ephemeral events of an individual activity and project. Monte Carlo simulation experiments of three scheduling windows are used to evaluate the relative performance of the proposed scheduling algorithm against three popular scheduling heuristics for resource-constrained multiple projects.

• International Journal of Contents
• /
• v.6 no.2
• /
• pp.10-13
• /
• 2010

For applications that are grid enabled, the grid can offer a resource balancing effect by scheduling grid jobs on machines with low utilization. When jobs communicate with each other, the internet, or with storage resources, an advanced scheduler could schedule them to minimize communications traffic or minimize the distance of the communications. We propose an intelligent load distribution algorithm to minimize communications traffic and distance of the communications using genetic algorithm. The experiments show the proposed load redistribution algorithm performs efficiently in the variance of load in grid environments.