Sciweavers

2355 search results - page 123 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
FLAIRS
2007
15 years 8 months ago
Temporal Networks with Alternatives: Complexity and Model
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
Roman Barták, Ondrej Cepek
JSSPP
2005
Springer
15 years 11 months ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan
SPAA
1993
ACM
15 years 10 months ago
Optimal Broadcast and Summation in the LogP Model
We consider several natural broadcasting problems for the LogP model of distributed memory machines recently proposed by Culler et al. For each of these problems, we present algor...
Richard M. Karp, Abhijit Sahay, Eunice E. Santos, ...
ALGORITHMICA
2005
129views more  ALGORITHMICA 2005»
15 years 5 months ago
A Comparison of Multicast Pull Models
We consider the setting of a web server that receives requests for documents from clients, and returns the requested documents over a multicast/broadcast channel. We compare the q...
Kirk Pruhs, Patchrawat Uthaisombut
PROCEDIA
2010
148views more  PROCEDIA 2010»
15 years 18 days ago
SysCellC: a data-flow programming model on multi-GPU
High performance computing with low cost machines becomes a reality with GPU. Unfortunately, high performances are achieved when the programmer exploits the architectural specific...
Dominique Houzet, Sylvain Huet, Anis Rahman