347 search results - page 3 / 70 » Scheduling in mapreduce-like systems for fast completion tim... |
ISPAN
2005
IEEE
13 years 11 months ago
2005
IEEE
Most high-end switches use an input-queued or a combined input- and output-queued architecture. The switch fabrics of these architectures commonly use an iterative scheduling syst...
DATE
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper we present an approach to the synthesis of fault-tolerant schedules for embedded applications with soft and hard real-time constraints. We are interested to guarante...
ICPADS
2006
IEEE
13 years 11 months ago
2006
IEEE
The widening gap between processor and memory performance is the main bottleneck for modern computer systems to achieve high processor utilization. In this paper, we propose a new...
ECRTS
2000
IEEE
13 years 9 months ago
2000
IEEE
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to ...
NCA
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remain...