1257 search results - page 139 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
118
click to vote
DATE
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper we present an approach to the design optimization of faulttolerant embedded systems for safety-critical applications. Processes are statically scheduled and communic...
121
click to vote
COORDINATION
2009
Springer
16 years 2 months ago
2009
Springer
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
131
Voted
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
133
Voted
EURONGI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
104
Voted
MSN
2007
Springer
15 years 7 months ago
2007
Springer
The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access th...