42 search results - page 9 / 9 » Modeling Compiled Communication Costs in Multiplexed Optical... |
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
VECPAR
2004
Springer
13 years 10 months ago
2004
Springer
In this work we investigate how the compiler technique of message strip mining performs in practice on contemporary high performance networks. Message strip mining attempts to redu...