Sciweavers

2355 search results - page 13 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
CP
2003
Springer
14 years 3 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
TON
2010
127views more  TON 2010»
13 years 4 months ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi
AINA
2006
IEEE
14 years 3 months ago
Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks
In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches....
Emmanuel Jeannot, Frédéric Wagner
STOC
2002
ACM
123views Algorithms» more  STOC 2002»
14 years 10 months ago
Optimal rate-based scheduling on multiprocessors
The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is als...
Anand Srinivasan, James H. Anderson
IPPS
1997
IEEE
14 years 2 months ago
A BSP Approach to the Scheduling of Tightly-Nested Loops
This paper addresses the scheduling of uniformdependence loop nests within the framework of the bulksynchronous parallel (BSP) model. Two broad classes of tightly-nested loops are...
Radu Calinescu