The topological sort can be used for the rapid detection of parallelism in sequential programs. Using this algorithm, one can detect both intrablock and interblock parallelism. The algorithm requires only information normally collected by an optimizing compiler.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/25626/1/0000176.pd
In this paper, we present a concurrency measure that is especially adapted to distributed programs t...
We propose a general framework for compositional under-approximate concurrent program analyses by re...
The multicore era has increased the need for highly parallel software. Since automatic parallelizati...
AbstractA model is proposed that can be used to classify algorithms as inherently sequential. The mo...
Thesis (Ph. D.--University of Rochester. Dept. of Computer Science, 1991. Simultaneously published i...
During the past decade, the degree of parallelism available in hardware has grown quickly and decisi...
150 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.Parallel programs are signifi...
Abstract—Although multicore CPUs are dominating the market of desktops and servers, writing programs...
Parallel computer architectures have dominated the computing landscape for the past two decades; a ...
With the rise of Chip multiprocessors (CMPs), the amount of parallel computing power will increase s...
Parallel computing hardware is ubiquitous, ranging from cell-phones with multiple cores to super-com...
AbstractWe present a simple and uniform transformational system for extracting parallelism from prog...
Practical and efficient concurrent systems are notoriously hard to design, implement, and verify. As...
Usage of multiprocessor and multicore computers implies parallel programming. Tools for preparing pa...
The class of problems that can be effectively compiled by parallelizing compilers is discussed. This...
In this paper, we present a concurrency measure that is especially adapted to distributed programs t...
We propose a general framework for compositional under-approximate concurrent program analyses by re...
The multicore era has increased the need for highly parallel software. Since automatic parallelizati...
AbstractA model is proposed that can be used to classify algorithms as inherently sequential. The mo...
Thesis (Ph. D.--University of Rochester. Dept. of Computer Science, 1991. Simultaneously published i...
During the past decade, the degree of parallelism available in hardware has grown quickly and decisi...
150 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.Parallel programs are signifi...
Abstract—Although multicore CPUs are dominating the market of desktops and servers, writing programs...
Parallel computer architectures have dominated the computing landscape for the past two decades; a ...
With the rise of Chip multiprocessors (CMPs), the amount of parallel computing power will increase s...
Parallel computing hardware is ubiquitous, ranging from cell-phones with multiple cores to super-com...
AbstractWe present a simple and uniform transformational system for extracting parallelism from prog...
Practical and efficient concurrent systems are notoriously hard to design, implement, and verify. As...
Usage of multiprocessor and multicore computers implies parallel programming. Tools for preparing pa...
The class of problems that can be effectively compiled by parallelizing compilers is discussed. This...
In this paper, we present a concurrency measure that is especially adapted to distributed programs t...
We propose a general framework for compositional under-approximate concurrent program analyses by re...
The multicore era has increased the need for highly parallel software. Since automatic parallelizati...
DOI
Add to ORKG