2438 search results - page 126 / 488 » Scheduling problems for parallel and distributed systems |
114
click to vote
ISORC
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper presents a simple protocol that provides application processes with an approximate real-time notion. This time notion is very versatile. At one extreme, it behaves at l...
123
click to vote
ICDCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...
136
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...
133
Voted
HIPC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
143
click to vote
ICDCS
2005
IEEE
15 years 10 months ago
2005
IEEE
Database queries, in particular, event-driven continuous queries, are useful for many pervasive computing applications, such as video surveillance. In order to enable these applic...