1257 search results - page 83 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
PDCAT
2004
Springer
15 years 8 months ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
122
click to vote
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
A novel strategy for employing schedules obtained using standard static scheduling algorithms in a battery powered multiprocessor environment is investigated. The strategy is able...
129
click to vote
DCC
2011
IEEE
14 years 10 months ago
2011
IEEE
Feedback of channel state information (CSI) in wireless systems is essential in order to exploit multi-user diversity and achieve the highest possible performace. When each spatia...
129
click to vote
EMSOFT
2010
Springer
15 years 28 days ago
2010
Springer
We propose a technique to automatically synthesize programs and schedules for hard real-time distributed (embedded) systems from synchronous data-flow models. Our technique connec...
122
click to vote
JCSS
2007
15 years 2 months ago
2007
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...