187 search results - page 6 / 38 » scheduling 2011 |
ASPDAC
2011
ACM
14 years 1 months ago
2011
ACM
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
111
Voted
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
105
click to vote
CSCW
2011
ACM
14 years 3 months ago
2011
ACM
The performance of a collaborative system depends on how two mandatory collaborative tasks, processing and transmission of user commands, are scheduled. We have developed multiple...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
103
Voted
JSAC
2011
14 years 9 days ago
2011
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...