A Shared-Memory Multiprocessor Scheduling Algorithm
نویسندگان
چکیده
This paper presents an extension of the Latency Time (LT) scheduling algorithm for assigning tasks with arbitrary execution times on a multiprocessor with shared memory. The Extended Latency Time (ELT) algorithm adds to the priority function the synchronization associated with access to the shared memory. The assignment is carried out associating with each task a time window of the same size as its duration, which decreases for every time unit that goes by. The proposed algorithm is compared with the Insertion Scheduling Heuristic (ISH). Analysis of the results established that ELT has better performance with fine granularity tasks (computing time comparable to synchronization time), and also, when the number of processors available to carry out the assignment increases.
منابع مشابه
Extended Global Dual Priority Algorithm for Multiprocessor Scheduling in Hard Real-Time Systems
In this paper we present a global scheduling method for shared memory multiprocessor systems that provides a fixed-priority preemptive scheduling of periodic tasks, hard aperiodic tasks and soft aperiodic tasks on a set of identical processors. The method is based on the functioning of the Dual Priority Scheduling Algorithm extended to work in a multiprocessor environment. This algorithm guaran...
متن کاملScheduling in multiprocessor systems pdf
Contemporary computer systems are multiprocessor or multicomputer machines. This chapter will introduce the basics of multiprocessor scheduling. Consequently, the eld of scheduling for multiprocessor systems.The main motivation for multiprocessor scheduling is the desire for increased. The scheduling problem for multiprocessor systems can be generally stated as.Concurrency implemented by schedu...
متن کاملScheduling on a Scalable Multiprocessor-Based Telephone Switch
One of the key obstacles to achieving full processing capacity of a shared memory multiprocessor is memory access contention, the extent to which processes access the same location at the sarne time. Accesses to the sarne variable by two or more concurrently executing processes may result in an inconsistent state of the variable. A common way for preventing memcry access contention is disjointi...
متن کاملPriority Based Fair Scheduling: A Memory Scheduler Design for Chip-Multiprocessor Systems
Memory is commonly a shared resource for a modern chip-multiprocessor system. Concurrently running threads have different memory access behaviors and compete for memory resources. A memory scheduling algorithms should be designed to arbitrate memory requests from different threads, provide high system throughput as well as fairness. This work proposes a memory scheduling algorithm, PriorityBase...
متن کاملImproving Multiprocessor Average-Case Schedulability using A Modified Global Dual Priority Algorithm
In this paper we present a modification of the Dual Priority Scheduling Algorithm to work on shared memory multiprocessor systems improving the average-case schedulability. The proposal deals with global fixedpriority preemptive scheduling of periodic tasks on identical processors. The algorithm allows to schedule hard real-time periodic tasks using task migration between different processors. ...
متن کامل