Results 291 to 300 of about 677,509 (341)
Some of the next articles are maybe not open access.
On the Compilation of Parallel Programs
Fundamenta Informaticae, 1981The paper examines the properties of a compilation of sequential and parallel programs with respect to computational semantics, defined in the earlier paper of the present author “On the Semantics of Parallel Programs”. A compilation of sequential programs is defined and proved to be stable, i.e.
openaire +2 more sources
Automatic program parallelization
Proceedings of the IEEE, 1993An overview of automatic program parallelization techniques is presented. It covers dependence analysis techniques, followed by a discussion of program transformations, including straight-line code parallelization, do-loop transformations, and parallelization of recursive routines.
Utpal Banerjee +3 more
openaire +1 more source
Sequentializing Parallel Programs
1992A compile-time technique is presented for determining if a set of procedures within a parallel program can be executed sequentially without causing deadlock. The analysis and methods are described for committed-choice parallel logic programming languages; however, the concepts are general enough for any concurrent languages with fine-grain ...
Mark Korsloot, Evan Tick
openaire +1 more source
IEEE Software, 1991
Factors driving the growth of parallel computing and those inhibiting its growth are identified. The impact of advances in communication, VLSI technology, and embedded systems on parallel architecture are discussed. The two categories of parallel programs-transformational and reactive-are examined.
K. Mani Chandy, Carl Kesselman
openaire +1 more source
Factors driving the growth of parallel computing and those inhibiting its growth are identified. The impact of advances in communication, VLSI technology, and embedded systems on parallel architecture are discussed. The two categories of parallel programs-transformational and reactive-are examined.
K. Mani Chandy, Carl Kesselman
openaire +1 more source
Programming parallel simulations
1995Computer simulation is one of the well known problem solving paradigms. Simulating large systems generally requires much computational energy, sometimes beyond the capacities of available single processor computers. Parallel discrete event simulation (PDES) is the execution of a discrete event simulation (DES) on a multiprocessor computer.
Farshad Fatin, Ray J. Paul
openaire +1 more source
Parallel Programming with Skeletons
Computing in Science & Engineering, 2009Parallel programming is bound to become the main concern of software developers in the coming decades. Various models aim to solve this tension, trading efficiency for abstraction or vice versa, but how about getting both?
openaire +1 more source
Dynamic program parallelization
ACM SIGPLAN Lisp Pointers, 1992Static program analysis limits the performance improvements possible from compile-time parallelization. Dynamic program parallelization shifts a portion of the analysis from complie-time to run-time, thereby enabling optimizations whose static detection is overly expensive or impossible. Lambda tagging
Lorenz Huelsbergen, James R. Larus
openaire +1 more source
Verification of parallel programs
International Journal of Computer Mathematics, 1995Ensuring the reliability of computer programs is particularly important, especially for systems with critical applications. The program correctness has to be verified to behave as they were intended to do. For parallel machines, the task is even more difficult because results of executing parallel programs can be very unpredictable as many processes ...
Mohd Yazid Saman, David J. Evans 0001
openaire +1 more source
Proceedings of the compilation of the co-located workshops on DSM'11, TMC'11, AGERE! 2011, AOOPES'11, NEAT'11, & VMIL'11, 2011
Sequential programs are often difficult to parallelize because of the complexity in their implementation and the uncertainty in their behavior. We will demonstrate behavior-oriented parallelization (BOP), which provides annotations for a user to mark possibly parallel regions (PPR) in code and a safe implementation to execute the annotated tasks in ...
Chen Ding 0001, Zachary Fletcher
openaire +2 more sources
Sequential programs are often difficult to parallelize because of the complexity in their implementation and the uncertainty in their behavior. We will demonstrate behavior-oriented parallelization (BOP), which provides annotations for a user to mark possibly parallel regions (PPR) in code and a safe implementation to execute the annotated tasks in ...
Chen Ding 0001, Zachary Fletcher
openaire +2 more sources
International Journal of High Speed Computing, 1993
Parallel computer architectures and hardware have evolved impressively in the last few years from the architecture and the hardware point of view. Progress on the software side can be best characterized as moderate. The lack of methodologies and software to support parallel programming is profound even on the most advanced parallel machines.
openaire +1 more source
Parallel computer architectures and hardware have evolved impressively in the last few years from the architecture and the hardware point of view. Progress on the software side can be best characterized as moderate. The lack of methodologies and software to support parallel programming is profound even on the most advanced parallel machines.
openaire +1 more source