Sciweavers

475 search results - page 14 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
IPPS
2008
IEEE
14 years 1 months ago
A modeling approach for estimating execution time of long-running scientific applications
In a Grid computing environment, resources are shared among a large number of applications. Brokers and schedulers find matching resources and schedule the execution of the applic...
Seyed Masoud Sadjadi, Shu Shimizu, Javier Figueroa...
IWQOS
2005
Springer
14 years 29 days ago
Performance Analysis of Wireless Scheduling with ARQ in Fast Fading Channels
In this paper, we study the performance of opportunistic scheduling for downlink data transmissions with type-II packet-combining hybrid ARQ in a multirate cellular network for a f...
Hwee Pink Tan
IPPS
2006
IEEE
14 years 1 months ago
A parallel memetic algorithm applied to the total tardiness machine scheduling problem
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
Vinícius Garcia, Paulo M. França, Al...
SUTC
2010
IEEE
13 years 5 months ago
Resource-Aware Scheduling of Distributed Ontological Reasoning Tasks in Wireless Sensor Networks
Abstract—As the number of wireless sensor network applications continues to grow, the need for specialized task scheduling mechanisms, aware of the sensor devices’ capabilities...
Tim De Pauw, Stijn Verstichel, Bruno Volckaert, Fi...
CF
2008
ACM
13 years 9 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer