360 search results - page 25 / 72 » Speculative Computation in Multilisp |
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
Load balancing is an important consideration when running data-parallel programs. While traditional techniques trade off the cost of load imbalance with the overhead of mitigating...
ICPP
2000
IEEE
14 years 25 days ago
2000
IEEE
Recently, the practice of speculation in resolving data dependences has been studied as a means of extracting more instruction level parallelism (ILP). An outcome of an instructio...
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
HPCC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
UIST
2003
ACM
14 years 1 months ago
2003
ACM
This research explores distributed sensing techniques for mobile devices using synchronous gestures. These are patterns of activity, contributed by multiple users (or one user wit...