1257 search results - page 68 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
123
click to vote
EUROPAR
2005
Springer
15 years 7 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
137
click to vote
ALGOSENSORS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule tra...
119
Voted
RTCSA
2005
IEEE
15 years 7 months ago
2005
IEEE
We present an approach to the analysis and optimization of heterogeneous distributed embedded systems for hard real-time applications. The systems are heterogeneous not only in te...
127
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper investigates scheduling loosely coupled task-bundles in highly heterogeneous distributed systems. Two allocation quality metrics are used in pay-per-service distributed ...
137
click to vote
HYBRID
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...