6105 search results - page 351 / 1221 » A Parallel Algorithm for Bound-Smoothing |
249
click to vote
OPODIS
2010
15 years 4 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
195
click to vote
ICDCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Massive collaborative editing becomes a reality through leading projects such as Wikipedia. This massive collaboration is currently supported with a costly central service. In ord...
184
click to vote
PDP
2008
IEEE
16 years 1 months ago
2008
IEEE
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
171
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
184
click to vote
HIPC
2007
Springer
16 years 28 days ago
2007
Springer
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we present a Gen...