EEcient allocation of distinct subsets of processors to diierent jobs (i.e., space sharing) is critical to the performance of parallel computers, especially large scale parallel computers. This paper presents an eecient and lookahead strategy for processor allocation in 3D torus-connected systems, such as the Cray T3D, where each job requests for an exclusive allocation of a 3D submesh. The pro...

A framework for scheduling a number of di erent real-time applications on a single shared preemptable processor is proposed. This framework enforces complete isolation among the di erent applications, such that the behavior of each application is very similar to its behavior if it had been executing on a slower dedicated processor. A scheduling algorithm that implements this framework is presen...

The power consumption of modern high-performance processors is becoming a major concern because it leads to increased heat dissipation and decreased reliability. While many techniques have been proposed to reduce power consumption for uni-processors, there has been considerably less work on multi-processor systems. In this paper, we focus on poweraware scheduling for multi-processor real-time s...

Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes ðs tÞ units of execution. The earliestdeadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is known that online algorithms tend to perf...

Compared with traditional video streaming server, streaming on multi-core platform has many advantages: flexible and configurable on the number of executing core according to system requirements; fault-tolerant; and fitting well to future process technologies, more cores will be available in advanced process technologies, meanwhile the complexity per core does not increase. In this paper, we fo...

To achieve both of a high peak performance and low average power characteristics, frequency-voltage cooperative control processor has been proposed. The processor schedules its operating frequency according to the required computation power. Its operating voltage or body bias voltage is adequately modulated simultaneously to effectively cut down either switching current or leakage current, and ...

Scheduling problems that involve distance constrained tasks with repetitive requests are enjoying an increase in popularity in real time system design. Timing constraints defined by periods of fixed lengths for each task enforce some frequency of task execution. Alternatively deadlines could be specified relatively to the finish time of the previous execution of the same task. Hence, the schedu...

We present Group Ratio Round-Robin (GR), the first proportional share scheduler that combines accurate proportional fairness scheduling behavior with O(1) scheduling overhead on both uniprocessor and multiprocessor systems. GR uses a simple grouping strategy to organize clients into groups of similar processor allocations which can be more easily scheduled. Using this strategy, GR combines the ...

CPU scheduling is one of the most crucial operations performed by operating systems. Different conventional algorithms like FCFS, SJF, Priority, and RR (Round Robin) are available for CPU Scheduling. The effectiveness of Priority and Round Robin scheduling algorithm completely depends on selection of priority features of processes and on the choice of time quantum. In this paper a new CPU sched...

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such “mixed-criticality” systems give rise to some interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional sch...