874 search results - page 110 / 175 » Predicting the Running Times of Parallel Programs by Simulat... |
172
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
162
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
158
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
139
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
− In humanoid robot system, many human-body motions such as walking, running, jumping, etc require large power. To achieve a high power-to-weight ratio, this paper proposes a new...
185
click to vote
HPDC
2007
IEEE
16 years 14 days ago
2007
IEEE
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of idle computational resources available on the Internet. Such systems allow guest jobs to run on a ho...