Sciweavers

517 search results - page 73 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
SPAA
2004
ACM
15 years 3 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
IPPS
2006
IEEE
15 years 4 months ago
Loosely-coupled loop scheduling in computational grids
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...
ASPDAC
2007
ACM
174views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems
Dynamic voltage scaling (DVS) circuits have been widely adopted in many computing systems to provide tradeoff between performance and power consumption. The effective use of energ...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Chi-Sh...
TCS
2008
14 years 9 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
ICCAD
2004
IEEE
180views Hardware» more  ICCAD 2004»
15 years 6 months ago
Physical placement driven by sequential timing analysis
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
Aaron P. Hurst, Philip Chong, Andreas Kuehlmann