Instruction scheduling is essential for the eecient operation of today's and to-morrow's processors. It can be stated easily and declaratively as a logic program. Consistency techniques embedded in logic programming enable the eecient solution of this problem. This paper describes an instruction scheduling program for the Motorola 88100 RISC processor, which minimizes the number of pipeline sta...

We present an algorithm for scheduling precedence constrained parallel tasks on multiprocessors with noncontiguous processor allocation. The algorithm is called LLHm (Level-by-level and List scheduling using the Harmonic system partitioning scheme), where m ≥ 1 is a positive integer, which is a parameter for the harmonic system partitioning scheme. Three basic techniques are employed in algorit...

Execution speed of programs on modern computer architectures is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execution efficiency, it is now customary for an optimizing compiler to employ a heuristic algorithm for instruction scheduling. These algorithms are painstakingly hand-crafted, which is expenseive and time...

Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; this is mainly due to the fact that well-understood uniprocessor scheduling algorithms can be used on each processor. In recent years, global-scheduling algorithms based on the concept of “proportionate fairness” (Pfair...

Task scheduling for multicore processors typically has aimed at higher throughput and lower power consumption, but the lifetime reliability may be harmed if negative bias temperature instability is not considered together. In this letter, a task scheduling which extends lifetime is proposed. Cores are given the chance to recover as long as performance is not degraded. The degradation simulator ...

Simultaneous Multithreading (SMT) is a recently proposed technique that seeks to improve processor throughput by allowing the processor to run multiple threads simultaneously. Soft real-time workloads such as multimedia applications are becoming increasingly important and would benefit from the throughput of SMT processors. However, the scheduling of such workloads on SMT processors introduces ...

43 processor speeds continue to improve more quickly than memory or interconnection speeds, communication will be an increasing percentage of an application's execution time; scheduling methods that reduce both communication and synchronization overhead are going to have an even greater impact in the future. Anity scheduling simultaneously balances overhead due to synchronization, communication...

In this paper we study scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Three policies which combine processor and I/O scheduling are used to schedule parallel jobs for a variety of workloads. Fairness is required among competing jobs. Simulated results reveal that all scheduling methods have merit, but one method significa...