Sciweavers

1024 search results - page 30 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
PPOPP
2005
ACM
14 years 2 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
PDCAT
2009
Springer
14 years 3 months ago
Supporting Partial Ordering with the Parallel Iterator
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...
Nasser Giacaman, Oliver Sinnen
ICPPW
2006
IEEE
14 years 2 months ago
Multiple Flows of Control in Migratable Parallel Programs
Many important parallel applications require multiple flows of control to run on a single processor. In this paper, we present a study of four flow-of-control mechanisms: proces...
Gengbin Zheng, Laxmikant V. Kalé, Orion Sky...
LCPC
2007
Springer
14 years 2 months ago
Language Extensions in Support of Compiler Parallelization
Abstract. In this paper, we propose an approach to automatic compiler parallelization based on language extensions that is applicable to a broader range of program structures and a...
Jun Shirako, Hironori Kasahara, Vivek Sarkar
ARTS
1999
Springer
14 years 28 days ago
A Formal Model of Real-Time Program Compilation
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
Karl Lermer, Colin J. Fidge