6939 search results - page 637 / 1388 » Algorithm Engineering for Parallel Computation |
156
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
171
Voted
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
201
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
191
click to vote
ICDCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
191
click to vote
PVM
1999
Springer
15 years 11 months ago
1999
Springer
This paper describes a first approach to implement MPI-2’s Extended Collective Operations. We aimed to ascertain the feasibility and effectiveness of such a project based on exis...