Sciweavers

2355 search results - page 5 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
PC
2000
93views Management» more  PC 2000»
13 years 9 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
KCAP
2003
ACM
14 years 3 months ago
A generic library of problem solving methods for scheduling applications
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdr&aa...
IPPS
2006
IEEE
14 years 3 months ago
Multisite co-allocation algorithms for computational grid
Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, hetero...
Weizhe Zhang, A. M. K. Cheng, Mingzeng Hu
SCHEDULING
2010
137views more  SCHEDULING 2010»
13 years 8 months ago
Criticality analysis of activity networks under interval uncertainty
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
Jérôme Fortin, Pawel Zielinski, Didie...
DATE
2009
IEEE
249views Hardware» more  DATE 2009»
14 years 4 months ago
White box performance analysis considering static non-preemptive software scheduling
—In this paper, a novel approach for integrating static non-preemptive software scheduling in formal bottom-up performance evaluation of embedded system models is described. The ...
Alexander Viehl, Michael Pressler, Oliver Bringman...