• Journal of Computing Science and Engineering
• /
• 제9권2호
• /
• pp.108-117
• /
• 2015

Interrupt handling is generally separated from process scheduling. This can lead to a scheduling anomaly and priority inversion. The processor can interrupt a higher priority process that is currently executing, in order to handle a network packet reception interruption on behalf of its intended lower priority receiver process. We propose a new network interrupt handling scheme that combines interrupt handling with process scheduling and the priority of the process. The proposed scheme employs techniques to identify the intended receiver process of an incoming packet at an earlier phase. We implement a prototype system of the proposed scheme on Linux 2.6, and our experiment results show that the prototype system supports the predictable real-time behavior of higher priority processes even when excessive traffic is sent to lower priority processes.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1997년도 춘계 학술대회 발표집
• /
• pp.93-99
• /
• 1997

Most of the past studies on FMS scheduling problems may be classified into two classes, namely off-line scheduling and on-line scheduling approach. The off-line scheduling methods are used mostly for FMS planning purposes and may not be useful real time control of FMSs, because it generates solutions only after a relatively long period of time. The on-line scheduling methods are used extensively for dynamic real-time control of FMSs although the performance of on-line scheduling algorithms tends vary dramatically depending on various configurations of FMS. Current study is about finding a better on-line scheduling rules for FMS operations. In this study, we propose a method to create priority functions that can be used in setting relative priorities among jobs or machines in on-line scheduling. The priority functions reflect the configuration of FMS and the user-defined objective functions. The priority functions are generated from diverse dispatching rules which may be considered a special priority functions by themselves, and used to determine the order of processing and transporting parts. Overall system of our work consists of two modules, the Priority Function Evolution Module (PFEM) and the FMS Simulation Module (FMSSM). The PFEM generates new priority functions using input variables from a terminal set and primitive functions from a function set by genetic programming. And the FMSSM evaluates each priority function by a simulation methodology. Based on these evaluated values, the PFEM creates new priority functions by using crossover, mutation operation and probabilistic selection. These processes are iteratively applied until the termination criteria are satisfied. We considered various configurations and objective functions of FMSs in our study, and we seek a workable solution rather than an optimum or near optimum solution in scheduling FMS operations in real time. To verify the viability of our approach, experimental results of our model on real FMS are included.

• 품질경영학회지
• /
• 제15권2호
• /
• pp.74-81
• /
• 1987

The purpose of this paper is to find out the relative priority among the queueing products for next operation. Critical ratio scheduling is a technique for use in production scheduling to establish and maintain relative priority among the jobs. The relative priority is based on a ratio of when the completed job is required and how much time is required to complete it. A numerical example of "D" company is solved. Jobs are classified into 3 categories; the behind scheduling jobs, the on time jobs and the ahead scheduling jobs.

• 한국정보전자통신기술학회논문지
• /
• 제9권6호
• /
• pp.584-590
• /
• 2016

본 논문에서 제안하는 "도심환경에서 통신 단절 예방을 위한 RRPS(Priority Scheduling and Multi Path Routing Protocol)"에서는 밀집도에 따라 통신의 단절이 빈번하게 일어나는 도심환경의 V2I 및 V2V통신의 단절을 최소화 하기 위하여, RSU의 관리 영역인 Start Line, End Line을 이용하여 End Line에 도달하기 전에 요청 메시지에 대한 우선순위를 적용하여 우선순위가 제일 높은 요청데이터를 먼저 처리할 수 있도록 하는 RRPS(RSU Request Priority Scheduling)알고리즘을 설계를 제안한다. 결과적으로 본 논문에서 제안하는 RRPS는 RSU내에 정보를 요청한 차량의 메시지에 대하여 우선순위 스케줄링을 적용하여 V2I의 처리효율을 향상하고, 통신 단절을 예방하여 전송 성공확률을 향상시키는 효과를 갖는다.

• Journal of Communications and Networks
• /
• 제14권6호
• /
• pp.692-702
• /
• 2012

Supporting quality of service (QoS) guarantees for diverse multimedia services are the primary concerns for WiMAX (IEEE 802.16) networks. A scheduling scheme that satisfies QoS requirements has become more important for wireless communications. We propose a downlink scheduling scheme called adaptive priority-based downlink scheduling (APDS) for providing QoS guarantees in IEEE 802.16 networks. APDS comprises two major components: Priority assignment and resource allocation. Different service-type connections primarily depend on their QoS requirements to adjust priority assignments and dispatch bandwidth resources dynamically. We consider both starvation avoidance and resource management. Simulation results show that our APDS methodology outperforms the representative scheduling approaches in QoS satisfaction and maintains fairness in starvation prevention.

• Industrial Engineering and Management Systems
• /
• 제7권1호
• /
• pp.99-107
• /
• 2008

This paper is concerned with scheduling in Flexible Manufacturing Systems (FMS) using a Fuzzy Logic (FL) approach. Four fuzzy input variables: machine allocated processing time, machine priority, machine available time and transportation priority are defined. The job priority is the output fuzzy variable, showing the priority status of a job to be selected for the next operation on a machine. The model will first select the machines and then assign operations based on a multi-criteria scheduling scheme. System/machine utilization, minimizing mean flow time and balancing machine usage will be covered. Experimental and comparative tests indicate the superiority of this fuzzy based scheduling model over the existing approaches.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.59-61
• /
• 2004

Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.

• Journal of information and communication convergence engineering
• /
• 제11권4호
• /
• pp.235-240
• /
• 2013

Cloud systems are popular computing environment because they can provide easy access to computing resources for users as well as efficient use of resources for companies. The resources of cloud computing are heterogeneous and jobs have various characteristics. One such issue is effective job scheduling. Scheduling in the cloud system may be defined as a multiple criteria decision model. To address this issue, this paper proposes a priority-based two-step job scheduling algorithm. On the first level, jobs are classified based on preference. Resources are dedicated to a job if a deadline failure would cause severe results or critical business losses. In case of only minor discomfort or slight functional impairment, the job is scheduled using a best effort approach. On the second level, jobs are allocated to adequate resources through their priorities that are calculated by the analytic hierarchic process model. We then analyze the proposed algorithm and make a scheduling example to confirm its efficiency.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2009년도 춘계학술대회 논문집
• /
• pp.1057-1058
• /
• 2009

• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.