912 search results - page 21 / 183 » Robust task scheduling for volunteer computing systems |
126
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
146
Voted
TC
2008
15 years 3 months ago
2008
High availability is a key requirement in the design and development of heterogeneous systems, where processors operate at different speeds and are not continuously available for ...
171
Voted
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
Dynamic voltage scaling (DVS) circuits have been widely adopted in many computing systems to provide tradeoff between performance and power consumption. The effective use of energ...
135
click to vote
CLUSTER
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Since the advent of multi-core processors, the physionomy of typical clusters has dramatically evolved. This new massively multi-core era is a major change in architectu...
142
Voted
RTSS
2005
IEEE
15 years 9 months ago
2005
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning probl...