Hyafil, L.
Overview
Works:  14 works in 32 publications in 2 languages and 32 library holdings 

Roles:  Author 
Classifications:  QA76, 001.6408 S 
Publication Timeline
.
Most widely held works by
L Hyafil
Parallel algorithms for solving triangular linear systems with small parallelism by L Hyafil(
Book
)
7 editions published between 1974 and 1975 in English and Undetermined and held by 9 WorldCat member libraries worldwide
The problem of solving triangular linear systems of size n on a parallel computer with small parallelism is considered. Assume that the time is measured by the number of parallel steps of any arithmetic operation. It is shown that the problem can be done in time n squared/k + O(n) with k processors for k <or = O(n), O(n sup (2r) log n) with O(n sup r) processors for 1 <r <3/2, and O(n sup (1r/3) (log sup 2)n) with O(n sup r) processors for 3/2 <or = r <or = 3. The results are obtained by using two principles of reducing parallel algorithms with large parallelism to parallel algorithms with small parallelism. The two principles for the reduction are expected to be useful for other problems
7 editions published between 1974 and 1975 in English and Undetermined and held by 9 WorldCat member libraries worldwide
The problem of solving triangular linear systems of size n on a parallel computer with small parallelism is considered. Assume that the time is measured by the number of parallel steps of any arithmetic operation. It is shown that the problem can be done in time n squared/k + O(n) with k processors for k <or = O(n), O(n sup (2r) log n) with O(n sup r) processors for 1 <r <3/2, and O(n sup (1r/3) (log sup 2)n) with O(n sup r) processors for 3/2 <or = r <or = 3. The results are obtained by using two principles of reducing parallel algorithms with large parallelism to parallel algorithms with small parallelism. The two principles for the reduction are expected to be useful for other problems
The complexity of parallel evaluation of linear recurrences by L Hyafil(
Book
)
6 editions published between 1974 and 1975 in English and held by 7 WorldCat member libraries worldwide
The concept of computers such as C.mmp and ILLIAC 4 is to achieve computational speedup by performing several operations simultaneously with parallel processors. This type of computer organization is referred to as a parallel computer. In this paper, the authors prove upper bounds on speedups achievable by parallel computers for a particular problem, the solution of first order linear recurrences. The authors consider this problem because it is important in practice and also because it is simply stated so that one might obtain some insight into the nature of parallel computation by studying it
6 editions published between 1974 and 1975 in English and held by 7 WorldCat member libraries worldwide
The concept of computers such as C.mmp and ILLIAC 4 is to achieve computational speedup by performing several operations simultaneously with parallel processors. This type of computer organization is referred to as a parallel computer. In this paper, the authors prove upper bounds on speedups achievable by parallel computers for a particular problem, the solution of first order linear recurrences. The authors consider this problem because it is important in practice and also because it is simply stated so that one might obtain some insight into the nature of parallel computation by studying it
Bounds on the SpeedUp of Parallel Evaluation of Recurrences by L Hyafil(
Book
)
2 editions published in 1975 in English and held by 2 WorldCat member libraries worldwide
To understand the performance of parallel computers such as ILLIAC IV and C.mmp, the largest speedup that can be obtained for a given task must be known. If there are k processors, the largest speedup that can be achieved is k and the authors call this optimal speedup. The speedups in general depend on the parallel decompositon of a particular computing task and the various aspects of the multiprocessing system, including memory contention, process communication, operating system overhead, etc. In this paper, the authors concentrate on the issue of decomposing tasks, and assume that the multiprocessing system is idealized so that it causes no delays at all. It is shown that even under this idealized assumption, there are problems for which, because the parallel decompositions are inherently difficult, the optimal speedup cannot be achieved
2 editions published in 1975 in English and held by 2 WorldCat member libraries worldwide
To understand the performance of parallel computers such as ILLIAC IV and C.mmp, the largest speedup that can be obtained for a given task must be known. If there are k processors, the largest speedup that can be achieved is k and the authors call this optimal speedup. The speedups in general depend on the parallel decompositon of a particular computing task and the various aspects of the multiprocessing system, including memory contention, process communication, operating system overhead, etc. In this paper, the authors concentrate on the issue of decomposing tasks, and assume that the multiprocessing system is idealized so that it causes no delays at all. It is shown that even under this idealized assumption, there are problems for which, because the parallel decompositions are inherently difficult, the optimal speedup cannot be achieved
Bornes inferieures pour la complexite des polynomes a coefficients 01 by L Hyafil(
Book
)
2 editions published in 1976 in French and held by 2 WorldCat member libraries worldwide
2 editions published in 1976 in French and held by 2 WorldCat member libraries worldwide
Graph partitioning and constructing optimal decision trees are polynomial complete problems by
Institut de recherche d'informatique et d'automatique(
Book
)
3 editions published in 1973 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1973 in English and held by 2 WorldCat member libraries worldwide
Bounds for selection by Laurent Hyafil(
Book
)
2 editions published in 1974 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1974 in English and held by 2 WorldCat member libraries worldwide
Un Algorithme de recherche des prédominateurs dans un graphe orienté by L Hyafil(
Book
)
1 edition published in 1973 in French and held by 1 WorldCat member library worldwide
1 edition published in 1973 in French and held by 1 WorldCat member library worldwide
Sur la complexité de certains polynômes by Laurent Hyafil(
Book
)
2 editions published in 1975 in French and held by 1 WorldCat member library worldwide
2 editions published in 1975 in French and held by 1 WorldCat member library worldwide
Design of optimal merge on direct access devices by L Hyafil(
Book
)
2 editions published in 1973 in English and held by 1 WorldCat member library worldwide
2 editions published in 1973 in English and held by 1 WorldCat member library worldwide
Allocation optimale et quasi optimale de la mémoire centrale dans le tri par fusion sur disque by L Hyafil(
Book
)
1 edition published in 1974 in French and held by 1 WorldCat member library worldwide
1 edition published in 1974 in French and held by 1 WorldCat member library worldwide
Optimal search for the zero of the (n1)th derivative by L Hyafil(
Book
)
in English and held by 1 WorldCat member library worldwide
in English and held by 1 WorldCat member library worldwide
On the parallel evaluation of rational functions by Laurent Hyafil(
Book
)
1 edition published in 1977 in English and held by 1 WorldCat member library worldwide
1 edition published in 1977 in English and held by 1 WorldCat member library worldwide
Optimal search for the zero of the (n1)st derivative by Laurent Hyafil(
Book
)
1 edition published in 1977 in English and held by 1 WorldCat member library worldwide
1 edition published in 1977 in English and held by 1 WorldCat member library worldwide
The power of commutativity by L Hyafil(
Book
)
1 edition published in 1977 in English and held by 1 WorldCat member library worldwide
1 edition published in 1977 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Kung, H. T.
 CarnegieMellon University Computer Science Department
 CARNEGIEMELLON UNIV PITTSBURGH PA Dept. of COMPUTER SCIENCE
 Vuillemin, J.
 Prusker, F.
 Rivest, Ronald L.
 Wiele, JeanPaul van de Mathematician, France 20th C.
 Wiele, J. P. van de
 Institut de recherche d'informatique et d'automatique
 Wiele, J. P. van de