Newsgroups: comp.parallel From: valerie@cri.ens-lyon.fr (valerie roger) Subject: ppl contents Organization: ecole normale superieure de lyon Date: Thu, 14 Oct 1993 13:18:41 GMT Please find hereafter the contents of Parallel Processing Letters, volumes 1 and 2. Valerie Roger, LIP, ENS Lyon %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{document} {\bf PARALLEL PROCESSING LETTERS}\\ Parallel Processing Letters (PPL) aims to disseminate rapidly results in the field of parallel processing in the form of short letters. It will have a wide scope and cover topics such as the design and analysis of parallel and distributed algorithms, the theory of parallel computation, parallel programming languages, parallel programming environments, parallel architectures and VLSI circuits. Original results are published, and experimental results if they contain an analysis corresponding to an abstract m odel of computation. PPL is be and ideal information vehicle for recent high quality achievements. Information can be obtained form the Editor in Chief, Professor Michel Cosnard at cosnard@lip.ens-lyon.fr \end{document} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentstyle[11pt,french,a4]{letter} %\title{\bf} %\author{\mbox{}} %\date{\mbox{}} %\pagestyle{empty} %\maketitle %\parindent=0cm \begin{document} \begin {center} {\bf PARALLEL PROCESSING LETTERS}\\ CONTENTS - Volume 1 - Number 1 - September 1991 \end {center} \begin {tabular} {p{145mm}r} Editorial Note\\ M. Cosnard & 1\\ \\ Determining the Model in Parallel\\ E.A. Albacea & 3\\ \\ Maintaining Digital Clocks in Step\\ A. Arora, S. Dolev, M. Gouda & 11\\ \\ SyNsthesis of Processor Arrays for the Algebraic Path Problem: Unifying Old\\ Results and Deriving New Architectures\\ T. Risset, Y. Robert & 19\\ \\ On the Power of Two-Dimensional Processor Arrays with Reconfigurable Bus\\ Systems\\ S. Olariu, J. Schwing, J. Zhang & 29\\ \\ Additive Spanners for Hypercubes\\ A.L. Liestman , T.C. Shermer & 35\\ \\ Subcube Embeddability of Folded Hypercubes\\ S. Latifi & 43\\ \\ An O(n) Parallel Algorithm for Solving the Traffic ContrOl Problem\\ on Crossbar Switch Networks\\ K.T. Sun, H.C. Fu & 51\\ \\ Modelling a Morphological Thinning Algorithm for Shared Memory\\ SIMD Computers\\ A. Datta, S.V. Joshi, R.N. Mahapatra & 59\\ \\ A Note on Off-Line Permutation Routing on a Mesh-Connected Processor\\ Array\\ D. Krizanc & 67\\ \end {tabular} \end{document} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentstyle[11pt,french,a4]{letter} \title %\author{\mbox{}} %\date{\mbox{}} %\pagestyle{empty} \maketitle \parindent=0cm \begin {document} \begin {center} {\bf PARALLEL PROCESSING LETTERS\\ CONTENTS - Volume 1 - Number 2 - December 1991} \end {center} \begin {tabular} {p{145mm}r} Editorial Note\\ M. Cosnard & 71\\ \\ Linear Scheduling is Nearly Optimal\\ A. Darte, L. Khachiyan, Y. Robert & 73\\ \\ Specifying Control Signals for Systolic Arrays by Uniform Recurrence\\ Equations\\ J. Xue & 83\\ \\ Conflict-Free Strides for Vectors in Matched Memories\\ M. Valero, T. Lang, JM. Llaberia, M. Peiron, JJ. Navarro, E. Ayguadi & 95\\ \\ On the Real Power of Loosely Coupled Parallel Architectures\\ M. Cosnard, A. Ferreira & 103\\ \\ Large Sorting and Routing Problems on the Hypercube and Related Networks\\ G. Manzini & 113\\ \\ On Lower Bounds for the Communication Volume in Distributed Systems\\ UA. Ranawake, PM. Lenders, S.M. Goodnick & 125\\ \\ An Improved Maximal Matching Algorithm\\ SB. Yang, SK. Dhall, S. Lakshmivarahan & 135\\ \\ Constant Delay Parallel Counters\\ SG. Akl, T. Duboux, I. Stojmenovic & 143\\ \\ Ranking on Reconfigurable Networks\\ Y. Ben-Asher, A. Schuster & 149\\ \\ On Processing Multi-Joins in Parallel Systems\\ KL. Tan, H. Lu & 157\\ \\ Author Index - Volume 1 (1991) & 165\\ \end {tabular} \end{document} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentstyle[11pt,french,a4]{letter} %\title{\bf} %\author{\mbox{}} %\date{\mbox{}} %\pagestyle{empty} %\maketitle %\parindent=0cm \begin{document} \begin {center} {\bf PARALLEL PROCESSING LETTERS}\\ CONTENTS - Volume 2 - Number 1 - March 1992 \end {center} \begin {tabular} {p{145mm}r} Editorial Note\\ M. Cosnard & 1\\ \\ Construction of Large Packet Radio Networks\\ JC Bermond, P. Hell, JJ. Quisquater& 3\\ \\ The Cube-Connected Cycles Network is a Subgraph of the Butterfly Network\\ R. Feldmann, W. Unger & 13\\ \\ Distributed Deadlock Detection Algorithms\\ M. Flatebo, A.K. Datta & 21\\ \\ Optimal Tree Ranking is in NC\\ P. de la Torre, R. Greenlaw, TM. Przytycka & 31\\ \\ Descriminating Analysis and its Application to Matrix by Vector \\ Multiplication on the PRAM\\ LF. Lindon & 43\\ \\ Performance Estimation of LU Factorisation on Message Passing\\ Multiprocessors\\ BV. Purushotham, A. Basu, PS. Kumar, LM. Patnaik & 51\\ \\ The Combination Technique for the Sparse Grid Solution of PDE's on Multiprocessor Machines\\ M. Griebel & 61\\ \\ Refined Mark(s)-Set-Based Backtrack Literal Selection for AND Parallelism in Logic Programs \\ DH. Kim, KM. Choe, T. Han & 71\\ \\ Mapping Binary Precedence Trees to Hypercubes\\ S. Ullman, B. Narahari & 81\\ \\ Optimal Subcube Assignment for Partitionable Hypercubes\\ R. Krishnamurti, B. Narahari & 89\\ \\ Synthesizing Linear Systolic Arrays for Dynamic Programming Problems\\ JF. Myoupo & 97\\ \end {tabular} \end{document} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentstyle[11pt,a4,french]{article} \title{\bf PARALLEL PROCESSING LETTERS\\ CONTENTS - Volume 2 - Number 2 \& 3 - September 1992} \author{\mbox{}} \date{\mbox{}} \pagestyle{empty} \parindent=0cm \begin{document} \maketitle %\begin {center} %{\bf PARALLEL PROCESSING LETTERS\\ %CONTENTS - Volume 2 - Number 2 \& 3 - September 1992} %\end {center} \begin {tabular} {p{145mm}r} Editorial Note\\ M. Cosnard & 111\\ \\ PPL Special Issue on Algorithmic and Structural Aspects of Interconnection\\ Networks : Call for Papers & 115\\ \\ Reconfigurable Parallel Computer Architecture Based on Wavelength-Division\\ Multiplexed Optical Interconnextion Network\\ KA. Aly, PW. Dowd & 117\\ \\ A Reconfiguration Technique for Fault Tolerance in a Hypercube\\ S Rai, JL. Trahan & 129\\ \\ Load Balancing Strategies for Massively Parallel Architectures\\ A. Corradi, L. Leonardi, F. Zambonelli & 139\\ \\ Embedding Mesh in a Large Family of Graphs\\ WJ. Hsu, CV. Page & 149\\ \\ A Parallel Algorithm for Forest Reconstruction\\ S. Olariu, Z. Wen & 157\\ \\ Performance Evaluation of Multicast Wormhole Routing in 2D-Torus\\ Multicomputers\\ CS. Yang, YM Tsai, CY. Liu & 161\\ \\ \end{tabular} \begin{tabular}{p{145mm}r} A Self-Stabilizing Distributed Algorithm to Construct BFS Spanning\\ Trees of a Symmetric Graph\\ S. Sur, PK. Srimani & 171\\ \\ Approximating Maximum 2-CNF Satisfiability\\ DJ. Haglin & 181\\ \\ DTML is Logspace Hard Under $NC^{1}$ Reductions\\ R. Sarnarth & 189\\ \\ Transitive Closure in Parallel on a Linear Network of Processors\\ M. Gastaldo, M. Morvan, JM. Robson & 195\\ \\ The Pairwise Sorting Network\\ I. Parberry & 205\\ \\ Periodic Sorting on Two-Dimensional Meshes\\ M. Kutylowski, R. Wanka & 213\\ \\ Efficient K-Selection in Hypercube Multiprocessors\\ P. Berthomi & 221\\ \\ A Simple Optimal Systolic Algorithm for Generating Permutations\\ SG. Akl, I. Stojmenovic & 231\\ \\ Systolic Generation of Combinations from Arbitrary Elements\\ H. Elhage, I. Stojmenovic & 241\\ \\ Convex Polygon Problems on Meshes with Multiple Broadcasting\\ D. Bhagavathi, S. Olariu, JL. Schwing, J. Zhang & 249\\ \\ A Parallel Processing Model for Real-Time Computer Vision-Aided Road\\ Traffic Monitoring\\ AT. Ali, EL. Dagless & 257\\ \\ A Model of Speculative Parallelism\\ WF. Wong, CK. Yuen & 265\\ \\ Unimodularity and the Parallelization of Loops\\ M. Barnett, C. Lengauer & 273\\ \\ An Improvement of Maekawa's Mutual Exclusion Algorithm to Make it\\ Fault-Tolerant\\ A. Bouabdallah, JC. Konig & 283\\ \\ On Asynchronous Avoidance of Deadlocks in Parallel Programs\\ AE. Doroshenko & 291\\ \end {tabular} \end{document} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentstyle[11pt,french,a4]{letter} %\title{\bf} %\author{\mbox{}} %\date{\mbox{}} %\pagestyle{empty} %\maketitle %\parindent=0cm \begin{document} \begin {center} {\bf PARALLEL PROCESSING LETTERS}\\ CONTENTS - Volume 2 - Number 4 - December 1992 \end {center} \begin {tabular} {p{145mm}r} Editorial Note\\ M. Cosnard & 299\\ \\ Constructing An Exact Parity Base is in $RNC^{2}$\\ G. Galbiati, F. Maffioli & 301\\ \\ Parallel Constructions of Heaps and Min-Max Heaps\\ S. Carlsson, J. Chen & 311\\ \\ Computation List Evaluation and Its Applications\\ EA. Albacea & 321\\ \\ Data Parallel Computation of Euclidean Distance Transforms\\ T. Bossomaier, N. Isidoro, A. Loeff & 331\\ \\ Two Selection Algorithms on A Mesh-Connected Computer\\ BS. Chlebus & 341\\ \\ Channel Classes: A New Concept for Deadlock Avoidance in\\ Wormhole Networks\\ J. Duato & 347\\ \\ Broadcasting Time in Sparse Networks with Faulty Transmissions\\ A. Pelc & 355\\ \\ A Low Overhead Schedule for A 3D-Grid Graph\\ E. Bampis, JC Konig, D. Trystram & 363\\ \\ Multi-Rate Arrays and Affine Recurrence Equations\\ PM. Lenders & 373\\ \\ Simulation of Genetic Algorithms on MIMD Multicomputers\\ I. De Falco, R. Del Balio, E. Tarantino, R. Vaccaro & 381\\ \\ Parallel Buddy Memory Management\\ T. Johnson, TA. Davis & 391\\ \\ Author Index - Volume 2 (1992) & 399\\ \end {tabular} \end{document} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% --- Valerie ROGER Laboratoire de l'Informatique du Parallelisme Ecole Normale Superieure 46, allee d'Italie 69364 LYON CEDEX 07 FRANCE Phone : (+33) 72 72 80 37 EARN/BITNET : valerie@frensl61.bitnet Fax : (+33) 72 72 80 80 FNET/EUNET/UUNET : valerie@ensl.ens-lyon.fr