230 search results - page 4 / 46 » Towards automatic program partitioning |
ICPP
1997
IEEE
13 years 10 months ago
1997
IEEE
Abstract—This paper describes an algorithm for deriving data and computation partitions on scalable shared memory multiprocessors. The algorithm establishes affinity relationshi...
SPAA
2006
ACM
14 years 3 days ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
ICFP
2006
ACM
14 years 6 months ago
2006
ACM
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
CLOUD
2010
ACM
13 years 11 months ago
2010
ACM
Timely and cost-effective processing of large datasets has become a critical ingredient for the success of many academic, government, and industrial organizations. The combination...
MP
2010
13 years 4 months ago
2010
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...