Sciweavers

6542 search results - page 32 / 1309
» The tao of parallelism in algorithms
Sort
View
TPDS
1998
157views more  TPDS 1998»
13 years 8 months ago
A Compiler Optimization Algorithm for Shared-Memory Multiprocessors
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
Kathryn S. McKinley
IPPS
2002
IEEE
14 years 1 months ago
Enforcing Resource Sharing Agreements among Distributed Server Clusters
Future scalable, high throughput, and high performance applications are likely to execute on platforms constructed by clustering multiple autonomous distributed servers, with reso...
Tao Zhao, Vijay Karamcheti
IPPS
2006
IEEE
14 years 2 months ago
A parallel memetic algorithm applied to the total tardiness machine scheduling problem
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
Vinícius Garcia, Paulo M. França, Al...
DAGSTUHL
2007
13 years 10 months ago
Parallelism through Digital Circuit Design
Abstract. Two ways to exploit chips with a very large number of transistors are multicore processors and programmable logic chips. Some data parallel algorithms can be executed eï¬...
John O'Donnell
PLDI
1993
ACM
14 years 28 days ago
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
Jennifer-Ann M. Anderson, Monica S. Lam