Reif, J. H. (John H.)
Overview
Works:  112 works in 319 publications in 2 languages and 3,141 library holdings 

Genres:  Conference papers and proceedings Handbooks and manuals Specifications 
Roles:  Author, Editor, Other 
Publication Timeline
.
Most widely held works by
J. H Reif
VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28July 1, 1988 : proceedings by
J. H Reif(
Book
)
31 editions published between 1988 and 1993 in 3 languages and held by 334 WorldCat member libraries worldwide
From the Foreword: "The papers in this volume were presented at the Aegean Workshop on Computing: VLSI Algorithms and Architectures (AWOC 88), organized by the Computer Technology Institute in Patras in cooperation with ACM, EATCS, IEEE and the General Secretariat of Research and Technology (Ministry of Industry, Energy & technology of Greece). They were selected from 119 abstracts submitted in response to the program committee's call for papers and to additional invitations from John Reif. AWOC 88 took place in Corfu, Greece, June 28July 1, 1988. AWOC 88 is the third meeting in the International Workshop on Parallel Computing & VLSI series; the first meeting took place in Amalfi, Italy, 1984, and the second at Loutraki, Greece, 1986."
31 editions published between 1988 and 1993 in 3 languages and held by 334 WorldCat member libraries worldwide
From the Foreword: "The papers in this volume were presented at the Aegean Workshop on Computing: VLSI Algorithms and Architectures (AWOC 88), organized by the Computer Technology Institute in Patras in cooperation with ACM, EATCS, IEEE and the General Secretariat of Research and Technology (Ministry of Industry, Energy & technology of Greece). They were selected from 119 abstracts submitted in response to the program committee's call for papers and to additional invitations from John Reif. AWOC 88 took place in Corfu, Greece, June 28July 1, 1988. AWOC 88 is the third meeting in the International Workshop on Parallel Computing & VLSI series; the first meeting took place in Amalfi, Italy, 1984, and the second at Loutraki, Greece, 1986."
Handbook of parallel computing : models, algorithms and applications by
Sanguthevar Rajasekaran(
Book
)
22 editions published between 2007 and 2008 in English and held by 237 WorldCat member libraries worldwide
Parallel computing plays a vital role in solving complex computing problems. The Handbook of Parallel Computing; Models, Algorithms, and Applications provides comprehensive coverage on all aspects of parallel computing, focusing on the foundational principles and recent advances in the areas of models, algorithms, and applications. This book addresses applications to computational biology, homeland security, and simulations of parallelism such as fuel cells, biological cells, and coastal waves. It covers the parallel disk model, which has
22 editions published between 2007 and 2008 in English and held by 237 WorldCat member libraries worldwide
Parallel computing plays a vital role in solving complex computing problems. The Handbook of Parallel Computing; Models, Algorithms, and Applications provides comprehensive coverage on all aspects of parallel computing, focusing on the foundational principles and recent advances in the areas of models, algorithms, and applications. This book addresses applications to computational biology, homeland security, and simulations of parallelism such as fuel cells, biological cells, and coastal waves. It covers the parallel disk model, which has
Parallel image compression : NASA SBIR phase 1 report by
J. H Reif(
Book
)
2 editions published in 1987 in English and held by 100 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 100 WorldCat member libraries worldwide
DCC '91 : Data Compression Conference by Data Compression Conference(
Book
)
5 editions published in 1991 in English and held by 75 WorldCat member libraries worldwide
5 editions published in 1991 in English and held by 75 WorldCat member libraries worldwide
Deriving efficient graph algorithms by
J. H Reif(
Book
)
8 editions published in 1982 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Ten years ago Hopcroft and Tarjan discovered a class of very fast algorithms for solving graph problems such as biconnectivity and strong connectivity. While these depthfirstsearch algorithms are complex and can be difficult to understand, the problems they solve have simple combinatorial definitions that can themselves be considered algorithms, though the might be very inefficient or even infinitary. We demonstrate here how the efficient algorithms can be systematically derived using program transformation steps from the intuitive but preliminary definitions. There are several justifications for this work. First, we believe that the evolutionary approach used in this paper offers more natural explanations of the algorithms than the usual a posteriori proofs that appear in textbooks. Second, the derivations illustrate several highlevel principles of program derivation and suggest methods by which these principles can be realized by sequences of program transformation steps. Third, these examples illustrate how external domainspecific knowledge can enter into the program derivation process. This is the first occasion that such efficient graph algorithms have been systematically derived. (Author)
8 editions published in 1982 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Ten years ago Hopcroft and Tarjan discovered a class of very fast algorithms for solving graph problems such as biconnectivity and strong connectivity. While these depthfirstsearch algorithms are complex and can be difficult to understand, the problems they solve have simple combinatorial definitions that can themselves be considered algorithms, though the might be very inefficient or even infinitary. We demonstrate here how the efficient algorithms can be systematically derived using program transformation steps from the intuitive but preliminary definitions. There are several justifications for this work. First, we believe that the evolutionary approach used in this paper offers more natural explanations of the algorithms than the usual a posteriori proofs that appear in textbooks. Second, the derivations illustrate several highlevel principles of program derivation and suggest methods by which these principles can be realized by sequences of program transformation steps. Third, these examples illustrate how external domainspecific knowledge can enter into the program derivation process. This is the first occasion that such efficient graph algorithms have been systematically derived. (Author)
The propositional dynamic logic of deterministic, wellstructured programs by
Joseph Y Halpern(
Book
)
2 editions published in 1981 in English and held by 9 WorldCat member libraries worldwide
2 editions published in 1981 in English and held by 9 WorldCat member libraries worldwide
Efficient parallel solution of linear systems by
Victor Pan(
Book
)
4 editions published between 1984 and 1985 in English and held by 5 WorldCat member libraries worldwide
The most efficient known parallel algorithms for inversion of a nonsingular nxn matrix A or solving a linear system Ax=b over the rationals require O(log n) to the 2nd power time and M(n) square root of n processors (where M(n) is the number of processors required in order to multiply two nxn rational matrices in time O(log n)). Furthermore, all known polylog time algorithms for those problems are unstable: they require the calculations to be done with perfect precision; otherwise they give no results at all. This paper describes parallel algorithms that have good numerical stability and remain efficient as n grows large. Additional keywords: Iterations; Convergence; Newtons method; Computer architecture
4 editions published between 1984 and 1985 in English and held by 5 WorldCat member libraries worldwide
The most efficient known parallel algorithms for inversion of a nonsingular nxn matrix A or solving a linear system Ax=b over the rationals require O(log n) to the 2nd power time and M(n) square root of n processors (where M(n) is the number of processors required in order to multiply two nxn rational matrices in time O(log n)). Furthermore, all known polylog time algorithms for those problems are unstable: they require the calculations to be done with perfect precision; otherwise they give no results at all. This paper describes parallel algorithms that have good numerical stability and remain efficient as n grows large. Additional keywords: Iterations; Convergence; Newtons method; Computer architecture
Shortest paths in Euclidean space with polyhedral obstacles by
J. H Reif(
Book
)
4 editions published between 1984 and 1985 in English and held by 5 WorldCat member libraries worldwide
This document considers the problem of finding a minimum length path between two points in Euclidean space which avoids a set (not necessarily convex) polyhedral obstacles; we let n denote the number of the obstacle edges and k denote the number of islands in the obstacle space. For two dimensions, an island is defined to be a maximal convex obstacle surface such that for any two points contained in the interior of the island, a minimal length path between these two points is strictly contained in the interior of the island; for example, a set of i disconnected convex polyhedra forms a set of i islands, however, a single nonconvex polyhedron will constitute more than one island. Keywords: Mover's problem; robotics motion planning
4 editions published between 1984 and 1985 in English and held by 5 WorldCat member libraries worldwide
This document considers the problem of finding a minimum length path between two points in Euclidean space which avoids a set (not necessarily convex) polyhedral obstacles; we let n denote the number of the obstacle edges and k denote the number of islands in the obstacle space. For two dimensions, an island is defined to be a maximal convex obstacle surface such that for any two points contained in the interior of the island, a minimal length path between these two points is strictly contained in the interior of the island; for example, a set of i disconnected convex polyhedra forms a set of i islands, however, a single nonconvex polyhedron will constitute more than one island. Keywords: Mover's problem; robotics motion planning
Real time resource allocation in a distributed system by
J. H Reif(
Book
)
4 editions published in 1982 in English and held by 5 WorldCat member libraries worldwide
In this paper we consider a resource allocation problem which is local in the sense that the maximum number of users competing for a particular resource at any time instant is bounded and also at any time instant the maximum number of resources that a user is willing to get is bounded. The problem may be viewed as that of achieving matchings in dynamically changing hypergraphs, via a distributed algorithm. We show that this problem is related to the fundamental problem of handshake communication (which can be viewed as achieving matchings in a dynamically changing graph, via distributed algorithms) in that an efficient solution to each of them implies an efficient solution to the other. We provide realtime solutions to the resource allocation problem (that is, we give distributed algorithms with real time response). We make essential use of probabilistic techniques as first used by (Rabin, 80b), where processes are allowed to make independent probabilistion choices. On the other hand, no probability assumptions about the system behavior are made
4 editions published in 1982 in English and held by 5 WorldCat member libraries worldwide
In this paper we consider a resource allocation problem which is local in the sense that the maximum number of users competing for a particular resource at any time instant is bounded and also at any time instant the maximum number of resources that a user is willing to get is bounded. The problem may be viewed as that of achieving matchings in dynamically changing hypergraphs, via a distributed algorithm. We show that this problem is related to the fundamental problem of handshake communication (which can be viewed as achieving matchings in a dynamically changing graph, via distributed algorithms) in that an efficient solution to each of them implies an efficient solution to the other. We provide realtime solutions to the resource allocation problem (that is, we give distributed algorithms with real time response). We make essential use of probabilistic techniques as first used by (Rabin, 80b), where processes are allowed to make independent probabilistion choices. On the other hand, no probability assumptions about the system behavior are made
Theory of computing  STOC 2002 : proceedings by Annual ACM Symposium on Theory of Computing. STOC(
Book
)
1 edition published in 2002 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 5 WorldCat member libraries worldwide
Efficient Symbolic Analysis of Programs by
J. H Reif(
Book
)
4 editions published in 1982 in English and Undetermined and held by 5 WorldCat member libraries worldwide
This paper is concerned with constructing, for each expression in a given program text, a symbolic expression whose value is equal to the value of the text expression for all executions of the program. A cover is a mapping from text expressions to such symbolic expressions. Covers can be used for constant propagation, code motion, and a variety of other program optimizations. Covers can also be used as an aid in symbolic program execution and for finding loop invariants for program verification. We describe a direct (noniterative) algorithm for computing a cover. The cover computed by an algorithm is characterized as the minimum of a certain fixed point equation, and is in general a better cover than might be computed by iteration methods (which can compute fixed point covers which are not minimal). Our algorithm is efficient and applicable to all flow graphs. A variant of an algorithm is implemented by (KK) in an optimizing compiler for Pascal. R1 extends our algorithm to symbolic analysis of programs with records, such as LISP and PASCAL programs. (Author)
4 editions published in 1982 in English and Undetermined and held by 5 WorldCat member libraries worldwide
This paper is concerned with constructing, for each expression in a given program text, a symbolic expression whose value is equal to the value of the text expression for all executions of the program. A cover is a mapping from text expressions to such symbolic expressions. Covers can be used for constant propagation, code motion, and a variety of other program optimizations. Covers can also be used as an aid in symbolic program execution and for finding loop invariants for program verification. We describe a direct (noniterative) algorithm for computing a cover. The cover computed by an algorithm is characterized as the minimum of a certain fixed point equation, and is in general a better cover than might be computed by iteration methods (which can compute fixed point covers which are not minimal). Our algorithm is efficient and applicable to all flow graphs. A variant of an algorithm is implemented by (KK) in an optimizing compiler for Pascal. R1 extends our algorithm to symbolic analysis of programs with records, such as LISP and PASCAL programs. (Author)
Motion planning in the presence of moving obstacles by
J. H Reif(
Book
)
4 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide
This paper investigates the computational complexity of planning the motion of a body B in 2D or 3D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated. We provide evidence that the 3D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACEhard if B is given a velocity modulus bound on its movements and is NP hard even if B has no velocity modulus bound, where in both cases B has 6 degrees of freedom. To prove these results we use a unique method of simulation of a Turing machine which uses time to encode configurations (whereas previous lower bound proofs in robotics used the system position to encode configurations and so required unbounded number of degrees of freedom). We also investigate a natural class of dynamic problems which we call asteroid avoidance problems: B, the object we wish to move, is a convex polyhedron which is free to move by translation with bounded velocity modulus and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance
4 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide
This paper investigates the computational complexity of planning the motion of a body B in 2D or 3D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated. We provide evidence that the 3D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACEhard if B is given a velocity modulus bound on its movements and is NP hard even if B has no velocity modulus bound, where in both cases B has 6 degrees of freedom. To prove these results we use a unique method of simulation of a Turing machine which uses time to encode configurations (whereas previous lower bound proofs in robotics used the system position to encode configurations and so required unbounded number of degrees of freedom). We also investigate a natural class of dynamic problems which we call asteroid avoidance problems: B, the object we wish to move, is a convex polyhedron which is free to move by translation with bounded velocity modulus and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance
O(log²n) time efficient parallel factorization of dense, sparse separable, and banded matrices by
J. H Reif(
Book
)
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Known polylog parallel algorithms for the solution of linear systems and related problems require computation of the characteristic polynomial or related forms, which are known to be highly unstable in practice. However, matrix factorizations of various types, bypassing computation of the characteristic polynomial, are used extensively in sequential numerical computations and are essential in many applications
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Known polylog parallel algorithms for the solution of linear systems and related problems require computation of the characteristic polynomial or related forms, which are known to be highly unstable in practice. However, matrix factorizations of various types, bypassing computation of the characteristic polynomial, are used extensively in sequential numerical computations and are essential in many applications
A simple threedimensional realtime reliable cellular array by
Péter Gács(
Book
)
1 edition published in 1987 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 3 WorldCat member libraries worldwide
Proceedings of the thirtyfourth annual ACM Symposium on Theory of Computing by
ACM Symposium on Theory of Computing(
Book
)
2 editions published in 2002 in English and held by 1 WorldCat member library worldwide
2 editions published in 2002 in English and held by 1 WorldCat member library worldwide
Implementation of Parallel Algorithms(
)
7 editions published between 1991 and 1993 in English and held by 0 WorldCat member libraries worldwide
Work is progressing in the design of a new, general intermediate representation for parallel code. We wish to provide a single compilation target that is executable on a wide variety of parallel machines and vector processors. The representation we are designing is an extension of VCODE, due to Blelloch at CMU, which is particularly suitable as a target only for dataparallel language. VCODE provides a rich set of vector operations, including powerful segmented prefix computations and permutation operations, which run efficiently on a wide range of architectures. However, VCODE provides only sequential control, which limits its application strictly to dataparallel programming. We have extended VCODE to form a new language called AVCODE which has operations for process creation, communication, and synchronization. AVCODE provides an avenue for efficiently targeting a parallel language to a number of different hardware systems through a single intermediate language
7 editions published between 1991 and 1993 in English and held by 0 WorldCat member libraries worldwide
Work is progressing in the design of a new, general intermediate representation for parallel code. We wish to provide a single compilation target that is executable on a wide variety of parallel machines and vector processors. The representation we are designing is an extension of VCODE, due to Blelloch at CMU, which is particularly suitable as a target only for dataparallel language. VCODE provides a rich set of vector operations, including powerful segmented prefix computations and permutation operations, which run efficiently on a wide range of architectures. However, VCODE provides only sequential control, which limits its application strictly to dataparallel programming. We have extended VCODE to form a new language called AVCODE which has operations for process creation, communication, and synchronization. AVCODE provides an avenue for efficiently targeting a parallel language to a number of different hardware systems through a single intermediate language
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Paige, Robert A. Other Author Editor
 Chen, Junghuei 1960 Author Editor
 Wachter, R. F. Other Editor
 Rajasekaran, Sanguthevar Author Editor
 United States National Aeronautics and Space Administration
 Storer, James A. (James Andrew) 1953 Editor
 IEEE Computer Society
 ACM Special Interest Group for Algorithms and Computation Theory
 HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB
 Spirakis, Paul G. Author
Associated Subjects
Algorithms Computational complexity Computer algorithms Computer architecture Computer programming Computer programs Computer science Data compression (Computer science) Electronic data processing Electronics Engineering Geometry Graph theory Information storage and retrieval systems Integrated circuitsVery large scale integration Linear systems Logic, Symbolic and mathematical Matrices Motion Parallel processing (Electronic computers) Predicate calculus Programming (Mathematics) Punched card systems Realtime data processing Robots