Results 271 to 280 of about 2,671,885 (319)
Some of the next articles are maybe not open access.
Compiling OR-parallelism into AND-parallelism
New Generation Computing, 1986This paper suggests a general method for compiling OR-parallelism into AND-parallelism. An interpreter for an AND/OR-parallel language written in the AND-parallel subset of the language induces a source-to-source transformation from the full language into the AND-parallel subset.
Michael Codish, Ehud Shapiro
openaire +1 more source
Parallel placement of parallel processes
Proceedings of the third conference on Hypercube concurrent computers and applications Architecture, software, computer systems, and general issues -, 1988The problem of placing the individual processes of a logically partitioned problem on the nodes of a multiprocessor in such a manner as to minimize the communication and memory utilization costs is known as the process placement problem. This problem is, in general, NP-complete.
Chrisila C. Pettey, Michael R. Leuze
openaire +1 more source
Tuning parallel applications in parallel
Parallel Computing, 2009In this paper, we present and evaluate a parallel algorithm for parameter tuning of parallel applications. We discuss the impact of performance variability on the accuracy and efficiency of the optimization algorithm and propose a strategy to minimize the impact of this variability.
Ananta Tiwari +2 more
openaire +1 more source
Fundamenta Informaticae, 1993
One of the problems associated with the introduction of parallel processors is the so called “dusty deck” problem. A solution entails the development of optimizing compilers that transform programs previously written for a conventional serial processor into functionally equivalent programs that exploit the parallel processing capabilities of the new ...
Amihood Amir, Carl H. Smith
openaire +2 more sources
One of the problems associated with the introduction of parallel processors is the so called “dusty deck” problem. A solution entails the development of optimizing compilers that transform programs previously written for a conventional serial processor into functionally equivalent programs that exploit the parallel processing capabilities of the new ...
Amihood Amir, Carl H. Smith
openaire +2 more sources
J. Autom. Lang. Comb., 2007
In this paper, the degree of parallelism is introduced and investigated. The degree of parallelism is a natural descriptional complexity measure of Lindenmayer and Bharat systems. This concept quantifies the amount of non-redundant parallelism needed in the derivations of those systems.
Henning Bordihn, Henning Fernau
openaire +1 more source
In this paper, the degree of parallelism is introduced and investigated. The degree of parallelism is a natural descriptional complexity measure of Lindenmayer and Bharat systems. This concept quantifies the amount of non-redundant parallelism needed in the derivations of those systems.
Henning Bordihn, Henning Fernau
openaire +1 more source
SIAM Journal on Computing, 1985
We investigate the complexity of searching a sorted table of n elements on a synchronous, shared memory parallel computer with p processors. We show that \(\Omega\) (lg n-lg p) steps are required if concurrent accesses to the same memory cell are not allowed, whereas O(lg n/lg p) steps are sufficient if simultaneous reads are allowed.
openaire +2 more sources
We investigate the complexity of searching a sorted table of n elements on a synchronous, shared memory parallel computer with p processors. We show that \(\Omega\) (lg n-lg p) steps are required if concurrent accesses to the same memory cell are not allowed, whereas O(lg n/lg p) steps are sufficient if simultaneous reads are allowed.
openaire +2 more sources
Parallel I/o as a pArallel Application
The International Journal of Supercomputer Applications and High Performance Computing, 1995Metacomputing environments provide a software plat form for implementing parallel applications utilizing networked computing resources. Such programming environments offer a cost-effective alternative to paral lel machines for many classes of problems. Unfortu nately, most metacomputing environments either pro vide no I/O facilities, or serialize all I/
Steven A. Moyer, Vaidy S. Sunderam
openaire +1 more source
A parallelism analyzer for conservative parallel simulation
IEEE Transactions on Parallel and Distributed Systems, 1995Most small-scale simulation applications are implemented by sequential simulation techniques. As the problem size increases, however, sequential techniques may be unable to manage the time complexity of the simulation applications adequately. It is natural to consider re-implementing the corresponding large-scale simulations using parallel techniques ...
Yung-Chang Wong +2 more
openaire +1 more source
Adaptive parallelism in compiler-parallelized code
Concurrency: Practice and Experience, 1998As moderate-scale multiprocessors become widely used, we foresee an increased demand for effective compiler parallelization and efficient management of parallelism. While parallelizing compilers are achieving success at identifying parallelism, they are less adept at predetermining the degree of parallelism in different program phases. Thus, a compiler-
Mary W. Hall, Margaret Martonosi
openaire +1 more source
IEEE Transactions on Computers, 1973
Multiple-input circuits that count the number of their inputs that are in a given state (normally logic ONE) are called parallel counters. In this paper three separate types of counters are described, analyzed, and compared. The first counter consists of a network of full adders.
openaire +2 more sources
Multiple-input circuits that count the number of their inputs that are in a given state (normally logic ONE) are called parallel counters. In this paper three separate types of counters are described, analyzed, and compared. The first counter consists of a network of full adders.
openaire +2 more sources