1792 search results - page 213 / 359 » Improved scheduling in rings |
174
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents efficient all-to-all broadcast algorithms for arbitrary irregular networks with switch-based wormhole interconnection and unicast message passing. First, all-t...
161
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
168
click to vote
ADBIS
1998
Springer
15 years 10 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
162
click to vote
RTSS
1996
IEEE
15 years 10 months ago
1996
IEEE
The well-known periodic task model of Liu and Layland 1] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a ...
202
click to vote
MICRO
1994
IEEE
15 years 10 months ago
1994
IEEE
We examine two pipeline structures which are employed in commercial microprocessors. The first is the load-use interlock (LUI) pipeline, which employs an interlock to ensure corre...