6437 search results - page 140 / 1288 » Parallel Algorithms for Arrangements |
113
Voted
HPCN
1997
Springer
15 years 5 months ago
1997
Springer
We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applic...
OSDI
1996
ACM
15 years 2 months ago
1996
ACM
High-performance I/O systems depend on prefetching and caching in order to deliver good performance to applications. These two techniques have generally been considered in isolati...
99
Voted
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
114
Voted
SC
2005
ACM
15 years 6 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
SIGCSE
2010
ACM
15 years 7 months ago
2010
ACM
