Sciweavers

48 search results - page 7 / 10
» Tail-robust scheduling via limited processor sharing
Sort
View
JLP
2007
99views more  JLP 2007»
14 years 9 months ago
Resources in process algebra
The algebra of communicating shared resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Anna Philippou, Oleg Sokolsky
FORTE
2001
14 years 11 months ago
A Family of Resource-Bound Real-Time Process Algebras
The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Jin-Young Choi, Hee-Hwan Kwak, Anna Phi...
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
ICDCS
1995
IEEE
15 years 1 months ago
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach
One of the mostsoughtaftersoftware innovation of thisdecade is the construction of systems using off-the-shelf workstations that actually deliver, and even surpass, the power and ...
Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin