Sciweavers

300 search results - page 7 / 60
» Analysis and Optimization of Explicitly Parallel Programs Us...
Sort
View
IEEEPACT
2009
IEEE
14 years 2 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar
ISCA
1992
IEEE
113views Hardware» more  ISCA 1992»
13 years 11 months ago
Dynamic Dependency Analysis of Ordinary Programs
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
Todd M. Austin, Gurindar S. Sohi
TPDS
1998
110views more  TPDS 1998»
13 years 7 months ago
On Exploiting Task Duplication in Parallel Program Scheduling
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
Ishfaq Ahmad, Yu-Kwong Kwok
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 7 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
EUROPAR
2000
Springer
13 years 11 months ago
Novel Models for Or-Parallel Logic Programs: A Performance Analysis
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
Vítor Santos Costa, Ricardo Rocha, Fernando...