Adapting Pfair scheduling for symmetric multiprocessors

Authors:
Philip Holman;James H. Anderson
Affiliations:
Department of Computer Science, University of North Carolina, USA;Department of Computer Science, University of North Carolina, USA (Corresponding author. E-mail: anderson@cs.unc.edu)
Venue:
Journal of Embedded Computing - Cache exploitation in embedded systems
Year:
2005

Citing 17
Cited 9

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Optimal rate-based scheduling on multiprocessors

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast scheduling of periodic tasks on multiple resources

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Object Sharing in Pfair-scheduled Multiprocessor Systems

ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
A low-overhead coherence solution for multiprocessors with private cache memories

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
A proportional share resource allocation algorithm for real-time, time-shared systems

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Locking in Pfair-Scheduled Multiprocessor Systems

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
The Case for Fair Multiprocessor Scheduling

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks

ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate Fair Scheduling in Multiprocessor Systems

RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Guaranteeing Pfair Supertasks by Reweighting

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Implementing Pfairness on a Symmetric Multiprocessor

RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
On the implementation of pfair-scheduled multiprocessor systems

On the implementation of pfair-scheduled multiprocessor systems
Early-release fair scheduling

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems

Real-time static voltage scaling on multiprocessors

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Utility accrual real-time scheduling for multiprocessor embedded systems

Journal of Parallel and Distributed Computing
T-L plane-based real-time scheduling for homogeneous multiprocessors

Journal of Parallel and Distributed Computing
Optimal real-time scheduling for efficient aperiodic services on multiprocessors

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Scheduling on parallel machines with preemption and transportation delays

Computers and Operations Research
TL-plane-based multi-core energy-efficient real-time scheduling algorithm for sporadic tasks

ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
On multiprocessor utility accrual real-time scheduling with statistical timing assurances

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Memory-centric scheduling for multicore hard real-time systems

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size share a common and unique cache slot. Instruction cache conflicts can be partially handled at linked time by procedure placement. Pettis and ...