1257 search results - page 14 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing syste...
VLDB
1998
ACM
15 years 2 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
FTDCS
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to b...
RTCSA
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper presents an implementation of feedback control strategy on distributed static scheduling. The static schedule is created taking into account the average execution times...
ISORC
2008
IEEE
15 years 4 months ago
2008
IEEE
Some emerging networked embedded real-time applications have relatively long reaction time magnitudes—e.g., milliseconds to minutes. These longer execution time magnitudes allow...