383 search results - page 36 / 77 » Optimizing Computing Costs Using Divisible Load Analysis |
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
UPC’s implicit communication and fine-grain programming style make application performance modeling a challenging task. The correspondence between remote references and communi...
PLDI
1996
ACM
14 years 3 days ago
1996
ACM
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
FOCS
2008
IEEE
13 years 9 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
HICSS
2000
IEEE
14 years 11 days ago
2000
IEEE
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...