Sciweavers

6897 search results - page 465 / 1380
» Parallelization of Modular Algorithms
Sort
View
PAAPP
1998
149views more  PAAPP 1998»
15 years 4 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 10 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
165
Voted
HPDC
2005
IEEE
15 years 10 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant
PPOPP
2010
ACM
16 years 1 months ago
Leveraging parallel nesting in transactional memory
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
João Barreto, Aleksandar Dragojevic, Paulo ...
ICPP
2005
IEEE
15 years 10 months ago
Performance Evaluation of View-Oriented Parallel Programming
This paper evaluates the performance of a novel View-Oriented Parallel Programming style for parallel programming on cluster computers. View-Oriented Parallel Programming is based...
Zhiyi Huang, Martin K. Purvis, Paul Werstein