Sciweavers

835 search results - page 45 / 167
» On optimal slicing of parallel programs
Sort
View
PPOPP
2005
ACM
14 years 1 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
MICRO
2008
IEEE
159views Hardware» more  MICRO 2008»
14 years 2 months ago
Copy or Discard execution model for speculative parallelization on multicores
The advent of multicores presents a promising opportunity for speeding up sequential programs via profile-based speculative parallelization of these programs. In this paper we pr...
Chen Tian, Min Feng, Vijay Nagarajan, Rajiv Gupta
EUROPAR
2004
Springer
14 years 1 months ago
Link-Time Optimization of IA64 Binaries
Abstract. The features of the IA64 architecture create new opportunities for link-time optimization. At the same time they complicate the design of a link-time optimizer. This pape...
Bertrand Anckaert, Frederik Vandeputte, Bruno De B...
ICPP
2005
IEEE
14 years 1 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
HICSS
1997
IEEE
110views Biometrics» more  HICSS 1997»
13 years 12 months ago
Resource Management in the mpC Programming Environment
The mpC language was developed to write efJicientand portable programsfor wide range of distributed memory machines. It supports both task and data parallelism, allows both static...
Dmitry Arapov, Alexey Kalinov, Alexey L. Lastovets...