3098 search results - page 22 / 620 » On distributed smooth scheduling |
FTDCS
1997
IEEE
15 years 3 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...
FTDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper addresses issues of task clustering-the coalition of several fine grain tasks into single coarser grain tasks called task clusters+md task cluster scheduling on distrib...
104
click to vote
WDAG
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
CCIA
2009
Springer
15 years 27 days ago
2009
Springer
Meeting Scheduling is a suitable application for distributed computation, motivated by its privacy requirements. Previous work on this problem have considered some cryptographic te...
