Sciweavers

157 search results - page 16 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
89
Voted
OSDI
1996
ACM
14 years 10 months ago
CPU Inheritance Scheduling
Traditional processor scheduling mechanisms in operating systems are fairly rigid, often supportingonly one fixed scheduling policy, or, at most, a few "scheduling classes&qu...
Bryan Ford, Sai Susarla
102
Voted
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CN
2011
94views more  CN 2011»
14 years 4 months ago
Modeling the interactions of congestion control and switch scheduling
—In this paper, we study the interactions of user-based congestion control algorithms and router-based switch scheduling algorithms. We show that switch scheduling algorithms tha...
Alexander Shpiner, Isaac Keslassy
RTSS
2009
IEEE
15 years 4 months ago
Multiprocessor Extensions to Real-Time Calculus
Abstract—Many embedded platforms consist of a heterogeneous collection of processing elements, memory modules, and communication subsystems. These components often implement diff...
Hennadiy Leontyev, Samarjit Chakraborty, James H. ...
108
Voted
TSE
1998
128views more  TSE 1998»
14 years 9 months ago
Modeling and Evaluating Design Alternatives for an On-Line Instrumentation System: A Case Study
—This paper demonstrates the use of a model-based evaluation approach for instrumentation systems (ISs). The overall objective of this study is to provide early feedback to tool ...
Abdul Waheed, Diane T. Rover, Jeffrey K. Hollingsw...