Sciweavers

567 search results - page 3 / 114
» Program Optimization and Parallelization Using Idioms
Sort
View
CF
2010
ACM
14 years 15 days ago
Exposing parallelism and locality in a runtime parallel optimization framework
Runtime parallel optimization has been suggested as a means to overcome the difficulties of parallel programming. For runtime parallel optimization to be effective, parallelism a...
David A. Penry, Daniel J. Richins, Tyler S. Harris...
EOR
2010
113views more  EOR 2010»
13 years 7 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
TPDS
1998
157views more  TPDS 1998»
13 years 7 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
CONCURRENCY
2000
99views more  CONCURRENCY 2000»
13 years 7 months ago
The Java memory model is fatally flawed
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. This chapter is hard to interpret and po...
William Pugh
PLDI
1993
ACM
13 years 11 months 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