Sciweavers

7891 search results - page 511 / 1579
» A Distributed Scheduling Framework
Sort
View
RTSS
2005
IEEE
16 years 19 days ago
Improving Soft Real-Time Performance through Better Slack Reclaiming
Modern operating systems frequently support applications with a variety of timing constraints including hard real-time, soft real-time, and best-effort. To guarantee performance, ...
Caixue Lin, Scott A. Brandt
INFOCOM
2002
IEEE
15 years 12 months ago
Stochastic Analysis of Some Expedited Forwarding Networks
Abstract— We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach on the assumption that a node can be ab...
Milan Vojnovic, Jean-Yves Le Boudec
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
15 years 11 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
PDPTA
2003
15 years 8 months ago
Distop: A Low-Overhead Cluster Monitoring System
Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-base...
Daniel Andresen, Nathan Schopf, Ethan Bowker, Timo...
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
15 years 5 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...