%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.14", %%% date = "07 July 2005", %%% time = "07:46:00 MDT", %%% filename = "parallelprocesslett.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "http://www.math.utah.edu/~beebe", %%% checksum = "26348 14493 57515 564660", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "BibTeX, bibliography, Parallel Processing %%% Letters", %%% supported = "yes", %%% docstring = "This is an almost complete bibliography of %%% Parallel Processing Letters (CODEN PPLTEE, %%% ISSN 0129-6264), published by World %%% Scientific. Publication began with volume %%% 1 in September 1991. %%% %%% The journal has World-Wide Web sites at %%% %%% http://www.ens-lyon.fr/PPL/ %%% http://www.wspc.co.uk/wspc/Journals/ppl/ppl.html %%% http://www.wspc.com/journals/journals.html %%% http://www.wspc.com/journals/ppl/ppl.html %%% http://www.worldscinet.com/ppl/ppl.shtml %%% %%% with a LaTeX style file, but only a few %%% tables of contents. %%% %%% At version 1.14, the year coverage looked %%% like this: %%% %%% 1991 ( 19) 1996 ( 53) 2001 ( 39) %%% 1992 ( 43) 1997 ( 41) 2002 ( 31) %%% 1993 ( 51) 1998 ( 58) 2003 ( 57) %%% 1994 ( 44) 1999 ( 53) 2004 ( 36) %%% 1995 ( 60) 2000 ( 35) %%% %%% Article: 620 %%% %%% Total entries: 620 %%% %%% Data for the bibliography has been collected %%% from the journal Web site, from the Compendex %%% database (1990--1996), from the %%% bibliographies in the TeX User Group %%% collection, from bibliographies in the %%% author's personal files, from the IEEE INSPEC %%% databases (1991--1997), and from the computer %%% science bibliography collection on %%% ftp.ira.uka.de in /pub/bibliography to which %%% many people of have contributed. The %%% snapshot of this collection was taken on %%% 5-May-1994, and it consists of 441 BibTeX %%% files, 2,672,675 lines, 205,289 entries, and %%% 6,375 String{} abbreviations, occupying %%% 94.8MB of disk space. The OCLC Contents1st %%% database does NOT cover this journal, nor %%% does the Science Citation Index database. %%% %%% Numerous errors in the sources noted above %%% have been corrected. Spelling has been %%% verified with the UNIX spell and GNU ispell %%% programs using the exception dictionary %%% stored in the companion file with extension %%% .sok. %%% %%% BibTeX citation tags are uniformly chosen %%% as name:year:abbrev, where name is the %%% family name of the first author or editor, %%% year is a 4-digit number, and abbrev is a %%% 3-letter condensation of important title %%% words. Citation tags were automatically %%% generated by software developed for the %%% BibNet Project. %%% %%% In this bibliography, entries are sorted in %%% publication order, using ``bibsort -byvolume''. %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|http://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"} %%% ==================================================================== %%% Bibliography entries: @Article{Albacea:1991:DMP, author = "E. A. Albacea", title = "Determining the mode in parallel", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "3--10", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia", countrypub = "Singapore", keywords = "linear time; optimal; parallel algorithm; parallel algorithms; set; sorting; sorting multisets; upper bound", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Arora:1991:MDC, author = "A. Arora and S. Dolev and M. Gouda", title = "Maintaining digital clocks in step", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "11--18", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B1265Z (Other digital circuits); C5150 (Other circuits for digital computers)", corpsource = "Dept. of Comput. Sci., Texas Univ., TX, USA", countrypub = "Singapore", keywords = "clocks; N-clock; simultaneously triggered clocks; stabilisation; stability; system", treatment = "P Practical", } @Article{Risset:1991:SPA, author = "T. Risset and Y. Robert", title = "Synthesis of processor arrays for the algebraic path problem: unifying old results and deriving new architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "19--28", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Lab. de l'Inf. du Parallelisme, LIP-IMAG, Lyon, France", countrypub = "Singapore", keywords = "acyclic graphs; algebraic path problem; computational complexity; constraints; direct; directed graphs; integration; limited broadcast facilities; processor arrays synthesis; systolic architectures; systolic arrays", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Olariu:1991:PTP, author = "S. Olariu and J. L. Schwing and Jingyuan Zhang", title = "On the power of two-dimensional processor arrays with reconfigurable bus systems", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "29--34", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "CRCW shared memory computer; parallel algorithms; PARBS; PARITY problem; power; reconfigurable bus; systems; systolic arrays; two-dimensional processor arrays", treatment = "P Practical", } @Article{Liestman:1991:ASH, author = "A. L. Liestman and T. C. Shermer", title = "Additive spanners for hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "35--42", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220 (Computer architecture)", corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada", countrypub = "Singapore", keywords = "additive spanners; hypercube networks; hypercubes; subnetwork; t-spanner", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Latifi:1991:SEF, author = "S. Latifi", title = "Subcube embeddability of folded hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "43--50", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Dept. of Electr. and Comput. Eng., Nevada Univ., Las Vegas, NV, USA", countrypub = "Singapore", keywords = "allocation; folded hypercubes; hypercube networks; hypercube-based network; n-dimensional hypercube; parallel architectures; processor utilization; subcube", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Sun:1991:PAS, author = "K. T. Sun and H. C. Fu", title = "An {O}(n) parallel algorithm for solving the traffic control problem on crossbar switch networks", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "51--58", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C3360 (Transportation systems); C4230 (Switching theory); C4240P (Parallel programming and algorithm theory); C7420 (Control engineering)", corpsource = "Dept. of Comput. Sci. and inf. Eng., Nat. Chiao-Tung Univ., Hsin Chu, Taiwan", countrypub = "Singapore", keywords = "computational complexity; conflict-free paths; crossbar; energy function; message packets; networks; NP-complete problem; O(n) parallel algorithm; parallel algorithms; salesman problem; switch networks; switching; time complexity; traffic computer control; traffic control problem; traveling", treatment = "A Application; P Practical", } @Article{Datta:1991:MMT, author = "A. Datta and S. V. Joshi and R. N. Mahapatra", title = "Modelling a morphological thinning algorithm for shared memory {SIMD} computers", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "59--65", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C5260B (Computer vision and picture processing)", corpsource = "Dept. of Electron. and Electr. Commun. Eng., Indian Inst. of Technol., Kharagpur, India", countrypub = "Singapore", keywords = "computerised picture processing; cost complexity; morphological thinning algorithm modelling; shared memory SIMD computers; time complexity", treatment = "P Practical", } @Article{Krizanc:1991:NOP, author = "D. Krizanc", title = "A note on off-line permutation routing on a mesh-connected processor array", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "1", pages = "67--70", month = sep, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6150C (Switching theory); C4230 (Switching theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA", countrypub = "Singapore", keywords = "mesh-connected processor array; offline permutation routing; packet switching; packets; parallel algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Darte:1991:LSN, author = "A. Darte and L. Khachiyan and Y. Robert", title = "Linear scheduling is nearly optimal", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "73--81", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150N (Distributed systems)", corpsource = "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", keywords = "algorithms; convex domain; fat domains; free greedy schedule; linear scheduling; optimal schedulings; parallel algorithms; scheduling; uniform dependence", treatment = "T Theoretical or Mathematical", } @Article{Xue:1991:SCS, author = "Jingling Xue", title = "Specifying control signals for systolic arrays by uniform recurrence equations", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "83--93", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", countrypub = "Singapore", keywords = "control flow; control signals; correctness; data flow; mapping; necessary and sufficient conditions; optimisation; parallel algorithms; parallel programming; programming; recurrence equations; space-time; specification; systolic arrays; theory; uniform", treatment = "T Theoretical or Mathematical", } @Article{Valero:1991:CSV, author = "M. Valero and T. Lang and J. M. Llaberia and M. Peiron and Navarro and J. J. and E. Ayguade", title = "Conflict-free strides for vectors in matched memories", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "95--102", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6120 (File organisation)", corpsource = "Dept. d'Arquitectura de Computadors, Univ. Politecnica de Catalunya, Barcelona, Spain", countrypub = "Singapore", keywords = "access; conflict-free access; linear transformations; matched memories; out-of-order; parallel programming; skewing; storage management; strides; vector processors; vector registers", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Cosnard:1991:RPL, author = "M. Cosnard and A. Ferreira", title = "On the real power of loosely coupled parallel architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "103--111", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "LIP-IMAG/CNRS, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", keywords = "abstract models; complexity theory; computational complexity; concurrent read/write access; Hypercube Random Access Machine; loosely coupled parallel architectures; machines; memory parallel computers; parallel; parallel architectures; parallel machines; PRAM; SIMD distributed", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Manzini:1991:LSR, author = "G. Manzini", title = "Large sorting and routing problems on the {Hypercube} and related networks", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "113--124", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory)", corpsource = "Scuola Normale Superior, Pisa, Italy", countrypub = "Singapore", keywords = "algorithms; bounds; butterfly network; computational complexity; cube connected cycles network; hypercube network; hypercube networks; integer sorting; lower bounds; packet routing; parallel; shuffle network; sorting; upper", treatment = "T Theoretical or Mathematical", } @Article{Ranawake:1991:LBC, author = "U. A. Ranawake and P. M. Lenders and S. M. Goodnick", title = "On lower bounds for the communication volume in distributed systems", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "125--133", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4140 (Linear algebra); C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Electr. and Comput. Eng., Oregon State Univ., Corvallis, OR, USA", countrypub = "Singapore", keywords = "adjacency; communication volume; computational complexity; distributed processor system; eigenvalues; eigenvalues and eigenfunctions; graph theory; graphs; hypercube multiprocessor; hypercube networks; lower bound; lower bounds; matrix; matrix algebra; processor graph; task", treatment = "T Theoretical or Mathematical", } @Article{Yang:1991:IMM, author = "S. B. Yang and S. K. Dhall and S. Lakshmivarahan", title = "An improved maximal matching algorithm", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "135--142", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Sch. of Electr. Eng. and Comput. Sci., Oklahoma Univ., OK, USA", countrypub = "Singapore", keywords = "computational complexity; edges; EREW PRAM; graph theory; parallel algorithms; randomized parallel maximal matching algorithm; undirected graph; vertices", treatment = "T Theoretical or Mathematical", } @Article{Akl:1991:CDP, author = "S. G. Akl and T. Duboux and I. Stojmenovic", title = "Constant delay parallel counters", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "143--148", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "array; binary counters; constant delay parallel counters; constant size memory; cost-; decimal counters; lexicographic order; linear; optimal parallel algorithm; parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Ben-Asher:1991:RRN, author = "Y. Ben-Asher", title = "Ranking on reconfigurable networks", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "149--156", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Haifa Univ., Israel", countrypub = "Singapore", keywords = "data reduction; dynamically reconfiguring machines; multiprocessor interconnection networks; parallel algorithms; parallel operations; performance; ranking; ranking algorithm; reconfigurable mesh; reconfigurable networks; sorting", treatment = "T Theoretical or Mathematical", } @Article{Tan:1991:PMJ, author = "Kian-Lee Tan and Hongjun Lu", title = "On processing multi-joins in parallel systems", journal = j-PARALLEL-PROCESS-LETT, volume = "1", number = "2", pages = "157--164", month = dec, year = "1991", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C4250 (Database theory); C6110P (Parallel programming); C6160D (Relational DBMS)", corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of Singapore, Singapore", countrypub = "Singapore", keywords = "completion time; concurrently executed; database theory; multiple joins; parallel algorithms; parallel programming; parallel systems; relational databases; tasks", treatment = "T Theoretical or Mathematical; X Experimental", } @Article{Bermond:1992:CLP, author = "J.-C. Bermond and P. Hell and J.-J. Quisquater", title = "Construction of large packet radio networks", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "3--12", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6230 (Switching centres and equipment); B6250 (Radio links and equipment); C4230M (Multiprocessor interconnection)", corpsource = "CNRS, Nice Univ., Valbonne, France", countrypub = "Singapore", keywords = "chromatic index; digraphs; directed graphs; graphs; hypercube networks; hypercubes; large packet radio networks; multiplexing; packet radio networks; telecommunication networks; time division; time division multiplexing", treatment = "P Practical", } @Article{Feldmann:1992:CCN, author = "R. Feldmann and W. Unger", title = "The cube-connected cycles network is a subgraph of the {Butterfly} network", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "13--19", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Dept. of Math. and Comput. Sci., Paderborn Univ., Germany", countrypub = "Singapore", keywords = "Butterfly network; cube-connected; cycles network; data structures; hypercube networks; n-dimensional; n-dimensional DeBruijn network; parallel architectures; shuffle-exchange network; subgraph", treatment = "P Practical", } @Article{Flatebo:1992:DDD, author = "M. Flatebo and A. K. Datta", title = "Distributed deadlock detection algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "21--30", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems); C6150N (Distributed systems)", corpsource = "Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA", countrypub = "Singapore", keywords = "concurrency control; distributed deadlock detection algorithm; distributed processing; loosely connected; probes; state machines; system recovery", treatment = "P Practical", } @Article{delaTorre:1992:OTR, author = "P. {de la Torre} and R. Greenlaw and T. M. Przytycka", title = "Optimal tree ranking is in {NC}", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "31--41", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA", countrypub = "Singapore", keywords = "complete; computational complexity; CREW PRAM; labeling; optimal tree ranking; P-; parallel algorithms; sequential algorithm; structures; super critical numbering problem; tree data", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Lindon:1992:DAA, author = "L. F. Lindon", title = "Discriminating analysis and its application to matrix by vector multiplication on the {PRAM}", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "43--50", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "access requests; computational complexity; discriminating analysis; optimal algorithm; parallel algorithms; performance measure; pipelining; PRAM; random-access; storage; vector multiplication", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Purushotham:1992:PEL, author = "B. V. Purushotham and A. Basu and P. S. Kumar and L. M. Patnaik", title = "Performance estimation of {LU} factorisation on message passing multiprocessors", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "51--60", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing)", corpsource = "Centre for Dev. of Adv. Comput., Bangalore, India", countrypub = "Singapore", keywords = "analytical model; characteristics; computation-communication; distributed memory; distributed memory systems; evaluation; LU factorisation; message passing; multiprocessors; parallel execution time; performance; performance estimation; pipelined ring algorithm; speedup", treatment = "P Practical", } @Article{Griebel:1992:CTS, author = "M. Griebel", title = "The combination technique for the sparse grid solution of {PDEs} on multiprocessor machines", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "61--70", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4170 (Differential equations); C4240 (Programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C7310 (Mathematics)", corpsource = "Inst. fur Inf., Tech. Univ. Munchen, Germany", countrypub = "Singapore", keywords = "computational complexity; CRAY Y-MP; mathematics computing; multiprocessing systems; multiprocessor machines; parallel complexity; parallelization; partial differential equations; PDEs; sparse grid solution; Transputer system", treatment = "A Application; P Practical", } @Article{Kim:1992:RMS, author = "Do-Hyung Kim and Kwang-Moo Choe and Taisook Han", title = "Refined mark(s)-set-based backtrack literal selection for {AND} parallelism in logic programs", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "71--79", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110L (Logic programming)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Taejon, South Korea", countrypub = "Singapore", keywords = "data structure; logic programming; logic programs; mark(s)-set-based backtrack literal selection; parallel algorithms; parallelism", treatment = "P Practical", } @Article{Ullman:1992:MBP, author = "S. Ullman and B. Narahari", title = "Mapping binary precedence trees to hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "81--87", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "David Taylor Res. Center, Bethesda, MD, USA", countrypub = "Singapore", keywords = "(mathematics); binary precedence trees mapping; execution time; graph; hypercube networks; hypercubes; linear time procedure; optimal; parallel architectures; parallel computer; precedence; processing elements; task precedence; trees; unit dilation cost", treatment = "P Practical", } @Article{Krishnamurti:1992:OSA, author = "R. Krishnamurti and B. Narahari", title = "Optimal subcube assignment for partitionable hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "89--95", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Vancouver, BC, Canada", countrypub = "Singapore", keywords = "hypercube multiprocessor; hypercube networks; optimal subcube assignment; parallel architectures; partitionable hypercubes; processor assignment problem", treatment = "P Practical", } @Article{Myoupo:1992:SLS, author = "J. F. Myoupo", title = "Synthesizing linear systolic arrays for dynamic programming problems", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "1", pages = "97--110", month = mar, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C5220P (Parallel architecture)", corpsource = "Lab. de Recherche en Inf., Univ. Paris-Sud, Orsay, France", countrypub = "Singapore", keywords = "dynamic programming; geometric considerations; local memory; modular linear systolic arrays design; parallel algorithms; problems; systolic arrays; time delay", treatment = "A Application; P Practical", } @Article{Aly:1992:RPC, author = "K. A. Aly and P. W. Dowd", title = "Reconfigurable parallel computer architecture based on wavelength-division multiplexed optical interconnection network", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "117--127", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5270 (Optical computing techniques)", corpsource = "Dept. of Electr. and Comput. Eng., State Univ. of New York, Buffalo, NY, USA", countrypub = "Singapore", keywords = "congestion; cumulative switching; division multiplexing; edge dilation; latencies; multiple-domain wavelength-division; multiplexed; network; optical interconnection network; optical interconnections; parallel architectures; reconfigurability; structure; wavelength", treatment = "P Practical", } @Article{Rai:1992:RTF, author = "S. Rai and J. L. Trahan", title = "A reconfiguration technique for fault tolerance in a hypercube", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "129--138", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA", countrypub = "Singapore", keywords = "complexity; computational complexity; fault tolerance; fault tolerant computing; fault-free subcube; hypercube; hypercube architecture; hypercube networks; reconfiguration technique", treatment = "T Theoretical or Mathematical", } @Article{Corradi:1992:LBS, author = "A. Corradi and L. Leonardi and F. Zambonelli", title = "Load balancing strategies for massively parallel architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "139--148", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dipartimento di Elettronica, Inf. e Sistemistica, Bologna Univ., Italy", countrypub = "Singapore", keywords = "allocation; architectures; load balancing; massively parallel; object migration; parallel algorithms; parallel architectures; resource", treatment = "T Theoretical or Mathematical", } @Article{Hsu:1992:EML, author = "Wen-Jing Hsu and C. V. Page", title = "Embedding mesh in a large family of graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "149--155", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection)", corpsource = "Dept. of Comput. Technol., Nanyang Technol. Univ., Singapore", countrypub = "Singapore", keywords = "computations; generalized Fibonacci cubes; interconnection network; interconnection networks; mesh embedding; multiprocessor interconnection networks; nearest-neighbor connections; parallel; parallel computer; parallel processing", treatment = "T Theoretical or Mathematical", } @Article{Olariu:1992:PAF, author = "S. Olariu and Z. Wen", title = "A parallel algorithm for forest reconstruction", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "157--160", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "computational complexity; consistency checking; database design; database theory; databases; directed forest; distributed; distributed databases; EREW-PRAM; forest; integer; leaf-to-root paths; parallel algorithm; parallel algorithms; reconstruction; sorting; time complexity; tree data structures", treatment = "T Theoretical or Mathematical", } @Article{Yang:1992:PEM, author = "C. S. Yang and Y. M. Tsai and C. Y. Liu", title = "Performance evaluation of multicast wormhole routing in {2D-Torus} multicomputers", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "161--170", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C6150N (Distributed systems)", corpsource = "Dept. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan", countrypub = "Singapore", keywords = "2D-Torus multicomputers; communication; communication complexity; deadlock-free; evaluation; message routing; multicast; multicast wormhole routing; multicomputer systems; multiprocessing systems; multiprocessor interconnection networks; performance; traffic; wormhole routing", treatment = "T Theoretical or Mathematical", } @Article{Sur:1992:SDA, author = "S. Sur and P. K. Srimani", title = "A self-stabilizing distributed algorithm to construct {BFS} spanning trees of a symmetric graph", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "171--179", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Colorado State Univ., Ft. Collins, CO, USA", countrypub = "Singapore", keywords = "breadth first search; distributed algorithm; distributed processing; graph; graph theory; parallel algorithms; search problems; self-stabilizing; spanning trees; symmetric graph; theoretical reasoning", treatment = "T Theoretical or Mathematical", } @Article{Haglin:1992:AMS, author = "D. J. Haglin", title = "Approximating maximum {2-CNF} satisfiability", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "181--187", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Mankato State Univ., MN, USA", countrypub = "Singapore", keywords = "approximation algorithm; computational complexity; CREW PRAM; maximum 2-CNF satisfiability; parallel; parallel algorithms; satisfiability", treatment = "T Theoretical or Mathematical", } @Article{Sarnath:1992:DLH, author = "R. Sarnath", title = "{DTML} is logspace hard under {NC\slash} sup 1\slash{} reductions", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "189--193", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA", countrypub = "Singapore", keywords = "computational complexity; Different Than Majority; Labeling; logspace hard; NC; NC/sup 1/ reductions; parallel algorithms; polynomial time algorithm", } @Article{Gastaldo:1992:TCP, author = "M. Gastaldo and M. Morvan and J. M. Robson", title = "Transitive closure in parallel on a linear network of processors", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "195--203", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "IMAG, Ecole Normale Superieure, Lyon, France", countrypub = "Singapore", keywords = "closure; complexity; computational complexity; graph theory; linear network; linear time parallel algorithm; neighbouring communications; parallel algorithms; transitive", treatment = "T Theoretical or Mathematical", } @Article{Parberry:1992:PSN, author = "I. Parberry", title = "The pairwise sorting network", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "205--211", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA", countrypub = "Singapore", keywords = "computational complexity; lexicographic order; odd-even sorting; pairwise sorting network; parallel algorithms; principle; sorting; zero-one", treatment = "T Theoretical or Mathematical", } @Article{Kutylowski:1992:PST, author = "M. Kutylowski and R. Wanka", title = "Periodic sorting on two-dimensional meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "213--220", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Heinz-Nixdorf-Inst., Univ.-GH Paderborn, Germany", countrypub = "Singapore", keywords = "2D processor mesh; computational complexity; parallel algorithms; periodic sorting; procedure; snake-like ordering; sorting; two-dimensional meshes", treatment = "T Theoretical or Mathematical", } @Article{Berthome:1992:EKH, author = "P. Berthome", title = "Efficient {K}-selection in hypercube multiprocessors", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "221--230", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Lab. de l'Inf. du Parallelisme, Ecole Normale Superieure, Lyon, France", countrypub = "Singapore", keywords = "algorithms; computational complexity; hypercube multiprocessors; hypercube networks; K-selection; parallel; recursive strategy", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Akl:1992:SOS, author = "S. G. Akl and I. Stojmenovic", title = "A simple optimal systolic algorithm for generating permutations", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "231--239", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "algorithms; combinatorial; combinatorial mathematics; computational complexity; constant delay per permutation; constant size memory; cost-optimal; generating permutations; linear array; parallel algorithm; parallel algorithms; permutation generation; processor array; systolic algorithm; systolic arrays", treatment = "T Theoretical or Mathematical", } @Article{Elhage:1992:SGC, author = "H. Elhage and I. Stojmenovic", title = "Systolic generation of combinations from arbitrary elements", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "241--248", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada", countrypub = "Singapore", keywords = "combinations generation; combinatorial mathematics; combinatorial objects generation; computational complexity; constant; constant delay per combination; cost-optimal; lexicographically ascending order; linear array; parallel algorithms; processor array; size memory; systolic algorithm; systolic arrays", treatment = "T Theoretical or Mathematical", } @Article{Bhagavathi:1992:CPP, author = "D. Bhagavathi and S. Olariu and J. L. Schwing and J. Zhang", title = "Convex polygon problems on meshes with multiple broadcasting", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "249--256", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "algorithms; column buses; computational complexity; computational geometry; computers; containment; convex n-gons; convex polygon problems; convexity; edge-intersect; intersection; lower bound; mesh connected; meshes with; multiple broadcasting; optimal algorithms; parallel; row buses; separability; time-; union", treatment = "T Theoretical or Mathematical", } @Article{Ali:1992:PPM, author = "A. T. Ali and E. L. Dagless", title = "A parallel processing model for real-time computer vision-aided road traffic monitoring", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "257--264", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5260B (Computer vision and picture processing); C7130 (Public administration)", corpsource = "Adv. Comput. Res. Centre, Bristol Univ., UK", countrypub = "Singapore", keywords = "computer vision; computerised monitoring; extraction; image data analysis; model; motorway; multi-lane carriageway; parallel; parallel processing; processing; real-time; real-time computer vision; real-time systems; road traffic; road traffic monitoring; roadway scenes; systems; traffic; traffic analysis; traffic data; transputer; transputer networks; transputer-based; video images", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wong:1992:MSP, author = "W. F. Wong and C. K. Yuen", title = "A model of speculative parallelism", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "265--272", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of Singapore, Singapore", countrypub = "Singapore", keywords = "BaLinda; control parallelism; Lisp; LISP; Lisp; parallel programming; simulation; speculative parallelism", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Barnett:1992:UPL, author = "M. Barnett and C. Lengauer", title = "Unimodularity and the parallelization of loops", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "273--281", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", corpsource = "Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA", countrypub = "Singapore", keywords = "loop parallelization; loop transformations; parallel algorithms; parallel programming; parallelizing compiler; program compilers; space-time; systolic arrays; transformation; unimodularity", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bouabdallah:1992:IMM, author = "A. Bouabdallah and J.-C. Konig", title = "An improvement of {Maekawa}'s mutual exclusion algorithm to make it fault-tolerant", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "283--290", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150N (Distributed systems)", corpsource = "CNRS, Univ. de Paris-Sud, Orsay, France", countrypub = "Singapore", keywords = "communication complexity; distributed algorithms; distributed systems; fault-tolerant; mutual exclusion; node failures; recovery procedure; shared resource", treatment = "T Theoretical or Mathematical", } @Article{Doroshenko:1992:AAD, author = "A. E. Doroshenko", title = "On asynchronous avoidance of deadlocks in parallel programs", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "2-3", pages = "291--297", month = sep, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150N (Distributed systems)", corpsource = "V. M. Glushkov Cybernet. Inst., Acad. of Sci., Kiev, Ukraine", countrypub = "Singapore", keywords = "asynchronous communication; asynchronous data; buffering; communicating sequential; concurrency control; CPS; data dependence analysis; deadlock avoidance; exchanges; multimodule programs; parallel programming; parallel programs; programs", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Galbiati:1992:CEP, author = "G. Galbiati and F. Maffioli", title = "Constructing an exact parity base is in {RCN\slash} sup 2", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "301--309", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dipartimento di Inf. e Sistemistica, Pavia Univ., Italy", countrypub = "Singapore", keywords = "0-1 weighted; bounded fan-in circuits; combinatorial mathematics; combinatorial problems; computational complexity; existence; matroid; parallel algorithms; parallel complexity; parity base; perfect matching; polynomial size; preassigned weight; quadratic logarithmic depth; RNC/sup 2/", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Carlsson:1992:PCH, author = "S. Carlsson and J. Chen", title = "Parallel constructions of heaps and min-max heaps", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "311--320", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1140C (Queueing theory); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Lulea Univ. of Technol., Sweden", countrypub = "Singapore", keywords = "comparison tree model; heaps; min-max heaps; parallel; parallel algorithms; parallel constructions; priority; priority deques; queueing theory; queues; tree data structures", treatment = "P Practical", } @Article{Albacea:1992:CLE, author = "E. A. Albacea", title = "Computation list evaluation and its applications", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "321--329", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia", countrypub = "Singapore", keywords = "algorithm; computation list evaluation; Euler; list ranking; parallel algorithms; problem instances; three contraction; Tour technique; tree data structures", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bossomaier:1992:DPC, author = "T. Bossomaier and N. Isidoro and A. Loeff", title = "Data parallel computation of {Euclidean} distance transforms", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "331--339", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry); C6120 (File organisation)", corpsource = "Res. Sch. of Phys. Sci. and Eng., Australian Nat. Univ., Canberra, ACT, Australia", countrypub = "Singapore", keywords = "algorithms; computational geometry; data parallel computation; data sets; data structures; Euclidean distance transforms; graphics; image processing; maximum error; parallel; parallel algorithms; parallel computers; pattern; recognition; SIMD machines", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chlebus:1992:TSA, author = "B. Chlebus", title = "Two selection algorithms on a mesh-connected computer", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "341--346", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Instytut Informatyki, Warszawski Univ., Warszawa, Poland", countrypub = "Singapore", keywords = "complexity bound; computational complexity; deterministic selection algorithms; mesh-connected computer; model of computation; parallel; parallel algorithms; processing; processor array", treatment = "P Practical", } @Article{Duato:1992:CCN, author = "J. Duato", title = "Channel classes: a new concept for deadlock avoidance in wormhole networks", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "347--354", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6150P (Network design and planning); C4230M (Multiprocessor interconnection); C5620 (Computer networks and techniques); C6150J (Operating systems)", corpsource = "Fac. de Inf., Univ. Politecnica de Valencia, Spain", countrypub = "Singapore", keywords = "adaptive algorithm; channel classes; concurrency control; cyclic dependencies; deadlock avoidance; deadlock-free adaptive routing algorithms; equivalence relation; forward; interconnection networks; message passing; multiprocessor; order; partial; store-and-; verification; wormhole networks", treatment = "P Practical", } @Article{Pelc:1992:BTS, author = "A. Pelc", title = "Broadcasting time in sparse networks with faulty transmissions", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "355--361", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6210 (Telecommunication applications); C5620 (Computer networks and techniques); C5670 (Network performance)", corpsource = "Dept. d'Inf., Univ. Quebec a Hull, Que., Canada", countrypub = "Singapore", keywords = "bounded number of failures; broadcasting time; communication network; computer networks; fault tolerant computing; fault-tolerant broadcasting; faulty transmissions; independent failures; random; sparse networks; telecommunication networks", treatment = "P Practical", } @Article{Bampis:1992:LOS, author = "E. Bampis and J.-C. Konig and D. Trystram", title = "A low overhead schedule for a {3D-grid} graph", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "363--372", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150J (Operating systems)", corpsource = "LRI, Univ. de Paris Sud, Orsay, France", countrypub = "Singapore", keywords = "3D-grid graph; communication; low overhead schedule; lower bound; overhead; parallel algorithms; scheduling", treatment = "P Practical", } @Article{Lenders:1992:MAA, author = "P. M. Lenders", title = "Multi-rate arrays and affine recurrence equations", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "373--380", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Math. Sci. and Comput. Sci., New England Univ., Armidale, NSW, Australia", countrypub = "Singapore", keywords = "affine recurrence equations; dependency matrix; domain; identity matrix; multirate arrays; null space; parallel algorithms; problem; systolic arrays", treatment = "P Practical", } @Article{DeFalco:1992:SGA, author = "I. {De Falco} and R. {Del Balio} and E. Tarantino and R. Vaccaro", title = "Simulation of genetic algorithms on {MIMD} multicomputers", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "381--389", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C1290 (Applications of systems theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Istit. per la Ricerca sui Sistemi Inf. Paralleli, IRSIP-CNR, Naples, Italy", countrypub = "Singapore", keywords = "fully connected chordal ring topology; genetic algorithm; genetic algorithms; genetic algorithms simulation; MIMD multicomputers; operations research; parallel; parallel algorithms; parallel diffusion processors; PMX crossover; travelling salesman problem", treatment = "P Practical", } @Article{Johnson:1992:PBM, author = "T. Johnson and T. A. Davis", title = "Parallel buddy memory management", journal = j-PARALLEL-PROCESS-LETT, volume = "2", number = "4", pages = "391--398", month = dec, year = "1992", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ., Gainesville, FL, USA", countrypub = "Singapore", keywords = "algorithm; allocators; data structures; dynamic storage; parallel algorithms; parallel buddy memory management; parallel programs; parallel sparse matrix; storage management", treatment = "P Practical", } @Article{Sieling:1993:NOB, author = "D. Sieling and I. Wegener", title = "{NC-algorithms} for operations on binary decision diagrams", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "3--12", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230B (Combinatorial switching theory); C4240P (Parallel programming and algorithm theory)", corpsource = "FB Inf., Dortmund Univ., Germany", countrypub = "Singapore", keywords = "binary decision diagrams; Boolean functions; CAD; CAD tools; circuit switching; CRCW COMMON PRAMs; decidability; logarithmic run time; logical synthesis; minimization; NC-algorithms; parallel algorithms; redundancy test; satisfiability; test pattern generation; verification", treatment = "T Theoretical or Mathematical", } @Article{Hsu:1993:MPS, author = "Lih-Hsing Hsu", title = "Matching polynomials of series-parallel graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "13--18", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Inf. and Comput. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan", countrypub = "Singapore", keywords = "(mathematics); complexity; computational complexity; computational geometry; computer; cost-optimal parallel algorithm; EREW PRAM; graph; matching polynomials; parallel algorithms; polynomials; series-parallel graphs; theory; time; tree contraction; trees", treatment = "T Theoretical or Mathematical", } @Article{Bar-Noy:1993:OAC, author = "A. Bar-Noy and S. Kipnis and B. Schieber", title = "An optimal algorithm for computing census functions in message-passing systems", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "19--23", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C6150N (Distributed systems)", corpsource = "T. J. Watson Res. Center, IBM Res. Div., Yorktown Heights, NY, USA", countrypub = "Singapore", keywords = "census computation; census functions; communication rounds; commutative census function; distributed memory systems; distributed-memory; message passing; message-passing; multiprocessing; optimal algorithm; parallel algorithms; parallel computer; parallel computers; programs; systems", treatment = "T Theoretical or Mathematical", } @Article{Tromp:1993:US, author = "J. Tromp", title = "On update-last schemes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "25--28", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6120 (File organisation)", corpsource = "CWI, Amsterdam, Netherlands", countrypub = "Singapore", keywords = "combinatorial; data management; distributed systems; file organisation; index; parallel programming; problems; space complexity; storage management; update-last schemes", treatment = "T Theoretical or Mathematical", } @Article{Charles:1993:SSS, author = "H.-P. Charles and P. Fraigniaud", title = "Scheduling a scattering-gathering sequence on hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "29--42", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5440 (Multiprocessor systems and techniques); C6150N (Distributed systems)", corpsource = "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", keywords = "broadcasting problems; computers; distinct address; distributed memory parallel; distributed memory systems; gossiping; hypercube networks; hypercubes; pipeline; pipelining; processing; scattering problem; scattering-gathering sequence; scheduling", treatment = "T Theoretical or Mathematical", } @Article{Glasa:1993:BSA, author = "J. Glasa", title = "Bit-level systolic arrays for digital contour smoothing by {Abel-Poisson} kernel", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "43--51", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B1265B (Logic circuits); B1265F (Microprocessors and microcomputers); B2570 (Semiconductor integrated circuits); B6140C (Optical information and image processing); C1250 (Pattern recognition); C1260 (Information theory); C5120 (Logic and switching circuits); C5135 (Digital signal processing chips); C5220P (Parallel architecture); C5260B (Computer vision and picture processing)", corpsource = "Inst. of Control Theory and Robotics, Slovak Acad. of Sci., Bratislava, Czechoslovakia", countrypub = "Singapore", keywords = "Abel-; algebra; bit-level systolic arrays; circulant Toeplitz matrices; clock frequency; digital contour smoothing; digital signal processing chips; execution time; functional elements; high; image; image processing; matrix; Poisson kernel; processing; real-time applications; real-time systems; systolic arrays; VLSI", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ali:1993:TCS, author = "H. H. Ali and H. El-Rewini", title = "The time complexity of scheduling interval orders with communication is polynomial", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "53--58", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150N (Distributed systems)", corpsource = "Dept. of Math. and Comput. Sci., Nebraska Univ., Omaha, NE, USA", countrypub = "Singapore", keywords = "algorithms; communication; computational complexity; cost; interval orders; multiprocessing programs; NP-complete; objective function; parallel; parallel programming; parallel programs; polynomial time; polynomial time algorithms; scheduling; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Lin:1993:SEM, author = "R. Lin and S. Olariu and J. L. Schwing and J. Zhang", title = "Simulating enhanced meshes, with applications", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "59--70", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Geneseo, NY, USA", countrypub = "Singapore", keywords = "access storage; Common-CRCW; computational complexity; CREW-; enhanced meshes simulation; function; inverse Ackermann; multiple broadcasting; nontrivial lower bounds; parallel architectures; PRAM; random-; reconfigurable architectures; reconfigurable mesh", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Fragopoulou:1993:ESN, author = "P. Fragopoulou", title = "On the efficient summation of {N} numbers on an {N}-processor reconfigurable mesh", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "71--78", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "architectures; dimensional processor array; N-processor reconfigurable mesh; parallel algorithm; parallel algorithms; parallel architectures; reconfigurable; summation of N numbers; two-", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Olariu:1993:SAL, author = "S. Olariu and W. Shen and L. Wilson", title = "Sub-logarithmic algorithms for the largest empty rectangle problem", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "79--85", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "algorithms; all nearest smaller values problem; Common-CRCW-PRAM model; computational complexity; computational geometry; largest empty rectangle problem; parallel; parallel algorithms; sub-logarithmic algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gastin:1993:ECS, author = "P. Gastin and V. Villain", title = "An efficient crash-tolerant sequential traversal", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "87--97", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5470 (Performance evaluation and testing); C5620 (Computer networks and techniques); C5670 (Network performance)", corpsource = "Inst. Blaise Pascal, Paris VI Univ., France", countrypub = "Singapore", keywords = "agreement; crash-tolerant sequential traversal; distributed processing; distributed systems; fault tolerant computing; identification; termination detection", treatment = "P Practical", } @Article{Virbitskaite:1993:SCN, author = "I. B. Virbitskaite", title = "Some characteristics of nondeterministic processes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "99--106", month = mar, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4200 (Computer theory)", corpsource = "Inst. of Inf. Syst., Russian Acad. of Sci., Novosibirsk, Russia", countrypub = "Singapore", keywords = "computation theory; crossing; density; discreteness; event structures; graph theory; nondeterministic processes; representations; semantic representations; syntactic", treatment = "T Theoretical or Mathematical", } @Article{Cosnard:1993:EN, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "1", pages = "??--??", month = mar, year = "1993", bibdate = "Mon Nov 09 06:52:25 1998", URL = "http://www.ens-lyon.fr/PPL/vol3_1.html", acknowledgement = ack-nhfb, } @Article{Krizanc:1993:CMS, author = "D. Krizanc and S. Rajasekaran and S. S. Shende", title = "A comparison of meshes with static buses and half-duplex wrap-arounds", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "109--114", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA", countrypub = "Singapore", keywords = "computational powers; half-duplex wrap-arounds; meshes; multiprocessor interconnection networks; packet switching; permutation routing problem; randomized sorting; sorting; static buses; torus", treatment = "P Practical", } @Article{Barth:1993:EMD, author = "D. Barth", title = "Embedding meshes of $d$-ary trees into {de Bruijn} graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "115--127", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "Bordeaux I Univ., Talence, France", countrypub = "Singapore", keywords = "(mathematics); architectures; congestion; constant dilation; de Bruijn graphs; embedding; hypercube networks; meshes of d-ary trees; optimal expansion; parallel; parallel architectures; trees", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Cheung:1993:TLB, author = "S. Cheung and F. C. M. Lau", title = "Time lower bounds for permutation routing on multi-dimensional bused meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "129--138", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci., California Univ., Davis, CA, USA", countrypub = "Singapore", keywords = "bused meshes; multi-dimensional; parallel algorithms; parallel architectures; permutation routing; time lower bounds", treatment = "P Practical", } @Article{Looges:1993:PPC, author = "P. J. Looges and S. Olariu", title = "A practical platform for {CREW} emulation", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "139--145", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6185 (Simulation techniques)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", countrypub = "Singapore", keywords = "algorithm; architectures; broadcast delay; concurrent read exclusive write PRAM; CREW emulation; crossbar connected machine; digital simulation; model; parallel; parallel algorithms; parallel random access machine; simulation", treatment = "P Practical", } @Article{Schmeck:1993:PHT, author = "H. Schmeck and H. Schroder and J. Staunstrup and M. Middendorf", title = "Problem heaps and their evaluation", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "147--155", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C6120 (File organisation)", corpsource = "Inst. fur Angewandte Inf. and Formale Beschreibungsverf., Karlsruhe Univ., Germany", countrypub = "Singapore", keywords = "abstract model; algorithms; asynchronous communication; computational complexity; hardware complexity; lower bounds; multiprocessing systems; multiprocessor; parallel; problem heaps; systems; tree data structures", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Thangavel:1993:PAG, author = "P. Thangavel and V. P. Muthuswamy", title = "A parallel algorithm to generate {N}-ary reflected {Gray} codes in a linear array with reconfigurable bus system", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "157--164", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220 (Computer architecture); C6130 (Data handling techniques)", corpsource = "Dept. of Math., Bharathidasan Univ., Tiruchirapalli, India", countrypub = "Singapore", keywords = "array; codes; linear; N-ary reflected gray codes; parallel algorithm; parallel algorithms; reconfigurable architectures; reconfigurable bus system", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chandrasekharan:1993:EPA, author = "N. Chandrasekharan and V. S. Lakshmanan and M. Medidi", title = "Efficient parallel algorithms for finding chordless cycles in graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "165--170", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Math. Sci., Loyola Univ., Chicago, IL, USA", countrypub = "Singapore", keywords = "chordless cycles; graph theory; graphs; parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Pradeep:1993:CTA, author = "B. Pradeep and C. {Siva Ram Murthy}", title = "A constant time algorithm for redundancy elimination in task graphs on processor arrays with reconfigurable bus systems", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "171--177", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Madras, India", countrypub = "Singapore", keywords = "algorithm parallelization; constant time algorithm; graphs; parallel algorithm; parallel algorithms; precedence graph formalism; processor arrays; reconfigurable architectures; reconfigurable bus systems; redundancy elimination; task", treatment = "P Practical", } @Article{Plata:1993:EPA, author = "O. Plata and T. F. Pena and F. F. Rivera and E. L. Zapata", title = "An efficient processor allocation for nested parallel loops on distributed memory hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "179--187", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. Electron. y Computacion, Santiago de Compostela Univ., Spain", countrypub = "Singapore", keywords = "communication; data distribution; distributed memory hypercubes; distributed memory systems; HYPAL; hypercube networks; hypercube partitioning algorithm; message; message-passing hypercubes; nested parallel loops; overhead; passing; processor allocation problem; program compilers; scheduling; static", treatment = "P Practical", } @Article{Chung:1993:NPP, author = "Kuo-Liang Chung and Hsun-Wen Chang", title = "Novel pipelining and processor allocation strategy for monoid computations on unshuffle-exchange networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "189--193", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Inf. Manage., Nat. Taiwan Univ., Taipei, Taiwan", countrypub = "Singapore", keywords = "hypercube network; monoid computations; multiple output nodes; parallel algorithms; parallel architectures; pipelining; processor; processor allocation strategy; scheduling; unshuffle-exchange networks; utilization", treatment = "P Practical", } @Article{Das:1993:DFD, author = "A. Das and K. Thulasiraman and K. B. Lakshmanan and V. K. Agarwal", title = "Distributed fault diagnosis of a ring of processors", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "2", pages = "195--204", month = jun, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing)", corpsource = "Dept. d'Inf. et de Recherche Oper., Montreal Univ., Que., Canada", countrypub = "Singapore", keywords = "bidirectional rings; distributed fault diagnosis; fault tolerant computing; faulty processors; level diagnosis; multiprocessing systems; ring of processors; system; unidirectional rings", treatment = "P Practical", } @Article{Greenlaw:1993:BSP, author = "R. Greenlaw", title = "Breadth-depth search is {P}-complete", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "209--222", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA", countrypub = "Singapore", keywords = "branch-and-bound strategies; breadth-depth search; breadth-first search; complexity; computational complexity; decision problem; depth-first search; fixed ordered adjacency; lists; P-complete; parallel algorithms; parallel complexity; problems; search; search strategy; sequential; vertex numbers", treatment = "T Theoretical or Mathematical", } @Article{Caceres:1993:FET, author = "E. N. Caceres and N. Deo and S. Sastry and J. L. Szwarcfiter", title = "On finding {Euler Tours} in parallel", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "223--231", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA", countrypub = "Singapore", keywords = "CREW PRAM; Euler Tours; graph; graph theory; parallel algorithm; parallel algorithms; stitching; strut; vertices", treatment = "T Theoretical or Mathematical", } @Article{Raman:1993:UAP, author = "A. Raman and C. {Pandu Rangan}", title = "A unified approach to parallel algorithms for the domatic partition problem on special classes of perfect graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "233--241", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., IIT, Madras, India", countrypub = "Singapore", keywords = "block graphs; domatic partition problem; dominating set; graph theory; graphs; interval graphs; K-trees; parallel algorithms; perfect; set of vertices; vertex set", treatment = "T Theoretical or Mathematical", } @Article{Kulkarni:1993:PPA, author = "R. Kulkarni and S. Date and B. Kulkarni and U. Kulkarni and A. S. Kolaskar", title = "{PRAS}: parallel alignment of sequences algorithm", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "243--252", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "A8710 (General, theoretical, and mathematical biophysics); C1290L (Biology and medicine); C4240P (Parallel programming and algorithm theory); C7330 (Biology and medicine)", corpsource = "Centre for Dev. of Adv. Comput., Pune Univ., India", countrypub = "Singapore", keywords = "algorithm; algorithms; dynamic programming; loosely-coupled MIMD; molecular biology; molecular biophysics; multiple alignment of sequences; nucleic acids; parallel; parallel alignment; PRAS; proteins; series (mathematics); strings; transputer; transputer-based multiprocessor", treatment = "T Theoretical or Mathematical", } @Article{Fon-Der-Flaass:1993:CIG, author = "D. Fon-Der-Flaass and I. Rival", title = "Collecting information in graded ordered sets", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "253--260", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection)", corpsource = "Inst. of Math., Acad. of Sci., Novosibirsk, Russia", countrypub = "Singapore", keywords = "finite ordered set; graded ordered sets; immediate; immediate predecessors; information transmission; multiprocessing systems; precedence constraints; predecessors; set theory; successors", treatment = "T Theoretical or Mathematical", } @Article{Schwabe:1993:OVD, author = "E. J. Schwabe", title = "Optimality of a {VLSI} decomposition scheme for the {deBruijn} graph", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "261--265", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); B1110 (Network topology); B1130 (General analysis and synthesis methods)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern Univ., Evanston, IL, USA", countrypub = "Singapore", keywords = "building blocks; circuit layout; connections; deBruijn graph; graph edges; graphs; individual chips; inter-chip; optimisation; structured subgraphs; VLSI; VLSI decomposition", treatment = "T Theoretical or Mathematical", } @Article{Xirouchakis:1993:DPV, author = "P. C. Xirouchakis and P. Y. Wang and O. Frieder", title = "Data parallel visual reconstruction and partitioning algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "267--277", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5260B (Computer vision and picture processing)", corpsource = "JJMA Inc., Virginia, VA, USA", countrypub = "Singapore", keywords = "algorithmic complexities; data; data parallel algorithms; discontinuities; Distributed Array Processor; finite element algorithms; image; image reconstruction; interacting step; parallel; parallel algorithms; partitioning algorithm; processing; V-RAM; visual reconstruction", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wang:1993:POR, author = "P. S. P. Wang", title = "Parallel object representation and recognition", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "279--290", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5260B (Computer vision and picture processing)", corpsource = "Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA", countrypub = "Singapore", keywords = "3-dimensional; computer vision; coordinated graph; image analysis problems; image processing; image recognition; layered graph; object recognition; object representation; parallel algorithms; parallel matching; parallel method; parallel parsing; representation", treatment = "T Theoretical or Mathematical", } @Article{Higham:1993:PMA, author = "L. Higham and E. Schenk", title = "{PRAM} memory allocation and initialization", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "291--299", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Calgary Univ., Alta., Canada", countrypub = "Singapore", keywords = "algorithms; CREW PRAM; EREW PRAM; managing memory; memory allocation; memory initialization; memory management; parallel; parallel algorithms; parallel machines; parallel random access machine; PRAM; storage management", treatment = "T Theoretical or Mathematical", } @Article{Fragopoulou:1993:CPC, author = "P. Fragopoulou", title = "On the comparative powers of the {2D-PARBS} and the {CRCW-PRAM} models", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "3", pages = "301--304", month = sep, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", keywords = "2D-PARBS; comparative powers; complexity; computational needs; CRCW-PRAM; evaluation; global shared memory; parallel algorithms; parallel computation; parallel processing; parallel random access machine; PARITY problem; performance; reconfigurable bus; system", treatment = "T Theoretical or Mathematical", } @Article{Mackenzie:1993:LBO, author = "P. D. Mackenzie", title = "A lower bound for order-preserving broadcast in the postal model", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "313--320", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C6150N (Distributed systems)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", countrypub = "Singapore", keywords = "broadcasting; communication complexity; communication network; distributed memory systems; lower bound; message passing; message passing systems; multiple messages; order-preserving broadcast; order-preserving fashion; parallel algorithms; postal model", treatment = "T Theoretical or Mathematical", } @Article{Duato:1993:DDA, author = "J. Duato", title = "On the design of deadlock-free adaptive multicast routing algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "321--333", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Fac. de Inf., Univ. Politecnica de Valencia, Spain", countrypub = "Singapore", keywords = "2D-mesh; concurrency control; cyclic; deadlock-free adaptive multicast routing algorithms; dependencies; hypercube networks; hypercube topologies; multicast communication; sufficient conditions; system recovery; wormhole networks", treatment = "P Practical", } @Article{Bruck:1993:EGC, author = "J. Bruck and Ching-Tien Ho", title = "Efficient global combine operations in multi-port message-passing systems", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "335--346", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C6150N (Distributed systems)", corpsource = "Res. Div., IBM Almaden Res. Center, San Jose, CA, USA", countrypub = "Singapore", keywords = "associative reduction function; global combine operations; message passing; multiport message-passing; parallel processing; systems", treatment = "P Practical", } @Article{Liestman:1993:PG, author = "A. L. Liestman and D. Richards", title = "Perpetual gossiping", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "347--355", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6210L (Computer communications); C5620 (Computer networks and techniques); C7220 (Generation, dissemination, and use of information)", corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada", countrypub = "Singapore", keywords = "computer networks; gossiping; information dissemination; information dissemination problem", treatment = "P Practical", } @Article{Fujita:1993:OGM, author = "S. Fujita and M. Yamashita", title = "Optimal gossiping in mesh-bus computers", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "357--361", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "Dept. of Electr. Eng., Hiroshima Univ., Japan", countrypub = "Singapore", keywords = "mesh-bus computers; optimal algorithm; optimal gossiping; parallel processing", treatment = "P Practical", } @Article{Daniel:1993:SPM, author = "F. Daniel and G. Authie", title = "Shortest paths multiplicity in generalized {de Bruijn} and {Kautz} networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "363--374", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Lab. d'Automatique et d'Analyse des Syst., Toulouse, France", countrypub = "Singapore", keywords = "communication issues; generalized de Bruijn networks; hypercube networks; Kautz networks; residue calculation; shortest paths multiplicity; vertex-couples", treatment = "T Theoretical or Mathematical", } @Article{Rowley:1993:NAH, author = "R. Rowley and B. Bose", title = "On the number of arc-disjoint {Hamiltonian} circuits in the {de Bruijn} graph", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "375--380", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA", countrypub = "Singapore", keywords = "arc-disjoint Hamiltonian circuits; constructive proof; d-ary De Bruijn graph; Hamiltonian circuits; hypercube networks", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Farley:1993:SN, author = "A. M. Farley and A. Proskurowski", title = "Self-repairing networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "381--391", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6210 (Telecommunication applications); C5670 (Network performance)", corpsource = "Oregon Univ., Eugene, OR, USA", countrypub = "Singapore", keywords = "algorithmic; associated routing tables; communication; delay; determination; fault tolerant computing; information dissemination; message transfer; networks; self-repairing graphs; self-repairing networks; specification; telecommunication networks", treatment = "P Practical", } @Article{Auletta:1993:FTR, author = "V. Auletta and A. A. Rescigno and V. Scarano", title = "Fault tolerant routing in the {Supercube}", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "393--405", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5670 (Network performance)", corpsource = "Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy", countrypub = "Singapore", keywords = "connectivity; fault tolerant computing; fault tolerant routing; hypercube; hypercube networks; interconnection network; route graph; Supercube", treatment = "P Practical", } @Article{Subramonian:1993:EMB, author = "R. Subramonian and N. Venkatasubramanyan", title = "Efficient multiple-item broadcast in the {logP} model", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "407--417", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", countrypub = "Singapore", keywords = "logP model; multiple-item broadcast; multiprocessing systems; multiprocessors; optimal solution; parallel algorithms; performance degradation; point-to-point message transmission", treatment = "P Practical", } @Article{Malard:1993:DRD, author = "J. Malard and C. C. Paige", title = "Data replication in dense matrix factorization", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "419--430", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C5670 (Network performance)", corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", countrypub = "Singapore", keywords = "communication primitive; data replication; dense matrix factorization; gossiping; hypercube; hypercube networks; LU factorization algorithms; message passing; message passing multicomputer; numerical software libraries; performance evaluation; performance gains", treatment = "P Practical", } @Article{Pellegrini:1993:BBD, author = "F. Pellegrini", title = "Bounds for the bandwidth of the $d$-ary {de Bruijn} graph", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "431--443", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "CNRS, Bordeaux I Univ., Talence, France", countrypub = "Singapore", keywords = "binary hypercube; binary values; bisection; continuous domain; d-ary de Bruijn graph; equivalent proof; extended; graph theory; Hamming codes; Hamming weight; Hamming weights; hypercube networks; hypercube vertices; Laplace; non-binary case; numbering system; theorem; unoriented de Bruijn graph; vertex-", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Fiol:1993:UAD, author = "M. A. Fiol and J. Fabrega and O. Serra and J. L. A. Yebra", title = "A unified approach to the design and control of dynamic memory networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "445--456", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C6120 (File organisation)", corpsource = "Dept. de Matematica Aplicada i Telematica, Univ. Politecnica de Catalunya, Barcelona, Spain", countrypub = "Singapore", keywords = "access time; cyclic shift registers; dynamic memory networks; fast; interconnection network; interconnection schemes; interconnection topologies; memory control; memory organizations; multiprocessor interconnection networks; sequential access; shift registers; small access times; storage management; storage medium; unified approach", treatment = "P Practical", } @Article{Cai:1993:DBS, author = "Leizhen Cai and J. M. Keil", title = "Degree-bounded spanners", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "457--468", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada", countrypub = "Singapore", keywords = "communication networks; complexity; computation; computational complexity; degree-bounded spanners; distributed systems; graph theory; NP-complete; parallel; spanning subgraph; t-spanner", treatment = "T Theoretical or Mathematical", } @Article{Arruabarrena:1993:PEA, author = "A. Arruabarrena and R. Beivide and C. Izu and J. Miguel", title = "A performance evaluation of adaptive routing in bidimensional cut-through networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "469--484", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Konputagailuen Arkitektura eta Teknologia Saila, Euskal Herriko Univ., Donostia, Spain", countrypub = "Singapore", keywords = "adaptive routing; average; avoidance; bidimensional cut-; communication network; concurrency control; deadlock; evaluation; massively parallel; maximum sustained throughput; mesh; message flow control; message latency; network topology; parallel architectures; performance; performance evaluation; processor; telecommunication network routing; through networks; torus", treatment = "P Practical", } @Article{Jesshope:1993:LRV, author = "C. Jesshope", title = "Latency reduction in {VLSI} routers", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "485--494", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Electron. and Electr. Eng., Surrey Univ., Guildford, UK", countrypub = "Singapore", keywords = "computers; fault tolerant computing; latency reduction; MPI router chip; parallel; parallel architectures; performance evaluation; scalable performance; VLSI; VLSI routers", treatment = "P Practical", } @Article{Fiorini:1993:XOP, author = "P. Fiorini", title = "The {XOmega} and the {Omega} pyramids, a new family of competitive interconnection networks", journal = j-PARALLEL-PROCESS-LETT, volume = "3", number = "4", pages = "495--506", month = dec, year = "1993", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", corpsource = "Lab. Syst. de Perception, Centre de Recherches et d'Etudes d'Arcueil, France", countrypub = "Singapore", keywords = "distributed memory systems; interconnection networks; massively; multiprocessor interconnection; networks; Omega pyramids; parallel computers; XOmega", treatment = "P Practical", } @Article{Clausen:1994:DIS, author = "Jens Clausen and Jesper Larsson Traeff", title = "Do inherently sequential branch-and-bound algorithms exist?", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "3--13", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Copenhagen", affiliationaddress = "Copenhagen, Den", classification = "721.1; 921.4; 921.5; C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Copenhagen Univ., Denmark", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; Algorithms; Branch-and-Bound paradigm; Computational complexity; Graph partitioning problem; Graph Partitioning Problem; Graph theory; implementation; Inherently sequential branch and bound algorithm; NP-hard optimization; optimisation; Optimization; parallel; parallel algorithms; search problems", treatment = "T Theoretical or Mathematical", } @Article{Das:1994:SDR, author = "Sajal K. Das and Ranette H. Halverson", title = "Simple deterministic and randomized algorithms for linked list ranking on the {EREW} {PRAM} model", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "15--27", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of North Texas", affiliationaddress = "Denton, TX, USA", classification = "721.1; 722.4; 723.1; 921.5; 921.6; 922.1; C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; algorithms; APRAM; asynchronous CRCW PRAM; Computational complexity; computational complexity; deterministic algorithm; EREW Parallel Random Access Machines (PRAM) model; EREW PRAM model; Exclusive Read Exclusive Write (EREW) PRAM; linked list; Linked list ranking; list processing; list ranking algorithms; Mathematical models; Optimization; parallel; Parallel algorithm; Parallel processing systems; Program processors; Random access storage; Random processes; Randomized algorithm; randomized algorithms; ranking; space complexity; Space requirements; Storage allocation (computer); Time complexity; time complexity; Work optimality", treatment = "T Theoretical or Mathematical", xxtitle = "Simple deterministic randomized algorithms for linked list ranking on the {EREW} {PRAM} model", } @Article{Yang:1994:PEC, author = "S. B. Yang and S. K. Dhall and S. Lakshmivarahan", title = "A processor efficient connectivity algorithm on random graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "29--36", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Oklahoma", affiliationaddress = "Norman, OK, USA", classification = "722.1; 722.4; 723.1; 921.4; 921.6; 922.1; C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Oklahoma Univ., Norman, OK, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Computational complexity; computational complexity; Connected components; Connectivity algorithm; connectivity algorithm; EREW Parallel Random Access Machines (PRAM) model; EREW PRAM; EREW PRAM model; Exclusive Read Exclusive Write (EREW) PRAM; Graph theory; graph theory; Mathematical models; parallel algorithm; parallel algorithms; Parallel processing systems; Probability; processor efficient; Program processors; Random access storage; random graphs; Random input graph; random input graph; Random processes; Randomized parallel algorithm; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Levcopoulos:1994:WTP, author = "Christos Levcopoulos and Teresa M. Przytycka", title = "A work-time trade-off in parallel computation of {Huffman} trees and concave least weight subsequence problem", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "37--43", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Lund Univ", affiliationaddress = "Lund, Sweden", classification = "721.1; 722.4; 723.1; 723.2; 921.4; 921.6; C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "(mathematics); Algorithms; CLWS; Codes (symbols); complexity; Computational complexity; computational complexity; concave least weight; Concave Least Weight Subsequence (CLWS) problem; Concave Least Weight Subsequences (CLWS); Huffman trees; Hufmann Tree problem; Mathematical programming; parallel algorithm; Parallel algorithms; parallel algorithms; parallel computation; Parallel processing systems; Prefix codes; Program processors; subsequence; trees; Trees (mathematics); Work time trade off; work-time trade-off", treatment = "T Theoretical or Mathematical", } @Article{Pan:1994:MEC, author = "Yi Pan", title = "A more efficient constant time algorithm for computing the {Hough} transform", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "45--52", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Dayton", affiliationaddress = "Dayton, OH, USA", classification = "721.1; 722.4; 723.1; 921.3; 921.6; C1130 (Integral transforms); C4240P (Parallel programming and algorithm theory)", corpsource = "Comput. Sci. Dept., Dayton Univ., OH, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; algorithms; Computational complexity; computational complexity; Computational methods; Constant time algorithm; constant time algorithm; Hough transform; Hough transforms; Line detection; line detection; Mathematical models; Mathematical transformations; mesh; Minimization of switching nets; parallel; Parallel algorithms; parallel algorithms; Parallel processing systems; Program processors; reconfigurable; Reconfigurable mesh; Response time (computer systems); Time complexity; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Milovanovic:1994:STL, author = "E. I. Milovanovic and M. D. Mihajlovic and I. Z. Milovanovic and M. K. Stojcev", title = "Solving tridiagonal linear systems on {MIMD} computers", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "53--64", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Nis", affiliationaddress = "Nis, Yugosl", classification = "721.1; 722.4; 723.1; 921.1; 921.2; 921.6; B0290H (Linear algebra); C4140 (Linear algebra); C4240P (Parallel programming and algorithm theory)", corpsource = "Fac. of Electron. Eng., Nis Univ., Serbia", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; arrays; Computational complexity; Computational methods; Difference equations; Differential equations; elimination; equations; linear; Matrix algebra; matrix algebra; MIMD computers; Multiple input multiple data computers; Multiprocessing systems; multiprocessor systems; orthogonal arrays; Parallel algorithm; Parallel algorithms; parallel algorithms; Parallel processing systems; Partitioning method; Polynomials; Program processors; Tridiagonal linear systems; tridiagonal linear systems", treatment = "T Theoretical or Mathematical", } @Article{Tsai:1994:SSA, author = "Ming-Shin Tsai and Shing-Tsaan Huang", title = "A self-stabilizing algorithm for the shortest paths problem with a fully distributed demon", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "65--72", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Natl Tsing Hua Univ", affiliationaddress = "HsinChu, Taiwan", classification = "722.4; 723.1; 731.4; 921.4; 921.6; C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6150N (Distributed systems)", corpsource = "Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Computational methods; Convergence of numerical methods; Critical path analysis; Distributed computer systems; distributed demon; distributed processing; distributed systems; Fully distributed demon; graph theory; Graph theory; Mathematical models; Nodes; parallel algorithms; Self stabilizing algorithm; self-stabilizing algorithm; Shortest path problems; shortest paths problem; Shortest paths problem; Synchronization; System stability", treatment = "T Theoretical or Mathematical", } @Article{Bhagavathi:1994:ULS, author = "D. Bhagavathi and S. Olariu and W. Shen and L. Wilson", title = "A unifying look at semigroup computations on meshes with multiple broadcasting", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "73--82", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Southern Illinois Univ", affiliationaddress = "Edwardsville, IL, USA", classification = "721.1; 722.4; 921.5; 921.6; C1110 (Algebra); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Southern Illinois Univ., Edwardsville, IL, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Associative processing; bound; Computation theory; computational complexity; Computational methods; group theory; lower; Lower bounds; meshes; Multiple broadcasting; multiple broadcasting; Optimization; Parallel algorithms; parallel algorithms; Parallel processing systems; Semigroup computations; semigroup computations; Time optimal algorithms; time-optimal algorithm", treatment = "T Theoretical or Mathematical", } @Article{Gewali:1994:CEW, author = "Laxmi P. Gewali and Ivan Stojmenovic", title = "Computing external watchman routes on {PRAM}, {BSR}, and interconnection network models of parallel computation", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "83--93", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Nevada", affiliationaddress = "Las Vegas, NV, USA", classification = "721.1; 722.1; 722.4; 723.1; 921.4; 921.5; 921.6; C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; Algorithms; algorithms; BSR; Computability and decidability; Computation theory; computational complexity; Computational geometry; computational geometry; Computational methods; Computer networks; constant time algorithm; convex polygon; Convex polygons; crew-pram computational model; Critical path analysis; Critical support lines; External watchman problem; external watchman routes; Geometry; hypercube; interconnection; Mathematical models; Minkowski sum; network; networks; Optimization; pancake networks; parallel; parallel computation; Parallel processing systems; Parallel Random Access Machines (PRAM); polygonal obstacle; PRAM; Random access storage; star; Visibility; Watchman route problem", treatment = "T Theoretical or Mathematical", } @Article{Barlos:1994:JWP, author = "Fotios Barlos and Ophir Frieder", title = "Join workload partitioning under uniform and skewed input relations", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "95--104", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Thinking Machines Corp", affiliationaddress = "Cambridge, MA, USA", classification = "721.1; 722.4; 723.2; 723.3; 921; 921.6; C4240P (Parallel programming and algorithm theory); C4250 (Database theory); C6160D (Relational DBMS)", corpsource = "Thinking Machines Corp., Cambridge, MA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Associative processing; Bucket boundaries; buckets; Computation theory; Computational complexity; Computational methods; data; Data processing; database theory; Distributed database systems; hypercube system; Join algorithms; Join workload partitioning; join workload partitioning; Join workload partitioning time; Multiprocessing systems; multiprocessor; parallel algorithms; Parallel databases; parallel databases; Parallel processing systems; relational databases; skew; skewed; Skewed data; State assignment; system; Time sharing systems; uniform partitioning; workload partitioning", treatment = "T Theoretical or Mathematical", } @Article{Alnuweiri:1994:FRN, author = "Hussein M. Alnuweiri", title = "A fast reconfigurable network for graph connectivity and transitive closure", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "105--115", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of British Columbia", affiliationaddress = "Vancouver, BC, Can", classification = "714.2; 721.2; 722.4; 723.1; 723.2; 921.1; 921.4; 921.6; C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; architectures; Boolean algebra; bus; closure; Codes (symbols); Computational methods; Computer architecture; Computer networks; Connected components labeling; Constant time algorithms; Constant weight codes; constant-time algorithms; constant-weight codes; Graph algorithms; graph algorithms; Graph connectivity; graph connectivity; Graph theory; graph theory; Labeling connected components; labeling connected components; logic arrays; Logic gates; logic nodes; Matrix algebra; network architecture; parallel; parallel algorithms; parallel processing; Parallel processing systems; Program processors; reconfigurable; reconfigurable network; Reconfigurable networks; Switching circuits; time complexity; transitive; Transitive closure; VLSI array; VLSI circuits", treatment = "T Theoretical or Mathematical", } @Article{Trahan:1994:PRA, author = "Jerry L. Trahan and Hosangadi Bhanukumar", title = "{Parallel Random Access Machines} without {Boolean} operations", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "117--124", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Louisiana State Univ", affiliationaddress = "Baton Rouge, LA, USA", classification = "721.1; 722.1; 722.4; 723.5; 921.1; 921.6; C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; algorithms; Boolean algebra; Boolean functions; Boolean operations; Computational complexity; computational complexity; Computational methods; computational models; Computer architecture; Computer simulation; Instruction set; instruction set; Mathematical models; Mathematical operators; multiplication; parallel; parallel complexity; Parallel complexity theory; Parallel processing systems; Parallel Random Access Machine; Parallel random access machines; Parallel Random Access Machines (PRAM); PRAM; Random access storage; Set theory; theory", treatment = "T Theoretical or Mathematical", } @Article{Duato:1994:TIE, author = "Jose Duato", title = "A theory to increase the effective redundancy in wormhole networks", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "125--138", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universidad Politecnica de Valencia", affiliationaddress = "Valencia, Spain", classification = "716.1; 721.1; 722.3; 722.4; 723.1; 921.6; C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Fac. de Inf., Univ. Politecnica de Valencia, Spain", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Adaptive routing; Adaptive systems; Algorithms; Communication channels (information theory); Computational methods; Computer networks; Computer system recovery; concurrency control; continuous operations; Data communication systems; Deadlock avoidance; deadlock freedom; effective redundancy; Error analysis; Fault tolerance; Fault tolerant computer systems; fault tolerant computing; fault-tolerant; fault-tolerant routing algorithm; interconnection network; Large scale systems; lower bound; message-passing mechanism; Multicomputers; Multiprocessing systems; multiprocessor interconnection networks; Program processors; Redundancy; redundancy; Reliability; System theory; systems; Wormhole networks; wormhole networks; Wormhole routing", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Xu:1994:OPL, author = "Cheng-Zhong Xu and Francis C. M. Lau", title = "Optimal parameters for load balancing with the diffusion method in mesh networks", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "139--147", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Shantou Univ", affiliationaddress = "Guandong Province, China", classification = "721.1; 722.1; 722.4; 731.3; 921.5; 921.6; C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Shantou Univ., Guangdong, China", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "ary n-cube; balanced state; Computational methods; Computer networks; Convergence of numerical methods; Diffusion method; diffusion method; distributed load balancing method; distributed memory; Distributed memory multiprocessors; distributed memory systems; k-; Load balancing; Mesh networks; mesh networks; Multicomputers; Multiprocessing systems; multiprocessor interconnection; multiprocessors; networks; Optimal diffusion parameters; optimal parameters; Optimization; Parameter estimation; point-to-point networks; resource allocation; State estimation; Storage allocation (computer); tile torus; Time sharing systems", treatment = "P Practical", } @Article{Ali:1994:ITA, author = "Hesham H. Ali and Hesham El-Rewini", title = "On the intractability of task allocation in distributed systems", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "149--157", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Nebraska at Omaha", affiliationaddress = "Omaha, NE, USA", classification = "721.1; 722.4; 723.1; 921.3; 921.4; 921.6; C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Nebraska Univ., Omaha, NE, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "allocation; complete; complexity; Computational complexity; computational complexity; Computational methods; Distributed computer systems; distributed processing; distributed systems; Formal logic; Graph theory; Graphic methods; Heuristic methods; Intractability; Mathematical models; Mathematical transformations; Minimization of switching nets; Multiprogramming; NP-; resource; scheduling; Split graphs; split graphs; State assignment; Storage allocation (computer); Task allocation; task allocation intractability; Theorem proving; Weighted clique partitioning; weighted clique partitioning; Weighted clique partitioning problem", treatment = "T Theoretical or Mathematical", } @Article{Beame:1994:IBE, author = "Paul Beame and Miroslaw Kutylowski and Marcin Kik", title = "Information broadcasting by Exclusive-Read {PRAMs}", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "159--169", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Washington", affiliationaddress = "Seattle, WA, USA", classification = "722.1; 722.4; 723.1; 903.3; 921; 921.6; C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Cellular arrays; Computational methods; Data storage equipment; EREW Parallel Random Access Machines (PRAM); Exclusive Read Exclusive Write (EREW); Exclusive Read Exclusive Write PRAM; exclusive-read PRAMs; Information broadcasting; information broadcasting; Information retrieval; lower bounds; parallel algorithms; Parallel processing systems; Parallel random access machines (prams); Program processors; prom; Random access storage; random-access storage; Storage allocation (computer)", treatment = "T Theoretical or Mathematical", } @Article{Ramesh:1994:RMR, author = "R. Ramesh", title = "{R}${}^2$-{M}: {A} reconfigurable rewrite machine", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "171--180", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Texas at Dallas", affiliationaddress = "Richardson, TX, USA", classification = "721.1; 722.1; 722.4; 723.1; 723.2; 921.4; 921.6; C4210 (Formal logic); C4240 (Programming and algorithm theory); C5220P (Parallel architecture); C7310 (Mathematics)", corpsource = "Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "architecture; Boolean algebra; Cellular arrays; Computation theory; Computational complexity; Computational methods; Computer architecture; Data handling; Data processing; Data storage equipment; fixed capacity auxiliary memory units; formula manipulation; Function evaluation; nonprocedural programming languages; Normalization; parallel; parallel architectures; Parallel architectures; parallel pattern matching; Parallel processing systems; Pattern matching; proving; R/sup 2/M; reconfigurable architectures; reconfigurable rewrite machine; Reconfigurable rewrite machine; rewriting systems; symbol manipulation; symbolic computations; term rewriting; Term rewriting; theorem; theorem proving; Theorem proving; Trees (mathematics)", treatment = "P Practical", } @Article{Persiano:1994:OAD, author = "Giuseppe Persiano", title = "An optimal algorithm for the dining philosophers problem", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "1-2", pages = "181--187", month = jun, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universita di Catania", affiliationaddress = "Catania, Italy", classification = "721.1; 722.1; 722.4; 921.5; 921.6; C4240P (Parallel programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dipartimento di Matematica, Catania Univ., Italy", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; Algorithms; allocation; Computational complexity; concurrency control; Constraint theory; Dining Philosophers Problem; dining philosophers problem; distributed; Distributed algorithms; distributed algorithms; Distributed computer systems; Lockout freedom; Lower bound; Mutual exclusion; optimal algorithm; Optimal systems; optimality; Optimization; resource; Response time (computer systems); Safety property; Storage allocation (computer)", treatment = "P Practical", } @Article{Heckler:1994:CLD, author = "Christian Heckler and Lothar Thiele", title = "Computing linear data dependencies in nested loop programs", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "193--204", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universit{\"a}t des Saarlandes", affiliationaddress = "Saarbr{\"u}cken, Ger", classification = "721.1; 722.4; 723.1; 723.2; C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Lehrstuhl fur Mikroelektronik, Saarlandes Univ., Saarbrucken, Germany", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; automatic; automatic programming; Data handling; Data structures; Data transfer; equations; inequalities; integer linear program; integer programming; Linear data dependencies; linear data dependencies; linear Diophantine; Linear Diophantine equations; Linear programming; linear programming; Multiprocessing programs; Multiprogramming; Nested loop programs; nested loop programs; parallel; parallel algorithms; parallel machine; Parallel processing systems; parallelization; parametric; programming; Programming theory; programming theory; VLSI circuits", treatment = "T Theoretical or Mathematical", } @Article{Kelly:1994:SAM, author = "Wayne Kelly and William Pugh", title = "Selecting affine mappings based on performance estimation", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "205--219", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Maryland", affiliationaddress = "MD, USA", classification = "721.1; 723.1; 723.2; 921.5; C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "affine mapping selection; Affine mappings; Code converters; Codes (symbols); Computer programming; Data structures; decisions; distribution; good code; iteration; iteration space; Iterative methods; iterative methods; Logic programming; loop; loop interchange; loop skewing; partially specified mapping; Performance estimation; performance estimation; program; Program compilers; Program processors; Programming theory; programming theory; reordering transformations; statement reordering", treatment = "T Theoretical or Mathematical", } @Article{Griebl:1994:SMW, author = "Martin Griebl and Christian Lengauer", title = "On the space-time mapping of {WHILE-loops}", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "221--232", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Informatik Universit{\"a}t Passau", affiliationaddress = "Passau, Ger", classification = "721.1; 723.1; 921.6; C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Fakultat fur Math. und Inf., Passau Univ., Germany", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "automatic; bound; computational polytope model; Computer programming; dynamic upper; FOR-loop; Iterative methods; parallel programming; parallelization; Polytopes; Program compilers; Program processors; programming theory; Programming theory; space-time mapping; Space-time mapping; Subroutines; WHILE-loops", treatment = "T Theoretical or Mathematical", xxauthor = "R. Griebl and C. Lengauer", } @Article{Feautrier:1994:TAD, author = "Paul Feautrier", title = "Toward automatic distribution", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "233--244", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universit{\'e} de Versailles St-Quentin", affiliationaddress = "Versailles, Fr", classification = "722.1; 722.4; 723.1; 723.2; C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming); C6150N (Distributed systems)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Lab. PRiSM, Univ. de Versailles St. Quentin, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "automatic distribution; code; Computer architecture; Computer systems programming; data distribution; Data handling; Data transfer; dataflow analysis; Distributed computer systems; distributed memory supercomputer; distributed memory systems; distribution; elementary calculation; Gaussian elimination; incremental analogue; level distribution schemes; message passing; Multiprocessing programs; Multiprogramming; owner computes rule; parallel; Parallel processing systems; Placement function; placement function; processor; processors; programming; programming theory; source program; Storage allocation (computer); System theory; two-; virtual; Virtual processor; Virtual storage", treatment = "T Theoretical or Mathematical", } @Article{Mongenet:1994:DCS, author = "Catherine Mongenet", title = "Data compiling for systems of uniform recurrence equations", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "245--257", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universit{\'e} Louis Pasteur", affiliationaddress = "Strasbourg, Fr", classification = "721.1; 722.4; 723.1; 921.5; C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Dept. d'Inf., Univ. Louis Pasteur, Strasbourg, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "automatic compilation; channels; communications; Computational methods; Computer architecture; Computer programming; data compilation; Data dependencies; data dependencies; Data structures; dependency analysis; local memory management; parallel; Parallel processing systems; parallel programming; Program compilers; program compilers; Program processors; programming theory; programs; Recurrence equations; regular network; send/receive; Storage allocation (computer); storage management; Subroutines; uniform recurrence equations; Virtual processors; virtual processors", treatment = "T Theoretical or Mathematical", } @Article{Darte:1994:AP, author = "Alain Darte and Yves Robert", title = "On the alignment problem", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "259--270", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Ecole Normale Superieure de Lyon", affiliationaddress = "LYON, Fr", classification = "721.1; 722.4; 723.1; 921.4; C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Affine loop nests; affine loop nests; Alignment; alignment; Alignment problem; communication; Communication graph; communication graph; computation alignment; Computational complexity; computational complexity; Computational methods; data alignment; Data transfer; Distributed computer systems; distributed memory systems; graph; Graphic methods; heuristic; mapping; Multiprogramming; NP-complete problem; number minimisation; parallel computers; parallel programming; Programming theory; programming theory; SPMD distributed memory; Subroutines; theory; uniform loop nests", treatment = "T Theoretical or Mathematical", } @Article{Balasa:1994:TNL, author = "Florin Balasa and Frank H. M. Franssen and Francky V. M. Catthoor and Hugo J. {De Man}", title = "Transformation of nested loops with modulo indexing to affine recurrences", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "271--280", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "IMEC", affiliationaddress = "Leuven, Belgium", classification = "721.1; 723.1; 903.1; 921.5; B6140 (Signal processing and detection); C1260 (Information theory); C4240P (Parallel programming and algorithm theory); C6110B (Software engineering techniques); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "IMEC, Leuven, Belgium", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "affine; affine index expressions; Affine indexing functions; algorithm theory; algorithmic; Algorithms; architecture synthesis; Code converters; code generation; code optimization; compiler; Computational methods; Computer architecture; control flow optimization; formal specification; Hermite; image processing; Indexing (of information); integer arithmetic; Modulo indexing; modulo indexing; multi-dimensional data processing systems; multi-dimensional signal processing systems; Multi-dimensional signals; nested loop transformation; normal form; numerical; optimisation; parallel programming; parallelisation; polynomial time; preprocessor; processing; Program compilers; program compilers; Program processors; recurrences; signal processing; specifications; speech processing; Subroutines", treatment = "T Theoretical or Mathematical", } @Article{Anderson:1994:FHL, author = "Richard J. Anderson and Barbara B. Simons", title = "A fast heuristic for loop parallelization", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "281--299", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Washington", affiliationaddress = "Seattle, WA, USA", classification = "721.1; 723.1; 723.2; 922.1; C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C4210 (Formal logic); C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "(mathematics); algorithm; Algorithms; arbitrary trees; carried dependences; Codes (symbols); Computational complexity; computational complexity; data dependences; Data handling; Data transfer; deadlines; delay minimization; delay problem; fast (O(n log/sup 2/ n)) time; fast loop parallelization heuristic; forest; graphs; Heuristic programming; in-tree forest; independent chains; iterations; iterative methods; loop-; Loop-carried data dependency; Multiprocessing programs; Multiprogramming; nonunit execution times; NP-complete problem; out-tree; parallel; precedence constraints; problem; processors; programming; Programming theory; programming theory; release times; Response time (computer systems); Scheduling; scheduling; separate invocations; start time; Subroutines; trees", treatment = "T Theoretical or Mathematical", } @Article{vanDongen:1994:CDL, author = "Vincent {van Dongen}", title = "Compiling distributed loops onto {SPMD} code", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "301--312", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Centre de Recherche Informatique de Montreal", affiliationaddress = "Montreal, Que, Can", classification = "721.1; 723.1; 921.5; C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Centre de Recherche Inf., McGill Univ., Montreal, Que., Canada", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "block-; Codes (symbols); compilers; Computation distribution; computation distribution; Computational methods; cyclic distribution; Data distribution; data distribution; Data transfer; Distributed computer systems; distributed loop compilation; distributed memory systems; distributed-memory machines; hidden parallelism; internal dependence; Multiprogramming; owner-computes; parallel loops; parallel programming; program; Program compilers; Program processors; programming theory; rule; sequential language; spmd code; SPMD code; Subroutines", treatment = "T Theoretical or Mathematical", } @Article{Violard:1994:MTE, author = "Eric Violard", title = "A mathematical theory and its environment for parallel programming", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "313--328", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Franche-Comte", affiliationaddress = "Besancon, Fr", classification = "721.1; 722.4; 723.1; 723.2; 921.3; C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Lab. d'Inf., Univ. de Franche-Comte, Besancon, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "CENTAUR; Computation theory; Computer programming; Convolution sum; convolution sum; Data handling; derivation power; Dirichlet product; Formal logic; mathematical theory; Mathematical transformations; Multiprogramming; Non-affine dependencies; nonaffine dependencies; Parallel processing systems; parallel program transformation; parallel programming; PEI; Programming theory; programming theory", treatment = "T Theoretical or Mathematical", } @Article{ODonnell:1994:CPP, author = "John T. O'Donnell", title = "A correctness proof of parallel scan", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "329--338", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Glasgow", affiliationaddress = "Glasgow, UK", classification = "721.1; 722.4; 723.1; C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6110B (Software engineering techniques); C6110P (Parallel programming)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "abstract parallel architecture; Algorithms; algorithms; Computer architecture; Correctness proof; correctness proof; divide-and-conquer strategy; Equational reasoning; equational reasoning; folds; Formal logic; formal specification; Functional programming; functional programming; Mathematical operators; Multiprocessing programs; parallel; parallel architecture; parallel architectures; Parallel processing systems; parallel programming; Parallel scan algorithm; parallel scan algorithm; program verification; programming; Programming theory; programming theory; pure functional language; Theorem proving", treatment = "T Theoretical or Mathematical", } @Article{Ganapathy:1994:OSP, author = "Kumar Ganapathy and Benjamin W. Wah", title = "Optimal synthesis of processor arrays with pipelined arithmetic units", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "339--350", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Illinois", affiliationaddress = "Urbana, IL, USA", classification = "721.3; 722.4; 723.5; 921.5; C4240 (Programming and algorithm theory); C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm theory; Computational methods; Computer architecture; Computer circuits; constraints; correctness; data flow periods; designs; Electric network synthesis; feasible; functional units; General Parameter Method; general parameter method; initiation interval; internal functional pipelines; matrix; minimum; Minimum initiation interval; n-dimensional meshes; optimal; Optimization; parallel processing; Parallel processing systems; pipeline processing; Pipeline processing systems; pipelined arithmetic units; processor arrays; products; pruning condition; reindexing transformation; symmetric problems; synthesis; System theory; systematic design method; Systems analysis; two-level pipelining", treatment = "T Theoretical or Mathematical", } @Article{Rahmouni:1994:LSA, author = "Maher Rahmouni and Kevin O'Brien and Ahmed A. Jerraya", title = "A loop-based scheduling algorithm for hardware description languages", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "351--364", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Laboratoire TIMA\slash INPG", affiliationaddress = "Grenoble, Fr", classification = "723.1; 723.1.1; C4240 (Programming and algorithm theory); C6140D (High level languages)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", corpsource = "Lab. TIMA, Inst. Nat. Polytech. de Grenoble, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm theory; Algorithms; Computer hardware description languages; Computer programming; Control-flow dominated machines; control-flow graph; dominated designs; dynamic loop scheduling; Dynamic loop scheduling algorithm; edges; hardware description; languages; large control-flow; loop feedback; loop-based scheduling algorithm; path generation interruption; path-based approaches; scheduling; specification languages", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1994:PTU, author = "Anonymous", title = "Parallelization Techniques for Uniform Algorithms {Workshop}", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "3", pages = "??--??", month = sep, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", conflocation = "Wadern, Germany; June 1993", conftitle = "Parallelization Techniques for Uniform Algorithms {Workshop}", countrypub = "Singapore", keywords = "algebra; convex polyhedra; formal languages; formal semantics; linear; linear algebra; linear programming; nested loops; parallel algorithms; parallel programming; parallelisation", treatment = "T Theoretical or Mathematical", } @Article{Germain:1994:SEM, author = "C. Germain and F. Delaplace and R. Carlier", title = "A static execution model for data parallelism", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "367--378", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universit{\'e} Paris-Sud", affiliationaddress = "Orsay, Fr", classification = "722.3; 722.4; 723.1; 723.2; 921.6; C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "a; abstract machine; architectures; Communication delays; communication delays; Data communication systems; data parallelism; Data transfer; data transfer; hardware propagation delays; interconnection network; Interconnection networks; Mathematical models; Message passing; message passing; multiprocessor interconnection networks; Numerical analysis; parallel; Parallel architecture; parallel architectures; Parallel compilers; Parallel processing systems; Performance; priori knowledge; Program compilers; Static execution model; static execution model", treatment = "T Theoretical or Mathematical", } @Article{Comellas:1994:LVS, author = "F. Comellas and M. A. Fiol and J. Gomez", title = "On large vertex symmetric $2$-reachable digraphs", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "379--384", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", URL = "http://www-mat.upc.es/~comellas/2reach/2reach.html", acknowledgement = ack-nhfb, affiliation = "Universitat Politecnica de Catalunya", affiliationaddress = "Barcelona, Spain", classification = "722.3; 722.4; 723.1; 921.4; 921.6; C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Dept. de Matematica Aplicada i Telematica, Univ. Politecnica de Catalunya, Barcelona, Spain", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Cayley digraphs; Computer software; Data communication systems; digraphs; directed graphs; Graph theory; interconnection networks; Interconnection networks; K reachable digraphs; largest possible vertex; Mathematical models; multiprocessor interconnection networks; Parallel processing systems; parallelism; reachable digraphs; symmetric digraphs; Theoretical bound; Topology; vertex symmetric 2-; Vertex symmetric digraphs", treatment = "T Theoretical or Mathematical", } @Article{Chou:1994:EFT, author = "Ray-Shyng Chou and Lih-Hsing Hsu", title = "1-edge fault-tolerant designs for meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "385--389", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Natl Chiao Tung Univ", affiliationaddress = "Hsinchu, Taiwan", classification = "722.4; 921.4; 921.5; C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection); C5220P (Parallel architecture)", corpsource = "Dept. of Comput. and Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Edge fault tolerant graphs; edge fault-tolerant designs; fault tolerant; Fault tolerant computer systems; fault tolerant computing; graph; Graph theory; graph theory; interconnection networks; Meshes; meshes; multiprocessor; Optimization; Parallel processing systems; Systems analysis", treatment = "T Theoretical or Mathematical", } @Article{Gasperoni:1994:GCO, author = "Franco Gasperoni and Uwe Schwiegelshohn", title = "Generating close to optimum loop schedules on parallel processors", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "391--403", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Ecole Nationale Superieure des Telecommunications", affiliationaddress = "Paris, Fr", classification = "721.1; 722.4; 723.1; 921.5; C5220P (Parallel architecture); C6150N (Distributed systems software)", corpsource = "Dept. of Inf., Ecole Nat. Superieure des Telecommun., Paris, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Computational complexity; Computer systems programming; Concurrency control; cyclic; Cyclic scheduling; Loop parallelization; loop parallelization; loop schedules; NP-hard problem; Optimization; parallel processing; Parallel processing systems; parallel processors; pipelined; processor scheduling; Scheduling; scheduling; unpipelined", treatment = "T Theoretical or Mathematical", } @Article{Valero:1994:NSO, author = "Mateo Valero and Eduard Ayguade and Montse Peiron", title = "Network synchronization and out-of-order access to vectors", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "405--415", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universitat Politecnica de Catalunya", affiliationaddress = "Barcelona, Spain", classification = "721.1; 722.1; 722.4; 723.1; 723.2; C4240C (Computational complexity); C5310 (Storage system design); C5440 (Multiprocessing systems); C6120 (File organisation)", corpsource = "Dept. d'Arquitectura de Computadors, Univ. Politecnica de Catalunya, Barcelona, Spain", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Access latency; Buffer storage; complexity; Computational complexity; computational complexity; Computer hardware; Computer systems programming; Conflict free access; Data storage equipment; interconnection network; Interconnection networks; interleaved storage; Interleaved storage scheme; interleaved storage scheme; memory; modules; Multimodule memories; Multiprocessing systems; multiprocessor systems; Network synchronization; network synchronization; Out of order access; out-of-order access; Performance; Storage allocation (computer); synchronisation; Synchronization; Systems analysis; vector; Vector multiprocessors; vector processor systems; Vectors", treatment = "P Practical", } @Article{Diks:1994:RTD, author = "Krzysztof Diks and Adam Malinowski and Andrzej Pelc", title = "Reliable token dispersal with random faults", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "417--427", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universit{\'e} du Qu{\'e}bec {\`a} Hull", affiliationaddress = "Hull, Que, Can", classification = "721.1; 722.3; 722.4; 723.1; 921.5; 922.1; B6210L (Computer communications); C4240C (Computational complexity); C5620 (Computer networks and techniques); C5670 (Network performance)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Computational complexity; computational complexity; Computer networks; computer networks; computing; Data communication systems; fault tolerant; Fault tolerant computer systems; fault-free node; identical tokens; n-; Node; node network; Optimization; Probability; probability of correctness; Random faults; random faults; reliable token dispersal; source; time complexity; Token; Token dispersal", treatment = "P Practical", } @Article{Saxena:1994:PPC, author = "Sanjeev Saxena and P. C. P. Bhatt and V. C. Prasad", title = "On parallel prefix computation", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "429--436", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Indian Inst of Technology", affiliationaddress = "Kanpur, India", classification = "722.1; 722.4; 723.1; 921.1; 921.5; 921.6; C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Electr. Eng., Indian Inst. of Technol., Delhi, India", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; COMMON CRCW PRAM; CRCW model; linear time-processor product; Mathematical models; Merging; merging; Optimization; Parallel algorithms; parallel algorithms; Parallel prefix; parallel prefix computation; Parallel processing systems; Polynomials; prefix sums; r-way parallel merge sort; Random access storage; Shared memory model; Sorting; sorting", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Galley:1994:SPA, author = "Clive N. Galley and Costas S. Iliopoulos", title = "A simple parallel algorithm for the single function coarsest partition problem", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "437--445", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of London", affiliationaddress = "London, Engl", classification = "722.1; 722.4; 723.1; 921.4; 921.6; C4240P (Parallel programming and algorithm theory); C5320G (Semiconductor storage)", corpsource = "Dept. of Comput. Sci., King's Coll., London, UK", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "CRCW PRAM; CRCW PRAM model; Functions; Mathematical models; parallel algorithm; Parallel algorithms; parallel algorithms; parallel computation; Parallel processing systems; Partitioning; problem; Random access storage; random-access storage; Set theory; single function coarsest partition; Single function coarsest partition problem", treatment = "P Practical", } @Article{Swift:1994:PCL, author = "L. K. Swift and T. Johnson and P. E. Livadas", title = "Parallel creation of linear octrees from quadtree slices", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "447--453", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Florida", affiliationaddress = "Gainesville, FL, USA", classification = "722.1; 722.4; 723.1; 723.2; C1250 (Pattern recognition); C5260B (Computer vision and image processing techniques); C6120 (File organisation)", corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ., Gainesville, FL, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "d-slice; Data storage equipment; Data structures; hierarchical data; image data; Image processing; image processing; linear octrees; noncubic volumes; Octrees; octrees; parallel algorithm; Parallel algorithms; Parallel processing systems; quadtree slices; Quadtrees; quadtrees; requirements; storage; structures; Three dimensional; Two dimensional images; two dimensional images", treatment = "P Practical", } @Article{Nivat:1994:EPS, author = "M. Nivat and G. D. S. Ramkumar and C. {Pandu Rangan} and A. Saoudi and R. Sundaram", title = "Efficient parallel shuffle recognition", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "455--463", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universit{\'e} Paris", affiliationaddress = "Paris, Fr", classification = "722.1; 722.4; 723.1; 723.5; 921.4; 921.6; C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory)", corpsource = "LITP, Paris VII Univ., France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Computer programming; Computer simulation; Digraph reachability; dynamic programming; EREW PRAM model; EREW-PRAM; Graph theory; Mathematical models; model; parallel algorithm; parallel algorithms; Parallel algorithms; Parallel processing systems; parallel shuffle recognition; Parallel shuffle recognition; Random access storage; Strings; Systolic arrays", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Lin:1994:CRB, author = "Rong Lin and Stephan Olariu and James L. Schwing and Jingyuan Zhang", title = "Computing on reconfigurable buses --- a new computational paradigm", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "465--476", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "State Univ of New York", affiliationaddress = "Geneseo, NY, USA", classification = "721.1; 722.3; 722.4; 723.1; 723.2; C1250 (Pattern recognition); C5260B (Computer vision and image processing techniques); C5610S (System buses)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Geneseo, NY, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "buses; Computational methods; computational paradigm; Computational paradigms; Data communication systems; Data transfer; descriptors; Image segmentation; image segmentation; Parallel algorithms; Parallel processing systems; Parallel visibility; parallel visibility; parallel visibility problem; prefix maxima; reconfigurable architectures; Reconfigurable buses; reconfigurable buses; system; topological", treatment = "P Practical", } @Article{Gupta:1994:IFF, author = "S. K. S. Gupta and C.-H. Huang and P. Sadayappan and R. W. Johnson", title = "Implementing fast {Fourier} transforms on distributed-memory multiprocessors using data redistributions", journal = j-PARALLEL-PROCESS-LETT, volume = "4", number = "4", pages = "477--488", month = dec, year = "1994", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Ohio State Univ", affiliationaddress = "Columbus, OH, USA", classification = "722.3; 722.4; 723.1; 723.2; 921.3; C4190 (Other numerical methods); C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C5670 (Network performance); C7310 (Mathematics computing)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Calculations; communication cost; Data communication systems; Data redistribution; data redistributions; Data storage equipment; Data transfer; Distributed computer systems; Distributed memory multiprocessors; distributed memory systems; distributed-memory multiprocessors; evaluation; Fast Fourier transforms; fast Fourier transforms; Fortran (programming language); High performance Fortran; Intel iPSC/860; mathematics computing; Optimization; Parallel algorithms; parallel algorithms; performance; Point to point message phasing; system", treatment = "A Application; P Practical", } @Article{Sahni:1995:DMD, author = "S. Sahni", title = "Data manipulation on the distributed memory bus computer", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "3--14", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C5220P (Parallel architecture); C5230 (Digital arithmetic methods); C5260B (Computer vision and image processing techniques); C5440 (Multiprocessing systems); C6130 (Data handling techniques); C7310 (Mathematics computing)", corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ., Gainesville, FL, USA", countrypub = "Singapore", keywords = "access reads; accumulation; adjacent sum; algorithms; architectures; computational complexity; computer; consecutive sum; data; data manipulation operations; data shift; data sum; digital arithmetic; distributed; distributed memory bus; DMBC; image; image processing; image processing applications; imsge expanding; memory systems; prefix sum; random; reconfigurable; reconfigurable bus computers; shrinking; sorting; symbol manipulation; template matching; time complexity", treatment = "P Practical", } @Article{MacKenzie:1995:SBR, author = "P. D. MacKenzie", title = "A separation between reconfigurable mesh models", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "15--22", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Sandia Nat. Labs., Albuquerque, NM, USA", countrypub = "Singapore", keywords = "algorithms; architectures; bandwidth; binary inputs; constraints; cross over model; instruction sets; non cross over model; noncross over model; parallel; parallel algorithms; parity; reconfigurable architectures; reconfigurable mesh models; rmesh", treatment = "P Practical", } @Article{Nakano:1995:PAR, author = "K. Nakano", title = "Prefix-sums algorithms on reconfigurable meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "23--35", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Adv. Res. Lab., Hitachi Ltd., Saitama, Japan", countrypub = "Singapore", keywords = "architectures; binary; capability; communication; computational complexity; parallel; parallel algorithm; parallel algorithms; prefix-sums algorithms; reconfigurable architectures; reconfigurable meshes; simultaneous sending; values; word model", treatment = "P Practical", } @Article{Rosenberg:1995:RRP, author = "A. L. Rosenberg and V. Scarano and R. K. Sitaraman", title = "The Reconfigurable Ring of {Processors}: efficient algorithms via hypercube simulation", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "37--48", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessing systems); C5640 (Protocols); C6110P (Parallel programming); C6185 (Simulation techniques); C7430 (Computer engineering)", corpsource = "Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA", countrypub = "Singapore", keywords = "arbitrary; architectures; COMET; communication protocol; cooperative message transmission; dynamically; dynamically reconfigurable parallel; efficient algorithms; elements; fast Fourier; flexible multiline reconfigurable bus; hypercube algorithms; hypercube networks; hypercube PE; hypercube simulation; identical processing; line RRP; matrix multiplication; N-; one packet messages; parallel; parallel algorithms; PE-to-PE connection; Processors; protocols; reconfigurable architectures; reconfigurable parallel computer; Reconfigurable Ring of; transform; virtual machines", treatment = "P Practical", } @Article{Ben-Asher:1995:CPP, author = "Y. Ben-Asher", title = "The {Cartesian} product problem and implementing production systems on reconfigurable meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "49--61", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)C6170 (Expert systems); C6110P (Parallel programming); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Math. and Comput. Sci., Haifa Univ., Israel", countrypub = "Singapore", keywords = "adaptive randomized algorithm; architectures; broadcasting; Cartesian product problem; Cartesian productions; CCP problem; conditional Cartesian product; conditioned; database machines; database management systems; database queries; deterministic algorithm; knowledge based systems; parallel architectures; parallel programming; production systems; reconfigurable; reconfigurable mesh; reconfigurable meshes; step", treatment = "P Practical", } @Article{Suel:1995:PRS, author = "T. Suel", title = "Permutation routing and sorting on meshes with row and column buses", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "63--80", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5610S (System buses); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", countrypub = "Singapore", keywords = "1 sorting; 1-; architectures; bisection lower bound; buses; column buses; combinatorial mathematics; deterministic algorithms; deterministic routing algorithms; meshes; multi-dimensional network; offline routing schemes; parallel algorithms; parallel architectures; permutation routing; reconfigurable; reconfigurable mesh; reconfigurable networks; row; sorting; system buses; two dimensional networks", treatment = "P Practical", } @Article{Kaufmann:1995:RSR, author = "M. Kaufmann and H. Schroder and J. F. Sibeyn", title = "Routing and sorting on reconfigurable meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "81--95", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6130 (Data handling techniques)", corpsource = "Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany", countrypub = "Singapore", keywords = "architectures; asymptotically optimal; column buses; hypercubic; linear array; mesh connected; networks; one-port-at-a-; parallel algorithms; parallel architectures; permutation routing; point-to-point communication; processor arrays; realistic problem; reconfigurable; reconfigurable meshes; routing; sizes; sorting; time; time bound; unidirectional row bus; very weak model", treatment = "P Practical", } @Article{Germain:1995:SNH, author = "C. Germain and F. Cappello", title = "The static network: a high performance reconfigurable communication network", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "97--109", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessing systems)", corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France", countrypub = "Singapore", keywords = "1.33 Gbit/s; 270 ns; 500 GByte/s; application scope; architectures; bandwidth; circuit; circuit switching; communication network; distributed memory systems; high performance processing nodes; high performance reconfigurable; interconnection; interconnection network; massively; multiprocessor interconnection networks; numerical computation; offline routed circuits; parallel; parallel architecture; reconfigurable architectures; static communication model; static network; sustained aggregate; switch design; switching hardware; synchronised MIMD distributed memory machine; technology", treatment = "P Practical", } @Article{Nakano:1995:BPP, author = "K. Nakano", title = "A bibliography of published papers on dynamically reconfigurable architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "1", pages = "111--124", month = mar, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C6110P (Parallel programming)C4240P (Parallel programming and algorithm theory)", corpsource = "Adv. Res. Lab., Hitachi Ltd., Saitama, Japan", countrypub = "Singapore", keywords = "bibliographies; bibliography; circuit switching; communication patterns; dynamically reconfigurable architectures; flexible connection patterns; locally controllable switches; parallel algorithms; parallel architectures; parallel computer architecture; physical switching; reconfigurable architectures", treatment = "P Practical", } @Article{Cosnard:1995:EN, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "125--??", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Nov 09 08:05:00 1998", acknowledgement = ack-nhfb, } @Article{Ibarra:1995:TOE, author = "Louis Ibarra and Dana Richards", title = "Tree open ear decomposition in parallel graph algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "129--138", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Rutgers Univ", classification = "721.1; 723.1; 723.5; 921.4; 921.6; C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "complete; Computational complexity; CREW PRAM; Depth first search; depth-first search; Graph theory; Mathematical models; NP-; parallel algorithm; Parallel algorithms; parallel algorithms; Parallel graph algorithms; parallel graph algorithms; Program processors; tree open ear decomposition", treatment = "T Theoretical or Mathematical", } @Article{Hagerup:1995:FPP, author = "Torben Hagerup and J{\"o}rg Keller", title = "Fast parallel permutation algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "139--148", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Max-Planck-Inst f{\"u}r Informatik", classification = "722.1; 722.4; 723.1; 723.5; 921.6; C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Max-Planck-Inst. fur Inf., Saarbrucken, Germany", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "address space; algorithms; computational complexity; EREW PRAM; Fast parallel permutation algorithm; file organisation; Numerical methods; parallel; Parallel algorithms; parallel permutation algorithms; PRAM emulation; prefix; Program processors; Random access storage; Real time systems; rehashing; Shared memory; Storage allocation (computer); summation", treatment = "T Theoretical or Mathematical", } @Article{Krizanc:1995:ZSM, author = "Danny Krizanc and Lata Narayanan", title = "Zero-one sorting on the mesh", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "149--155", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Carleton Univ", classification = "722.4; 723.1; 723.5; 921.4; 922.1; C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection)C1230 (Artificial intelligence); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; Algorithms; algorithms; arbitrary indexing scheme; deterministic; deterministic algorithms; Distributed computer systems; divide and conquer methods; divide-and-conquer; indexing; Mesh connected computer; mesh-connected computer; multiprocessor interconnection networks; packing problems; Program processors; Queueing theory; Set theory; Sorting; sorting; Zero one sorting; zero-one sorting", treatment = "A Application; P Practical", } @Article{Desprez:1995:PSL, author = "F. Desprez and J. J. Dongarra and B. Tourancheau", title = "Performance study of {LU} factorization with low communication overhead on multiprocessors", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "157--169", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Tennessee", classification = "721.1; 722.4; 723.5; 921.6; C4240C (Computational complexity); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C7310 (Mathematics computing)", corpsource = "Dept. of Comput. Sci., Tennessee Univ., Knoxville, TN, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Asynchronous communications; asynchronous communications; column-scattered data decomposition; complexities; computational; Computational complexity; computational complexity; Distributed computer systems; Estimation; Intel iPSC/860; low communication; LU factorization; mathematics computing; Multiprocessing systems; multiprocessing systems; multiprocessors; overhead; Paragon machines; Parallel complexity; Parallel processing systems; Performance; performance evaluation; performance study; Pipeline processing systems", treatment = "A Application; P Practical", } @Article{Ahuja:1995:IGF, author = "Mohan Ahuja and Michel Raynal", title = "An implementation of global flush primitives using counters", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "171--178", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of California, San Diego", classification = "722.4; 723.1; C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C6110P (Parallel programming)", corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San Diego, La Jolla, CA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Asynchronous distributed programming systems; causal; Computer programming; counters; Distributed computer systems; Fault tolerant computer systems; Global flush primitives; global flush primitives implementation; ordering; parallel machines; Parallel processing systems; parallel programming; Performance; synchronisation; Synchronization", treatment = "A Application; P Practical", } @Article{Cai:1995:CRU, author = "Wentong Cai and David B. Skillicorn", title = "Calculating recurrences using the {Bird-Meertens} formalism", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "179--190", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Nanyang Technological Univ", classification = "721.1; 723.5; 921.3; 921.6; C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Sch. of Appl. Sci., Nanyang Technol. Inst., Singapore", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Bird-Meertens formalism; Calculations; complexity; Computational complexity; computational complexity; Computer software; datatype theories; engineering; lists; logarithmic parallel time; Logarithmic parallel time complexity; Mathematical transformations; Maximum segment sum problem; maximum segment sum problem; Parallel algorithms; parallel algorithms; Program deviation; Recurrence relations; recurrences; software; software development", treatment = "A Application; P Practical", } @Article{Cole:1995:PPL, author = "Murray I. Cole", title = "Parallel programming with list homomorphisms", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "191--203", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Edinburgh", classification = "721.1; 722.4; 723.1; 723.2; 723.5; C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Bird-Meertens; Computational linguistics; Computer programming; Data reduction; formalism; Functional parallelism; Language recognition algorithm; language recognition algorithm; list homomorphisms; nested; Parallel algorithms; parallel algorithms; Parallel processing systems; Parallel programming; parallel programming; parallelism", treatment = "A Application; P Practical", } @Article{Pavel:1995:EAE, author = "Sandy Pavel and Selim G. Akl", title = "Efficient algorithms for the {Euclidean} distance transform", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "205--212", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Queen's Univ", classification = "723.1; 723.2; 723.5; 731.5; 921.5; C1250 (Pattern recognition); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry); C5260B (Computer vision and image processing techniques)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; binary; computational complexity; computational geometry; computational tool; Computer vision; cost optimal randomized parallel; deterministic EREW-; Euclidean distance transform; image; Image processing; images; optimal sequential algorithm; Optimization; Parallel algorithms; parallel algorithms; Pattern recognition; PRAM parallel algorithm; processing; Program processors; randomised algorithms; Robotics; Time optimal sequential algorithm; Totally monotone matrix", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ho:1995:EBH, author = "Ching-Tien Ho and Ming-Yang Kao", title = "Efficient broadcast on hypercubes with wormhole and $e$-cube routings", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "213--222", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Almaden Research Cent", classification = "722.4; 723.5; 921.4; 921.5; 921.6; C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5440 (Multiprocessing systems)", corpsource = "IBM Almaden Res. Center, San Jose, CA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; broadcast; Communication algorithms; e-cube routings; Graph theory; hypercube networks; hypercubes; intermediate reception capability; Mathematical models; multiplicative constant; Multiprocessing systems; one-port communication; Optimization; parallel algorithms; Parallel processing systems; Routing algorithm; tight time bounds; Topology; wormhole", treatment = "A Application; P Practical", } @Article{Berkman:1995:FPA, author = "Omer Berkman and Yossi Matias", title = "Fast parallel algorithms for minimum and related problems with small integer inputs", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "223--230", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "King's Coll London", classification = "721.1; 723.2; 723.5; 921.6; C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., King's Coll., London, UK", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Calculations; complexities; Computational complexity; computational complexity; Computational methods; Data structures; Fast parallel algorithm; integer domain; Linear work algorithms; linear-work algorithms; Parallel algorithms; parallel algorithms; prefix minima; range minima; small integer inputs", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bhattacharya:1995:QLI, author = "S. Bhattacharya and S. Kirani and W. T. Tsai", title = "Quadtree layouts and {I/O} bandwidth", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "231--240", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Honeywell Technology Cent", classification = "714.2; 721.1; 723.2; 921.6; C1160 (Combinatorial mathematics); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "data structure; Data structures; generic; Grid model; I/O bandwidth; Integrated circuit layout; layout mixing strategy; Layout mixing strategy; layout strategies; Mathematical models; Quadtree data structure; quadtree layouts; quadtrees; Recursive functions; VLSI circuits", treatment = "P Practical", } @Article{Ziavras:1995:SMH, author = "Sotirios G. Ziavras", title = "Scalable multifolded hypercubes for versatile parallel computers", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "241--250", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "New Jersey Inst of Technology", classification = "716.1; 721.1; 722; 722.4; 723.2; C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessing systems)", corpsource = "Dept. of Electr. and Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Binary hypercube; Computer architecture; Computer hardware; computers; Data communication systems; Data structures; Generalized hypercube; hypercube networks; Interconnection networks; parallel processing; Parallel processing systems; regular communication patterns; Scalable multifolded hypercube; scalable multifolded hypercubes; versatile parallel; versatility", treatment = "P Practical", } @Article{Andonov:1995:SRS, author = "R. Andonov and P. Quinton and S. Rajopadhye and D. Wilde", title = "A shift register-based systolic array for the unbounded knapsack problem", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "251--262", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "IRISA", classification = "721.1; 721.3; 722.1; 722.4; 921.1; 921.5; B0260 (Optimisation techniques); B1265B (Logic circuits); C1180 (Optimisation techniques); C1290 (Applications of systems theory); C4240C (Computational complexity); C5120 (Logic and switching circuits); C5220P (Parallel architecture)", corpsource = "IRISA, Rennes, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Combinatorial mathematics; Computational complexity; computational complexity; dynamic dependencies; Dynamic programming; Knapsack problem; NP-hard problem; operations research; optimal array; optimisation; Optimization; Parallel processing systems; Polynomials; problem; recurrences; Run time data dependencies; shift register-based systolic array; Shift registers; shift registers; Systolic arrays; systolic arrays; unbounded knapsack; VLSI circuits", treatment = "A Application; P Practical", } @Article{Stalzer:1995:PFM, author = "Mark A. Stalzer", title = "A parallel fast multipole method for the {Helmholtz} equation", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "263--274", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Hughes Research Lab", classification = "716.1; 721.1; 722.4; 723.2; 921.1; 921.6; C4130 (Interpolation and function approximation); C4170 (Differential equations); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Hughes Res. Labs., Malibu, CA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; antenna radiation patterns; communications costs; Computational complexity; computational complexity; Data communication systems; Fast multipole method; Helmholtz equation; Helmholtz equations; impedance matrix; iterative; Iterative methods; iterative solvers; Matrix algebra; matrix-vector; methods; multiplication; Paragon XP/S; parallel; Parallel algorithms; parallel algorithms; parallel fast multipole method; Parallel processing systems; product; radar cross sections; sparse components; Time complexity analysis; time complexity analysis; Vectors", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bollig:1995:ACC, author = "Beate Bollig and Martin Huhne and Stefan Polt and Petr Savicky", title = "On the average case circuit delay of disjunction", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "275--280", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Dortmund", classification = "703.1.1; 713.5; 721.1; 723.2; 921.1; C4240C (Computational complexity)", corpsource = "Lehrstuhl Inf. II, Dortmund Univ., Germany", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Average case; average case circuit delay; average case time complexity; Circuit complexity; Computational complexity; computational complexity; conjunction; Delay circuits; delays; disjunction; Electric network analysis; expected delay; Expected time; lower bounds; Parallel algorithms; upper bounds; Vectors", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Watts:1995:PBM, author = "Jerrell Watts and Robert {Van De Geijn}", title = "A pipelined broadcast for multidimensional meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "281--292", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "California Inst of Technology", classification = "716.1; 722.4; 921.6; C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessing systems)", corpsource = "Scalable Concurrent Programming Lab., California Inst. of Technol., Pasadena, CA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; architecture; Bidirectional links; bidirectional links; Broadcasting; Computer architecture; Data communication systems; Electric network topology; Gray T3D; Mathematical models; mesh; Mesh architecture; multidimensional meshes; multiprocessor interconnection networks; performance; pipeline processing; Pipeline processing systems; pipelined broadcast; Telecommunication links; torus; wormhole routing; Wormhole routing technique", treatment = "P Practical", xxauthor = "J. Watts and R. {van de Geijn}", } @Article{Bongiovanni:1995:MSM, author = "Giancarlo Bongiovanni and Pierluigi Crescenzi and Sergio {De Agostino}", title = "{MAX} {SAT} and {MIN} {SET} cover approximation algorithms are {P}-complete", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "293--298", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universita degli Studi di Roma 'La Sapienza'", classification = "721.1; 723.2; 921.1; 921.6; B0290F (Interpolation and function approximation); C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C4190 (Other numerical methods); C4240C (Computational complexity); C4260 (Computational geometry)", corpsource = "Dipartimento di Sci. dell'Inf., Rome Univ., Italy", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "approximation algorithms; Approximation theory; approximation theory; Circuit value problem; Combinatorial mathematics; Computational complexity; computational complexity; computational geometry; logarithmic space reducibility; Logarithmic space reduction; MAX SAT; MIN SET COVER approximation algorithms; Parallel algorithms; Polynomials; sequential; Sequential approximation algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Niedermeier:1995:OOA, author = "Rolf Niedermeier and Peter Rossmanith", title = "On optimal {OROW}-{PRAM} algorithms for computing recursively defined functions", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "299--309", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Technische Universit{\"a}t M{\"u}nchen", classification = "721.1; 722.4; 723.2; 921.6; C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Fak. fur Inf., Tech. Univ. Munchen, Germany", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "access machines; completely connected processor network; computational complexity; Computational methods; computational model; Computer networks; Mathematical models; optimal OROW-PRAM algorithms; Parallel algorithms; parallel algorithms; Parallel processing systems; parallel random; Parallel random access machines; Read owner processor; Recursive functions; recursively defined functions; work-optimal; Write owner processor", treatment = "P Practical", } @Article{Lutz:1995:DFC, author = "David R. Lutz and D. N. Jayasimha", title = "Do fixed-processor communication-time tradeoffs exist?", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "311--320", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "AT\&T Bell Lab", classification = "716.1; 721.1; 722.4; 723.2; C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "AT and T Bell Labs., Columbus, OH, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithm; communication bounds; Communication time tradeoffs; Communication volume; Computation time; Computational complexity; computational complexity; Data communication systems; fixed-processor communication-time tradeoffs; lower bounds; parallel; Parallel algorithms; parallel algorithms; Response time (computer systems); Scheduling; unrestricted schedules", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wu:1995:TBN, author = "Jie Wu", title = "Tight bounds on the number of $\ell$-nodes in a faulty hypercube", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "321--328", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Florida Atlantic Univ", classification = "721.1; 722.4; 723.2; C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5470 (Performance evaluation and testing); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci. and Eng., Florida Atlantic Univ., Boca Raton, FL, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Computer system recovery; Data structures; Fault tolerant computer systems; fault tolerant computing; faulty hypercube; Faulty nodes; faulty nodes; hypercube networks; Hypercube systems; Interconnection networks; l-nodes; multiprocessor systems; node; Parallel processing systems; root; spanning binomial; Spanning binomial tree; spanning tree structures; structures; tight bounds; tree; tree data", treatment = "P Practical", } @Article{Norman:1995:CSC, author = "M. G. Norman and S. Pelagatti and P. Thanisch", title = "On the complexity of scheduling with communication delay and contention", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "331--341", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C6150N (Distributed systems software)", corpsource = "Parallel Comput. Centre, Edinburgh Univ., UK", countrypub = "Singapore", keywords = "communication contention; communication delay; communication latency; complexity of scheduling; computational complexity; contention; delays; execution time tasks; NP-completeness; processor scheduling; unit; unit interprocessor", treatment = "P Practical", } @Article{Mahesh:1995:PBS, author = "S. Mahesh and C. {Siva Ram Murthy} and C. {Pandu Rangan}", title = "Performance bounds for static multiprocessor scheduling of multi-task jobs", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "343--355", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing)", corpsource = "Tata Inf. Syst. Ltd., Bangalore, India", countrypub = "Singapore", keywords = "asymptotic upper bound; asymptotic upper bounds; dimensional orthogonal bin packing; job scheduling; largest processor; longest processing time first algorithms; makespan; multi-; multiple processors; multiprocessing systems; multiprocessor systems; performance bounds; performance evaluation; processor; processor requirement; requirement first algorithms; scheduling; static multiprocessor scheduling; task jobs; two-", treatment = "A Application; P Practical", } @Article{Tel:1995:LEH, author = "G. Tel", title = "Linear election in hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "357--366", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240C (Computational complexity); C5440 (Multiprocessing systems)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", countrypub = "Singapore", keywords = "asymptotic; computational complexity; hypercube networks; hypercubes; linear election; message; randomized version; time bounds", treatment = "P Practical", } @Article{Perumalla:1995:PAM, author = "K. Perumalla and N. Deo", title = "Parallel algorithms for maximum subsequence and maximum subarray", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "367--373", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA", countrypub = "Singapore", keywords = "computational complexity; contiguous subsequence; EREW PRAM; maximum subarray; maximum subsequence; parallel algorithms; sequential upperbound; time-processor product; two-dimensional array", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Correa:1995:ESP, author = "R. Correa and A. Ferreira", title = "On the effectiveness of synchronous parallel branch-and-bound algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "375--386", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1290 (Applications of systems theory); C4240P (Parallel programming and algorithm theory)", corpsource = "IMAG, Grenoble, France", countrypub = "Singapore", keywords = "combinatorial optimization; disjoint subproblems; efficiency measures; high level parallelization; knapsack problem; memory model; operations research; parallel algorithms; parallel computation; shared; simulation results; successive decompositions; synchronous parallel branch-and-bound algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chandra:1995:RFM, author = "A. Chandra and R. Melhem", title = "Reconfiguration in fault-tolerant {3D} meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "387--399", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Electr. Eng., Pittsburgh Univ., PA, USA", countrypub = "Singapore", keywords = "architectures; compensation paths; fault tolerant computing; fault-tolerant 3D meshes reconfiguration; hypercube networks; miss compensation; paths; reconfigurable; switch states", treatment = "A Application; P Practical", } @Article{Merry:1995:CTS, author = "M. S. Merry and J. Baker", title = "A constant time sorting algorithm for a three dimensional reconfigurable mesh and reconfigurable network", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "401--412", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Heidelberg Coll., Tiffin, OH, USA", countrypub = "Singapore", keywords = "architectures; compression algorithms; constant time algorithm; constant time sorting algorithm; hypercube networks; parallel algorithms; reconfigurable; reconfigurable mesh; reconfigurable mesh network; reconfigurable network; sorting; techniques; three dimensional", treatment = "P Practical", } @Article{Haglin:1995:BEM, author = "D. J. Haglin", title = "Bipartite expander matching is in {NC}", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "413--420", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240C (Computational complexity)", corpsource = "Dept. Comput. and Inf. Sci., Mankato State Univ., MN, USA", countrypub = "Singapore", keywords = "bipartite expander matching; computational complexity; deterministic algorithms; deterministic NC algorithm; expansion factor; graph; large expansion factors; maximum matching; NC; theory", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Collard:1995:CDL, author = "J. Collard and T. Risset and P. Feautrier", title = "Construction of {DO} loops from systems of affine constraints", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "421--436", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "URA CNRS, Lyon, France", countrypub = "Singapore", keywords = "affine; bounds; computational geometry; constraints; convex integer polyhedron; DO loop nests; DO loops constructions; integer points; iteration space; loop; parallel code generation; parallel programming; parallelization techniques; reindexation; systems of affine constraints", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Szymanski:1995:SPR, author = "B. K. Szymanski and W. Maniatty and B. Sinharoy", title = "Simultaneous parallel reduction on {SIMD} machines", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "437--449", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C5440 (Multiprocessing systems)", corpsource = "Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA", countrypub = "Singapore", keywords = "array; binary; communication cost; complexity; computational complexity; distributed; distributed-memory; interconnection networks; large scientific computation; machine; one-dimensional consecutive section; operator; parallel; parallel processing; processors; SIMD machines; simultaneous parallel reduction; target architectures", treatment = "P Practical", } @Article{Chan:1995:OSD, author = "I. W. Chan and F. Choi", title = "An optimal systolic dictionary", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "451--460", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of Singapore, Singapore", countrypub = "Singapore", keywords = "average latency; database management systems; dictionary; global tree rebalancing scheme; high system throughput; machine; optimal response time; optimal systolic dictionary; parallel algorithms; simulation; systolic algorithm; VLSI technology", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Oksa:1995:TLS, author = "G. Oksa", title = "Time-minimal linear systolic arrays for the {Toeplitz} system of linear equations", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "461--474", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); B1265B (Logic circuits); C5120 (Logic and switching circuits)C4140 (Linear algebra); C5220P (Parallel architecture)", corpsource = "Nuclear Power Plants Res. Inst., Trnava, Slovakia", countrypub = "Singapore", keywords = "equations; linear; serial Schur-like algorithm; systolic arrays; systolization; time-minimal linear systolic arrays; Toeplitz matrices; Toeplitz system", treatment = "A Application; P Practical", } @Article{Drach:1995:ACA, author = "N. Drach and A. Gefflaut and P. Joubert and A. Seznec", title = "About cache associativity in low-cost shared memory multi-microprocessors", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "475--487", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1230D (Neural nets); C5340 (Associative storage); C5440 (Multiprocessing systems); C6120 (File organisation)", corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France", countrypub = "Singapore", keywords = "associative cache organisation; cache associativity; cache storage; cache structures; content-addressable storage; low cost single-bus; low-cost shared memory; multimicroprocessors; on-chip caches; organization; semi-unified cache; shared memory; shared memory multiprocessors; skewed-; systems", treatment = "P Practical", } @Article{Pelc:1995:ABA, author = "A. Pelc", title = "Almost-safe {Byzantine} agreement in sparse networks with random faults", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "489--497", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6150M (Protocols); B6210L (Computer communications); C5470 (Performance evaluation and testing); C5640 (Protocols)", corpsource = "Dept. d`Inf., Quebec Univ., Hull, Que., Canada", countrypub = "Singapore", keywords = "almost-safe agreement protocols; almost-safe Byzantine agreement; asymptotically sparsest possible; fault tolerant computing; faults; networks; protocols; random; sparse n-node; sparse networks", treatment = "P Practical", } @Article{Qiao:1995:DCA, author = "C. Qiao", title = "On designing communication-intensive algorithms for a spanning optical bus based array", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "499--511", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C5220 (Computer architecture)", corpsource = "Dept. of Electr. and Comput. Eng., State Univ. of New York, Buffalo, NY, USA", countrypub = "Singapore", keywords = "algorithms; based array; buses architecture; communication-intensive algorithms; computational complexity; connectivities; control complexities; flexible reconfiguration; implementation; matrix transposition; multiplication; parallel; parallel algorithms; reconfigurable architectures; reconfigurable array with spanning optical; spanning optical bus; strong", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Picquendar:1995:CSD, author = "M. Picquendar and A. L. Rosenberg and V. Scarano", title = "A cost-effective streamlining of the {DIOGENES} design methodology", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "3", pages = "513--524", month = sep, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Comput. and Sci., Massachusetts Univ., Amherst, MA, USA", countrypub = "Singapore", keywords = "algorithmic cost; configuration; cost-effective streamlining; DIOGENES design methodology; fault tolerant computing; fault-tolerant layouts; hardware; interconnection network; multiprocessor interconnection; networks; NP-complete; queue; queue-based version; reconfigurable architectures; single generalized deletion; stack; VLSI processor arrays", treatment = "P Practical", } @Article{Cosnard:1995:ATG, author = "M. Cosnard and M. Loi", title = "Automatic task graph generation techniques", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "527--538", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", corpsource = "Lab. de l`Inf. du Parallelisme, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", keywords = "affine dependences; communication volume; computation model; directed acyclic task graphs; graph theory; parallel; parallel computation; parallel processing; parallel programming; parameterized; task graph; task graph generation; task graphs", treatment = "T Theoretical or Mathematical", } @Article{Ning:1995:ADC, author = "Qi Ning and V. {van Dongen} and G. R. Gao", title = "Automatic data and computation decomposition for distributed-memory machines", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "539--550", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", corpsource = "Centre de Recherche Informatique de Montreal, Montreal, Que., Canada", countrypub = "Singapore", keywords = "compile-time; computation; constraints; data decomposition; data locality; decomposition; distributed memory systems; distributed-memory machines; loop nests; loop parallelization; nesting levels; parallel programming; parallelising compilers; parallelizing compiler", treatment = "T Theoretical or Mathematical", } @Article{Darte:1995:RDK, author = "A. Darte and F. Vivien", title = "Revisiting the decomposition of {Karp}, {Miller} and {Winograd}", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "551--562", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4100 (Numerical analysis); C4240P (Parallel programming and algorithm theory)", corpsource = "CNRS URA, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", keywords = "computability; decomposition algorithm; linear programming; multi-dimensional schedules; multidimensional scheduling; null-weight cycles; parallel algorithms; uniform recurrence equations", treatment = "T Theoretical or Mathematical", } @Article{Gupta:1995:TGP, author = "V. Gupta and E. Schenfeld", title = "Task graph partitioning and mapping in a reconfigurable parallel architecture", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "563--574", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Binghamton, NY, USA", countrypub = "Singapore", keywords = "architecture; architectures; ICN; Interconnection Cached Network; mapping; multiprocessor interconnection networks; parallel; performance evaluation; performance gains; reconfigurable; reconfigurable network; reconfigurable parallel; task graph partitioning", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Lee:1995:SSP, author = "B. Lee and A. R. Hurson", title = "A strategy for scheduling partially ordered program graphs onto multicomputers", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "575--586", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", corpsource = "Dept. of Electr. and Comput. Eng., Oregon State Univ., Corvallis, OR, USA", countrypub = "Singapore", keywords = "BLS; communication; communication overhead; compile-time scheduling; inter-processor; massively parallel processing; message passing; message-passing multicomputer; multicomputers; parallel machines; parallel programming; parallelism; partially ordered program graphs; processor scheduling; program compilers; scalability; scheduling", treatment = "T Theoretical or Mathematical", } @Article{Ramaswamy:1995:SAS, author = "S. Ramaswamy and P. Banerjee", title = "Simultaneous allocation and scheduling using convex programming techniques", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "587--598", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C5440 (Multiprocessing systems); C6110 (Systems analysis and programming); C6150N (Distributed systems software)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", countrypub = "Singapore", keywords = "benchmark task graphs; convex programming; data parallelism; execution order; processor scheduling; representation; scheduling; simultaneous allocation; task analysis; task exploitation; task graph; two step approach", treatment = "P Practical", } @Article{Shirazi:1995:ESS, author = "B. Shirazi and Hee Yong Youn and D. M. Lorts", title = "Evaluation of static scheduling heuristics for real-time multiprocessing", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "599--610", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240C (Computational complexity); C5440 (Multiprocessing systems); C6150N (Distributed systems software)", corpsource = "Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA", countrypub = "Singapore", keywords = "computational complexity; directed acyclic graph; directed graphs; multiprocessing; NP-complete problem; processor scheduling; real-time; real-time systems; static scheduling heuristics evaluation; system; systems; weighted combinations", treatment = "P Practical", } @Article{Wolski:1995:SSH, author = "R. Wolski", title = "Static scheduling of hierarchical program graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "611--622", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C5440 (Multiprocessing systems); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San Diego, La Jolla, CA, USA", countrypub = "Singapore", keywords = "compilation systems; compile-time scheduling methodology; data flow computing; directed graphs; hierarchical program graphs; IFX intermediate form; optimising compilers; optimizing Sisal compiler; parallel; processor scheduling; scientific applications; single flat DAG representation; static scheduling", treatment = "P Practical", } @Article{Chu:1995:ETD, author = "Yung-Kang Chu and D. T. Rover", title = "An effective two-dimensional mesh partitioning strategy", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "623--634", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C6150N (Distributed systems software)", corpsource = "Dept. of Electr. Eng., Michigan State Univ., East Lansing, MI, USA", countrypub = "Singapore", keywords = "best-fit; job characteristics; mean response; mesh; mesh-connected; multiprocessor systems; parallel architectures; partitioning; performance evaluation; processor; processor allocation strategy; scheduling; simulations; submesh allocation strategy; time; two-dimensional mesh partitioning strategy", treatment = "P Practical", } @Article{Palis:1995:OSD, author = "M. A. Palis and Jing-Chiou Liou and S. Rajasekaran and S. Shende and D. S. L. Wei", title = "Online scheduling of dynamic trees", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "635--646", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessing systems); C6150N (Distributed systems software)", corpsource = "Dept. of Electr. and Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA", countrypub = "Singapore", keywords = "arbitrary; competitive ratio; distributed memory systems; dynamic tree-structured; dynamic trees; granularity; lower bound; online scheduling; parallel architectures; processor scheduling; task graphs", treatment = "P Practical", } @Article{Wang:1995:DSU, author = "Jhy-Chun Wang and Tseng-Hui Lin and S. Ranka", title = "Distributed scheduling of unstructured collective communication on the {CM-5}", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "647--658", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C6150N (Distributed systems software)", corpsource = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY, USA", countrypub = "Singapore", keywords = "CM-5; communication; distributed algorithm; distributed algorithms; distributed scheduling; parallel machines; parallelisation; performance; processor; scheduling; scientific applications; unstructured collective", treatment = "A Application; P Practical", } @Article{Wu:1995:PIS, author = "Min-You Wu", title = "Parallel incremental scheduling", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "659--670", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA", countrypub = "Singapore", keywords = "allocation; global load; information; load balancing; parallel algorithms; parallel incremental scheduling; processor scheduling; resource; system scheduling activity", treatment = "P Practical", } @Article{Chong:1995:MRS, author = "F. T. Chong and S. D. Sharma and E. A. Brewer and J. Saltz", title = "Multiprocessor runtime support for fine-grained, irregular {DAGs}", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "671--683", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C6150N (Distributed systems software)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", countrypub = "Singapore", keywords = "active-message; architectural support; CM-5; communication overhead; directed graphs; evaluation; execution schedules; graphs; Harwell-Boeing benchmark set; irregular directed acyclic; low-; lower latencies; multiprocessing systems; multiprocessor runtime support; network; overhead communication; performance; polling; precomputed data distributions; processor scheduling; scalable performance; sparse matrices; sparse-matrix; support", treatment = "A Application; P Practical", } @Article{Kumar:1995:CAP, author = "B. Kumar and K. Eswar and P. Sadayappan and C.-H. Huang", title = "A clustering algorithm for parallel sparse {Cholesky} factorization", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "4", pages = "685--696", month = dec, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4140 (Linear algebra); C5220P (Parallel architecture); C5440 (Multiprocessing systems)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", countrypub = "Singapore", keywords = "clustering algorithm; clustering heuristic; Cray T3D; distributed memory systems; factorization; fill-; heuristic programming; matrix reordering; multiprocessing systems; parallel sparse Cholesky; performance results; preserving reordering; sparse matrices", treatment = "P Practical", } @Article{Grayson:1996:HPP, author = "Brian Grayson and Robert {Van De Geijn}", title = "A high performance parallel {Strassen} implementation", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "3--12", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Texas at Austin", classification = "721.1; 722.1; 722.4; 723.2; 921.1; B0290H (Linear algebra); C4140 (Linear algebra); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Electr. and Comput. Eng., Texas Univ., Austin, TX, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithms; Computational complexity; computational complexity; Data storage equipment; high performance parallel Strassen implementation; Intel Paragon system; matrix; Matrix algebra; Matrix multiplication; matrix multiplication; multiplication; parallel; Parallel algorithms; Parallel processing systems; Response time (computer systems); Strassen method", treatment = "A Application; P Practical", } @Article{Djamegni:1996:SDA, author = "Clementin Tayou Djamegni and Maurice Tchuente", title = "Scheduling of the {DAG} associated with pipeline inversion of triangular matrices", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "13--26", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Faculte des Sciences", classification = "721.1; 722.1; 722.4; 921.1; 921.4; B6140 (Signal processing and detection); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C5260 (Digital signal processing)", corpsource = "Fac. des Sci., Dept. d`Inf., Yaounde, Cameroon", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Allocation function; Computational complexity; computational complexity; Computational methods; Dependence graph; dependence graph; directed array graphs; Graph theory; Inverse problems; linear systems; lower bound; Matrix algebra; Optimal timing functions; parallel algorithms; pipeline inversion; Pipeline processing systems; Scheduling; scheduling; signal processing; Systolic arrays; systolic arrays; time complexity; triangular matrices; Triangular matrix inversion", treatment = "P Practical", } @Article{Stojmenovic:1996:GNR, author = "Ivan Stojmenovic", title = "Generating $n$-ary reflected {Gray} codes on a linear array of processors", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "27--34", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Ottawa", classification = "722.1; 722.4; 723.1; 723.2; 921.4; B6120B (Codes); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Binary codes; Block codes; cost-optimal parallel algorithm; Data storage equipment; Gray codes; Linear array; linear array; linear array of; Mathematical models; n-ary reflected Gray codes generation; Parallel algorithms; parallel algorithms; Parallel processing systems; processors; Set theory", treatment = "P Practical", } @Article{Breslauer:1996:OPC, author = "Dany Breslauer and Ramesh Hariharan", title = "Optimal parallel construction of minimal suffix and factor automata", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "35--44", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Aarhus", classification = "721.1; 722.1; 722.4; 723.2; 921.5; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4220 (Automata theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Basic Res. in Comput. Sci., Aarhus Univ., Denmark", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "algorithms; data structure; Data structures; Factor automata; factor automata; Finite automata; finite automata; minimal suffix; minimisation; Online systems; optimal; optimal parallel algorithm; optimal parallel construction; optimisation; Optimization; parallel; parallel algorithm theory; Parallel algorithms; parallel suffix tree construction algorithm; Random access storage; smallest deterministic finite automata; string; string matching; Suffix tree; suffix tree; trees (mathematics)", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wu:1996:PSA, author = "Min-You Wu", title = "A parallel scheduling algorithm for tree structured interconnection networks", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "45--54", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "State Univ of New York at Buffalo", classification = "716.1; 721.1; 722.4; 723.2; C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150J (Operating systems); C6150N (Distributed systems software)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Data communication systems; Data structures; distributed memory systems; distributed processing; Electric network topology; global load; global parallel scheduling; interconnection network; Interconnection networks; load balancing; low-overhead; multiprocessing system; multiprocessing systems; parallel algorithm; Parallel algorithms; parallel algorithms; parallel processing; Parallel processing systems; parallel scheduling algorithm; processor; processor scheduling; resource allocation; runtime; Runtime load balancing; schedule work; Scheduling; scheduling; strategy; tree structured; Tree topology; tree topology", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Dikaiakos:1996:FAS, author = "Marios D. Dikaiakos and Anne Rogers and Kenneth Steiglitz", title = "Functional algorithm simulation of the fast multipole method: {Architectural} implications", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "55--66", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Washington", classification = "716.1; 721.1; 722.4; 723.2; 723.5; C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)C4240C (Computational complexity); C6150N (Distributed systems software)", corpsource = "Dept. of Astron., Washington Univ., Seattle, WA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "communication; communication characteristics; computation; computational complexity; Computational methods; computer architecture; Computer simulation; Data communication systems; Electric network topology; Fast multipole method; fast multipole method; Functional algorithm simulation; functional algorithm simulation; message-passing multiprocessor; Multiprocessing systems; multiring architecture; N-body problem solution; parallel; parallel algorithm; Parallel algorithms; parallel algorithms; patterns; processing; speedup; time", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Veglis:1996:MBA, author = "A. A. Veglis and A. S. Pombortsis", title = "Memory bandwidth analysis of shared-memory multiprocessors using dynamic request rate", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "67--74", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Aristotle Univ of Thessaloniki", classification = "716.1; 721.1; 722.1; 722.4; 921.6; 922.1; C6110P (Parallel programming); C6150N (Distributed systems software)", corpsource = "Dept. of Phys., Thessaloniki Univ., Greece", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "adjusted analytical model; Bandwidth; blocked request; bottleneck; Data communication systems; Data storage equipment; distributed memory system; Dynamic request rate; dynamic request rate; hierarchical; Hierarchical systems; hierarchy; Mathematical models; memory bandwidth analysis; message passing; multiprocessing; Multiprocessing systems; multiprocessor; multiprocessor system; performance; Probability; rate; Recursive functions; Rejection assumption; rejection assumption; Shared memory multiprocessors; shared memory system; shared memory systems; shared-memory multiprocessors; system", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kim:1996:FSL, author = "Geunmo Kim and Hyunsoo Yoon", title = "Free submesh list strategy: a best fit submesh allocation in mesh connected multicomputers", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "75--86", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Korea Advanced Inst of Science and Technology (KAIST)", classification = "716.1; 721.1; 722.4; 723.5; C6110P (Parallel programming); C6150N (Distributed systems software)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Taejon, South Korea", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "allocation request; best fit; complete submesh recognition capability; Computer simulation; Data communication systems; distributed processing; Electric network topology; fragmentation; Free submesh list; free submesh list strategy; Interconnection networks; mesh connected multicomputer; Mesh multicomputer; multiprocessing system; Multiprocessing systems; multiprocessing systems; potential; processor; Processor fragmentation; processor scheduling; request; scheduling; Submesh allocation; submesh allocation; submesh allocation problem", treatment = "P Practical", } @Article{Ben-Asher:1996:LCA, author = "Yosi Ben-Asher and Assaf Schuster", title = "Low crosstalk address encodings for optical message switching systems", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "87--100", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Haifa Univ", classification = "717.1; 722.4; 723.2; C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5270 (Optical computing techniques); C6110P (Parallel programming); C6150N (Distributed systems software)", corpsource = "Dept. of Math. and Comput. Sci., Haifa Univ., Israel", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Crosstalk; Data communication systems; distributed; distributed system; Encoding (symbols); input vectors; interconnection networks; low crosstalk address encoding; massively parallel system; message passing; message switching; multiplication; multiprocessor; Optical communication; optical computing; optical message switching system; parallel; parallel processing; Parallel processing systems; processing; programming; Sensitivity gap; sensitivity gap; Switching systems; Threshold devices; threshold operation; vector-matrix", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Hily:1996:GDM, author = "Andre Hily and Dominique Sotteau", title = "Gossiping in $d$-dimensional mesh-bus networks", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "101--113", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universit{\'e} de Paris-Sud", classification = "716.1; 721.1; 921.4; C4230M (Multiprocessor interconnection); C5620 (Computer networks and techniques); C6110P (Parallel programming); C6150N (Distributed systems software)", corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; bus; d-; Data communication systems; dimensional mesh-bus network; distributed processing; distributed system software; Electric network topology; forward communications; gossiping; Graph theory; Hypergraph model; interconnection; Interconnection networks; interconnection networks; Mathematical models; Mesh bus networks; message passing; minimum time bound; multiprocessor; processor interconnection; processor scheduling; Set theory; store", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ravishankar:1996:GRR, author = "Krishnamurthi Ravishankar and Suresh Singh", title = "Gossiping on a ring with radios", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "115--126", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "SUNY at New Paltz", classification = "716.3; 718.1; 903.2; 921; 921.4; C5620 (Computer networks and techniques); C6110P (Parallel programming); C6150N (Distributed systems software)", corpsource = "Dept. of Math. and Comput. Sci., SUNY, New Paltz, NY, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; asymptotically optimal time; circumference; distributed system; Gossiping; gossiping; Graph theory; Information dissemination; message passing; microprocessor interconnection; multiprocessing system; multiprocessing systems; n nodes; Nodes; Optimal time; processor; radio; Radio communication; Radio telephone; Radio transmission; radiocommunication; ring; scheduling; transmission range", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gu:1996:FTR, author = "Qian-Ping Gu and Shietung Peng", title = "Fault tolerant routing in hypercubes and star graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "127--136", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Aizu, Aizu-Wakamatsu", classification = "721; 722.4; 723.1; 921.4; C4230M (Multiprocessor interconnection); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Comput. Software, Aizu Univ., Fukushima, Japan", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; arbitrary fault nodes; computational complexity; Fault tolerant computer systems; fault tolerant computing; Fault tolerant routing; fault-free path; Graph theory; hypercube networks; Hypercubes; hypercubes; Interconnection networks; Linear time algorithms; linear time algorithms; multiprocessor interconnection networks; network routing; Node disjoint paths; node fault tolerant routing; node-to-; nodes; nonfault; parallel algorithms; Parallel processing systems; Routing path; Star grams; star graphs; Telecommunication traffic; time efficiency", treatment = "T Theoretical or Mathematical", } @Article{Koppelman:1996:LBA, author = "David M. Koppelman", title = "A lower bound on the average physical length of edges in the physical realization of graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "137--143", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Louisiana State Univ", classification = "721; 722.4; 921.4; 921.5; C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection)", corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "average; Average edge length; bounded vertex density; Cartesian space; Computational geometry; d-dimensional; de Bruijn graph; edge; exchange edges; graph; graph dimensions; Graph realization; Graph theory; graph theory; Interconnection networks; interconnection networks; length lower bound; Lower bound; multiprocessor interconnection networks; Optimization; Parallel processing systems; physical edge length; physical realization; position assignment; radix; realizations; shuffle edges; shuffle-exchange graphs; stereo-realization; vertices", treatment = "T Theoretical or Mathematical", } @Article{Darte:1996:COM, author = "Alain Darte and Michele Dion and Yves Robert", title = "A characterization of one-to-one modular mappings", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "145--157", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "CNRS", classification = "721; 722; 722.4; 723.1; 921.3; 921.6; C4140 (Linear algebra); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C6150C (Compilers, interpreters and other processors)", corpsource = "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "Algorithms; Cannon algorithms; Interconnection networks; Mathematical techniques; Mathematical transformations; matrix algebra; One to one modular mappings; one-to-one modular mapping characterisation; parallel algorithms; Parallel processing systems; parallel programming; parallelising compilers; source domain; Systolic arrays; systolic arrays; target domain; transformation", treatment = "T Theoretical or Mathematical", } @Article{Garcia:1996:UIP, author = "Jordi Garcia and Eduard Ayguad{\'e} and Jesus Labarta", title = "Using a $0$-$1$ integer programming model for automatic static data distribution", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "159--171", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Nov 09 06:54:30 1998", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Universitat Politecnica de Catalunya", classification = "721.1; 722.3; 722.4; 921; 921.4; 921.5; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240C (Computational complexity); C6110P (Parallel programming)C4240P (Parallel programming and algorithm theory); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", corpsource = "Dept. d`Arquitectura de Computadors, Univ. Politecnica de Catalunya, Barcelona, Spain", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "alignment problem; array; array dimensions; automatic static data; Automatic static data distribution; communication-parallelism graph; Compilation time; compilation time; computational complexity; Data communication systems; directed graphs; distributed; Distributed computer systems; Distributed memory processors; distribution; Functions; Graph theory; Integer programming; integer programming; layout; linear 0-1 integer programming model; Linear programming; linear programming; memory systems; Objective function; Optimization; Parallel processing systems; parallel programming; parallelising compilers; Parallelization; Problem solving; program execution; quality; references; Response time (computer systems); single optimization phase; solution; static array; total execution time minimisation", treatment = "T Theoretical or Mathematical", } @Article{Kaplow:1996:POB, author = "Wesley K. Kaplow and Boleslaw K. Szymanski", title = "Program optimization based on compile-time cache performance prediction", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "173--184", month = mar, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database", acknowledgement = ack-nhfb, affiliation = "Rensselaer Polytechnic Inst", classification = "722.1; 722.4; 723.1; 723.5; 921.5; 921.6; C5220P (Parallel architecture); C5320G (Semiconductor storage); C5470 (Performance evaluation and testing); C6110P (Parallel programming)C6150N (Distributed systems software); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "architecturally parameterized cache simulator; architectures; benchmarks; Buffer storage; Cache hit rates; cache hit-rates; Cache simulation; cache storage; compilation; Compile time method; compile-time cache performance prediction; compile-time optimization; compilers; Computer simulation; heuristic; Heuristic methods; IBM SP1 RS/6000; Intel i860; Iteration space blocking; iteration-; Iterative methods; loop nests; loop program optimizations; loop ranges; machines; optimisation; optimising compilers; Optimization; optimization; parallel; Parallel processing systems; parallel program; parallel programming; parallelising; Performance; performance evaluation; processor architectures; program; Program compilers; Program optimization; reference string; Scheduling; space blocking; subroutines; SuperSPARC; virtual", treatment = "P Practical", } @Article{Cosnard:1996:ENa, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "1", pages = "??--??", month = mar, year = "1996", bibdate = "Mon Nov 09 06:52:25 1998", URL = "http://www.ens-lyon.fr/PPL/vol6_1.html", acknowledgement = ack-nhfb, } @Article{JaJa:1996:ORP, author = "J. J{\'a}J{\'a} and Kwan Woo Ryu", title = "An optimal randomized parallel algorithm for the single function coarsest partition problem", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "187--193", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA", countrypub = "Singapore", keywords = "algorithms; coarsest partition problem; computational complexity; CRCW PRAM; CREW PRAM; Euler; optimal randomized parallel algorithm; parallel algorithms; randomised; rooted tree; single function; tour", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Galley:1996:OLN, author = "C. N. Galley", title = "An {$\Omega(\log n - k \log k)$} time linear cost lower bound for the $k$ functions coarsest partition problem", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "195--202", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Comput. Sci., King's Coll., London, UK", countrypub = "Singapore", keywords = "algorithms; computational complexity; computational geometry; CRCW PRAM model; k functions coarsest partition; linear cost lower bound; linear work; lower bound; parallel; problem", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Roch:1996:FPC, author = "J.-L. Roch and G. Villard", title = "Fast parallel computation of the {Jordan} normal form of matrices", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "203--212", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); C4140 (Linear algebra); C4240P (Parallel programming and algorithm theory)", corpsource = "Lab. LMC, IMAG, Grenoble, France", countrypub = "Singapore", keywords = "characteristic zero; fast parallel computation; finite field; Jordan normal form of matrices; matrix algebra; parallel algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ferragina:1996:TTP, author = "P. Ferragina and F. Luccio", title = "Three techniques for parallel maintenance of a minimum spanning tree under batch of updates", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "213--222", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", countrypub = "Singapore", keywords = "batch of; computational complexity; deletions; edge updates; EREW PRAM model; graph theory; insertions; minimum spanning tree; parallel algorithms; parallel maintenance; sparsification data structure; tree data structures; undirected graph; updates", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chaudhuri:1996:PCA, author = "S. Chaudhuri and Y. Dimopoulos and C. D. Zaroliagis", title = "On the parallel complexity of acyclic logic programs", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "223--230", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6110L (Logic programming); C6110P (Parallel programming)", corpsource = "Max-Planck-Inst. fur Inf., Saarbrucken, Germany", countrypub = "Singapore", keywords = "acyclic logic programs; complete; computational complexity; directed acyclic graph; directed graphs; logic; P-; parallel algorithms; parallel complexity; programming; stable model", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ben-Asher:1996:TTR, author = "Y. Ben-Asher and A. Schuster", title = "Time-size tradeoffs for reconfigurable meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "231--245", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5220 (Computer architecture)", corpsource = "Dept. of Math. and Comput. Sci., Haifa Univ., Israel", countrypub = "Singapore", keywords = "computing; directed reconfigurable mesh; mesh; parallel; parallel algorithms; polynomial size DRN-; reconfigurable architectures; reconfigurable meshes; time-size tradeoffs", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Armen:1996:DLE, author = "C. Armen and D. B. Johnson", title = "Deterministic leader election on the asynchronous {QRQW PRAM}", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "247--250", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Hartford Univ., West Hartford, CT, USA", countrypub = "Singapore", keywords = "algorithms; asynchronous QRQW PRAM; computational complexity; deterministic algorithm; deterministic algorithms; deterministic leader election; parallel", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Carruth:1996:PRM, author = "J. Allen Carruth and J. Misra", title = "Proof of a real-time mutual-exclusion algorithm", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "251--257", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C6110F (Formal methods)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", countrypub = "Singapore", keywords = "formal verification; invariant; real-time mutual-exclusion algorithm; technique; time-honored", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Singh:1996:BTP, author = "A. K. Singh", title = "Bounded timestamps in process networks", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "259--264", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", countrypub = "Singapore", keywords = "bounded timestamps; distributed algorithms; distributed systems; message-passing system; process networks; timestamps reusability", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Mizuno:1996:OPL, author = "M. Mizuno and M. L. Neilsen and M. Raynal", title = "An optimistic protocol for a linearizable distributed shared memory system", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "265--278", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6150M (Protocols); C5440 (Multiprocessing systems); C5640 (Protocols)", corpsource = "Dept. of Comput. and Inf. Sci., Kansas State Univ., Manhattan, KS, USA", countrypub = "Singapore", keywords = "abstraction; distributed memory systems; linearizability consistency criterion; linearizable distributed shared memory; optimistic protocol; protocols; shared memory; synchronisation; system; systems; write operation", treatment = "P Practical", } @Article{Grant-Duff:1996:PH, author = "Z. N. Grant-Duff and P. G. Harrison", title = "Parallelism via homomorphisms", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "279--295", month = jun, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110F (Formal methods); C6140D (High level languages)", corpsource = "Dept. of Comput., Imperial Coll. of Sci., Technol. and Med., London, UK", countrypub = "Singapore", keywords = "algorithms; decompression; first-come-first-served queue; formal specification; fractal-based algorithm; functional languages; high level functional language; homomorphisms; image; logarithmic parallel simulation; parallel; parallelism; server; single; specifications", treatment = "P Practical", } @Article{Cosnard:1996:ENb, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "2", pages = "??--??", month = jun, year = "1996", bibdate = "Mon Nov 09 06:52:25 1998", URL = "http://www.ens-lyon.fr/PPL/vol6_2.html", acknowledgement = ack-nhfb, } @Article{Iliopoulos:1996:OPS, author = "C. S. Iliopoulos and M. Korda", title = "Optimal parallel superprimitivity testing for square arrays", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "299--308", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput., King's Coll., London, UK", countrypub = "Singapore", keywords = "computational complexity; CRCW PRAM; optimal O(log log n) time algorithm; optimal parallel superprimitivity testing; parallel algorithms; quasiperiod; square arrays", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Destri:1996:BLA, author = "G. Destri and P. Marenzoni", title = "Benchmarking lattice-based applications on parallel architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "309--320", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1230D (Neural nets); C5220P (Parallel architecture); C5290 (Neural computing techniques); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing)", corpsource = "Dipartimento di Ingegneria dell'Inf., Parma Univ., Italy", countrypub = "Singapore", keywords = "algorithms; architectures; cellular neural nets; cellular neural network computational paradigm; Connection Machine CM-5; Cray T3D; grid problems; IBM SP2; information exchanges; lattice-based applications benchmarking; lattice-oriented; message passing; message passing version; network communication; numerical analysis; parallel; performance; performance analysis; performance evaluation; processing node; scalability; tests", treatment = "A Application; P Practical", } @Article{Furer:1996:PEC, author = "M. Furer and B. Raghavachari", title = "Parallel edge coloring approximation", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "321--329", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Comput. Sci. and Eng., Pennsylvania State Univ., University Park, PA, USA", countrypub = "Singapore", keywords = "colouring; computational complexity; computational geometry; CREW PRAM; degree; graph; maximal matching; maximum; parallel algorithms; parallel edge coloring approximation; vertices", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wang:1996:BAB, author = "Bung-Feng Wang", title = "A better analysis of {Ben-Asher}'s algorithm for the conditional {Cartesian} product problem", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "331--344", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan", countrypub = "Singapore", keywords = "algorithms; Ben-Asher's algorithm analysis; computational complexity; computational geometry; conditional Cartesian; lower bound; parallel; product problem; worst-case time complexity", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chung:1996:ITM, author = "Kuo-Liang Chung", title = "Image template matching on reconfigurable meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "345--353", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory); C5220 (Computer architecture); C5260B (Computer vision and image processing techniques)", corpsource = "Dept. of Inf. Manage., Nat. Taiwan Inst. of Technol., Taipei, Taiwan", countrypub = "Singapore", keywords = "architectures; connected computer; grey-scale; image; image processing; image template matching; mesh-; O(1) time algorithm; parallel algorithm; parallel algorithms; reconfigurable; reconfigurable bus system; reconfigurable meshes", treatment = "A Application; P Practical", } @Article{Bekakos:1996:CST, author = "M. P. Bekakos and O. B. Efremides", title = "A class of systolic tridiagonal linear solvers", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "355--364", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); B1265B (Logic circuits); B2570 (Semiconductor integrated circuits); C4140 (Linear algebra); C5120 (Logic and switching circuits); C5220P (Parallel architecture)", corpsource = "Dept. of Inf., Athens Sch. of Econ. and Bus. Sci., Greece", countrypub = "Singapore", keywords = "3D; architectural; concurrent backward and; design; forward complete solution; main diagonal redirection; matrix algebra; Mesh(d) topology; multiple pipes arrangement; systolic arrays; systolic cells; systolic tridiagonal linear solvers; technique; VLSI; VLSI systolic processor arrays", treatment = "A Application; P Practical", } @Article{Claver:1996:SDL, author = "J. M. Claver and V. Hernandez and E. S. Quintana", title = "Solving discrete-time {Lyapunov} equations for the {Cholesky} factor on a shared memory multiprocessor", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "365--376", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); C4140 (Linear algebra); C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C7310 (Mathematics computing)", corpsource = "Dpto. de Inf., Univ. Jaume I, Castellon, Spain", countrypub = "Singapore", keywords = "algorithms; antidiagonal wavefront; Cholesky factor; column-block-oriented algorithm; discrete-time Lyapunov equations; equations; Hammarling's method; large order; Lyapunov matrix equations; mathematics computing; memory multiprocessor; parallel; parallel algorithms; parallel solution; shared; shared memory systems; wrap-around algorithms", treatment = "A Application; P Practical", } @Article{Fernandes:1996:RIN, author = "R. Fernandes and A. Kanevsky", title = "On recursive interconnection networks and their extensions", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "377--388", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C5220P (Parallel architecture); C5440 (Multiprocessing systems)", corpsource = "Knowledge Based Syst. Inc., College Station, TX, USA", countrypub = "Singapore", keywords = "interconnection network; message locality; message passing; multiprocessor interconnection networks; network structure; pyramid-like; recursive interconnection networks; WK-recursive", treatment = "P Practical", } @Article{Nicol:1996:BPK, author = "D. M. Nicol and Weizhan Mao", title = "On bottleneck partitioning of $k$-ary $n$-cubes", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "389--399", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection); C4260 (Computational geometry); C5220P (Parallel architecture); C5440 (Multiprocessing systems)", corpsource = "Coll. of William and Mary, Williamsburg, VA, USA", countrypub = "Singapore", keywords = "bottleneck partitioning; communication cost; communication costs; computational geometry; cost; graph nodes; graph partitioning; graph theory; interconnection networks; k-ary n-cubes; maximal processor; multiprocessor; parallel processing; partition quality; uniformly weighted nodes", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Xue:1996:GUA, author = "Jingling Xue", title = "Generalising the unimodular approach to restructure imperfectly nested loops", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "401--414", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Math. Stat. and Comput. Sci., New England Univ., Armidale, NSW, Australia", countrypub = "Singapore", keywords = "affine constraints; code; generate-and-test approach; generation algorithm; imperfectly nested; iteration space; iteration vector; lexicographic order; loops; parallelising compilers; perfect loop nests; preorder tree; transformations; tree data structures; unimodular; unimodular approach generalisation", treatment = "P Practical; T Theoretical or Mathematical", } @Article{LeGuyadec:1996:SPD, author = "Y. {Le Guyadec} and B. Virot", title = "Sequential-like proofs of data-parallel programs", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "415--426", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "Lab. d'Inf. Fondamentale, Orleans Univ., France", countrypub = "Singapore", keywords = "conditioning constructs; control transfers; data-parallel break; data-parallel languages; formal logic; formal specification; non-local; parallel languages; parallel programming; proof system; sequential Hoare Logic; theorem proving", treatment = "T Theoretical or Mathematical", } @Article{Jard:1996:ITD, author = "C. Jard and G.-V. Jourdan", title = "Incremental transitive dependency tracking in distributed computations", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "3", pages = "427--435", month = sep, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 09:48:53 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "IRISA, Rennes, France", countrypub = "Singapore", keywords = "causal dependency; dependency tracking technique; direct; distributed algorithms; distributed computations; distributed program behaviours; program diagnostics; transitive dependency tracking", treatment = "T Theoretical or Mathematical", } @Article{Pal:1996:OPA, author = "M. Pal and G. P. Bhattacharjee", title = "An optimal parallel algorithm to color an interval graph", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "439--449", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Math., Indian Inst. of Technol., Kharagpur, India", keywords = "computational geometry; EREW PRAM; graph colouring; interval graph coloring; optimal parallel algorithm; optimisation; parallel algorithms", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Chen:1996:FEO, author = "D. Z. Chen and Xiaobo Hu", title = "Fast and efficient operations on parallel priority queues", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "451--467", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C1140C (Queueing theory); C4240P (Parallel programming and algorithm theory); C6120 (File organisation); C6150N (Distributed systems software)", corpsource = "Dept. of Comput. Sci. and Eng., Notre Dame Univ., IN, USA", keywords = "commonly used heap structures; data items; data structures; efficient operations; EREW PRAM; meldable parallel heaps; minimal path partition; optimal parallel algorithms; parallel algorithms; parallel computational model; parallel heap structures; parallel operations; parallel priority queues; partition schemes; PPQ data structure; queueing theory; random-access storage; real valued keys; right path partition; sequential operations", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Kwai:1996:GHN, author = "Ding-Ming Kwai and B. Parhami", title = "A generalization of hypercubic networks based on their chordal ring structures", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "469--477", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection)", corpsource = "Dept. of Electr. and Comput. Eng., California Univ., Santa Barbara, CA, USA", keywords = "chordal ring structures; chordal rings; cube-connected cycles; generalization; graph theory; hypercube networks; hypercubic networks; multiprocessor interconnection networks; periodic connection patterns; pruning strategy", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Srimani:1996:SRI, author = "P. K. Srimani", title = "Super rotator: incrementally extensible directed network graph of sublogarithmic diameter", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "479--490", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4230M (Multiprocessor interconnection); C5470 (Performance evaluation and testing)", corpsource = "Colorado State Univ., Fort Collins, CO, USA", keywords = "directed graphs; directed interconnection network graphs; fault tolerant; fault tolerant computing; interconnection network; multiprocessor interconnection networks; network graph; sublogarithmic diameter; Super Rotator", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Cachera:1996:PDP, author = "D. Cachera and G. Utard", title = "Proving data-parallel programs: a unifying approach", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "491--505", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6110F (Formal methods)", corpsource = "LIP, CNRS, Lyon, France", keywords = "assertion language; assertions; completeness; complexity; computational complexity; data-parallel languages; data-parallel programs; Definability Property; parallel programming; program verification; proof system; weakest precondition calculus", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{DiazDeCerio:1996:CPH, author = "L. {Diaz De Cerio} and A. Gonzalez and M. Valero-Garcia", title = "Communication pipelining in hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "507--523", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture)", corpsource = "Dept. d'Arquitectura de Computadors, Univ. Politecnica de Catalunya, Barcelona, Spain", keywords = "communication complexity; communication overhead; communication pipelining; FFT computation; hypercube communication topology; hypercube interconnection topology; hypercube networks; hypercubes; interconnection bandwidth; multicomputer; parallel algorithms; parallel architectures; pipeline processing; pipelining", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Herrmann:1996:SMC, author = "C. Herrmann and C. Lengauer", title = "On the space-time mapping of a class of divide-and-conquer recursions", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "525--537", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory)", corpsource = "Fakultat fur Math. und Inf., Passau Univ., Germany", keywords = "computational complexity; divide-and-conquer; divide-and-conquer recursions; functional program skeleton; geometric computational model; message-passing; parallel algorithms; parallel implementation; parallelizing nested loops; polytope model; recursive functions; space-time mapping", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Scheiman:1996:PDR, author = "C. Scheiman and P. Cappello", title = "A processor-time-minimal design for {3D} rectilinear mesh algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "539--550", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", keywords = "3D rectilinear mesh algorithms; computational complexity; directed acyclic graph; directed graphs; directed mesh; lower bounds; parallel algorithms; precedence constrained multiprocessor schedules; processor scheduling; processor-time-minimal design; skewed cylinder; systolic array; systolic arrays; three dimensional rectilinear mesh algorithms; time-minimal multiprocessor schedules; topology; two dimensional mesh", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Gupta:1996:AES, author = "A. K. Gupta and G. W. Greenwood", title = "Applications of evolutionary strategies to fine-grained task scheduling", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "551--561", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems)", corpsource = "Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA", keywords = "butterflies; dilation; evolutionary strategies; fine-grained task scheduling; forests; genetic algorithms; graph theory; heuristic embedding technique; heuristic programming; hypercube networks; hypercubes; parallel algorithms; processor scheduling; schedule length; task graphs; trees; trees (mathematics)", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Lee:1996:TSF, author = "Bu-Sung Lee and A. Heng and W. Cai and Tai-Ann Tan", title = "Task scheduling facility for {PVM}", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "563--574", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C6110B (Software engineering techniques); C6150N (Distributed systems software)", corpsource = "Sch. of Appl. Sci., Nanyang Technol. Univ., Singapore", keywords = "centralized task scheduler; client server system; client-server systems; design issue; heterogeneous computer systems; library routines; load balancing; parallel machines; Parallel Virtual Machine; PVM; resource allocation; round-robin task allocation scheme; scheduling; software libraries; software portability; task scheduling; virtual machines; virtual metacomputer; workstations", pubcountry = "Singapore", treatment = "P Practical", } @Article{Siegelmann:1996:NSC, author = "H. T. Siegelmann", title = "On {NIL}: the software constructor of neural networks", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "575--582", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C5290 (Neural computing techniques); C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6170K (Knowledge engineering techniques)", corpsource = "Fac. of Ind. Eng. and Manage., Technion-Israel Inst. of Technol., Haifa, Israel", keywords = "analog computation; analog recurrent neural networks; automatic learning; compiler; computation time; computational complexity; computer algorithm; convergence time; dynamical continuous learning; high level language; high level languages; knowledge representation; learning (artificial intelligence); Neural Information Processing Programming Language; NIL; program compilers; programming tool; recurrent neural nets; rule-based system; symbol manipulation; symbolic computation; symbolic knowledge representation; user friendly", pubcountry = "Singapore", treatment = "P Practical", } @Article{Ambroise:1996:MTA, author = "D. Ambroise and B. Rozoy", title = "Marrella: a tool to analyse the graph of states", journal = j-PARALLEL-PROCESS-LETT, volume = "6", number = "4", pages = "583--594", month = dec, year = "1996", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Univ. de Paris-Sud, Orsay, France", keywords = "concurrent programs; event structure; event structures; generalized traces; graph of states; graph theory; Marrella tool; memory; model checking; optimal algorithm; parallel algorithms; parallel programming; partial orders; program verification; reachability analysis; reachability graphs; software tools; time; traces", pubcountry = "Singapore", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Anonymous:1997:ENa, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "1--??", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Lingas:1997:SOP, author = "Andrzej Lingas and Anil Maheshwari", title = "A simple optimal parallel algorithm for reporting paths in a tree", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "3--11", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden", keywords = "computational complexity; distinct nodes; EREW PRAM; exclusive read exclusive write parallel random-access machine; input tree; n-node tree; optimal parallel algorithm; parallel algorithms; reporting paths; tree data structures", pubcountry = "Singapore", treatment = "P Practical; T Theoretical or Mathematical", } @Article{De:1997:FPM, author = "Mallika De and Bhabani P. Sinha", title = "Fast parallel multiplication using redundant quarternary number system", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "13--23", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5230 (Digital arithmetic methods)", corpsource = "Univ. Sci. Instrum. Centre, Kalyani Univ., West Bengal, India", keywords = "adders; AT-value; high-speed VLSI multiplication scheme; integer multiplication; m-digit multiplier; multiplying circuits; parallel algorithms; parallel multiplication; redundant number systems; redundant quarternary adders; redundant quarternary number system; redundant radix-4 representation; regular cellular array structure", pubcountry = "Singapore", treatment = "A Application; P Practical", } @Article{Zaroliagis:1997:SWP, author = "Christos D. Zaroliagis", title = "Simple and work-efficient parallel algorithms for the minimum spanning tree problem", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "25--37", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Max-Planck-Inst. fur Inf., Saarbrucken, Germany", keywords = "COMMON CRCW PRAM; computational geometry; EREW PRAM; minimum spanning tree problem; parallel algorithms; trees (mathematics); work-efficient parallel algorithms", pubcountry = "Singapore", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Flammini:1997:HDI, author = "Michele Flammini", title = "On the hardness of devising interval routing schemes", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "39--47", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Tue Oct 21 18:27:39 MDT 1997", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240C (Computational complexity); C5220P (Parallel architecture)", corpsource = "L'Aquila Univ., Italy", keywords = "computational complexity; INMOS transputer router chips; interval routing schemes; minimal space k-IRS; multiprocessor interconnection networks; NP-complete; time complexity", pubcountry = "Singapore", treatment = "P Practical", } @Article{Ashir:1997:ECA, author = "Yaagoub A. Ashir and Iain A. Stewart", title = "On Embedding Cycles in $k$-Ary $n$-Cubes", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "49--55", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Univ. of Wales, Swansea, UK", keywords = "efficient algorithm; embedding cycles; hypercube networks; k-ary n-cubes; parallel algorithms", pubcountry = "Singapore", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Rescigno:1997:FTP, author = "Adele Anna Rescigno", title = "Fault-Tolerant Parallel Communication in the Star Network", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "57--68", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5470 (Performance evaluation and testing); C5640 (Protocols)", corpsource = "Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy", keywords = "fault tolerant computing; fault-tolerant parallel communication; fault-tolerant parallel routing; fault-tolerant randomised routing algorithm; information dispersal algorithm; multiprocessor interconnection networks; packets; parallel algorithms; protocol; protocols; star network", pubcountry = "Singapore", treatment = "P Practical", } @Article{Malinowski:1997:EBA, author = "Adam Malinowski", title = "Efficient {Byzantine} Agreement in Networks with Random Faults", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "69--76", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5640 (Protocols); C6150N (Distributed systems software)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", keywords = "Byzantine agreement; distributed processing; fault tolerant computing; fault-tolerance; protocols; random faults; synchronous network; time-optimal agreement protocol", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Latifi:1997:REB, author = "Shahram Latifi and Ramesh Gajjala", title = "Reliability Evaluation of Braided Networks Using a Recursive Method", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "77--88", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C5470 (Performance evaluation and testing); C5670 (Network performance)", corpsource = "Dept. of Electr. and Comput. Eng., Nevada Univ., Las Vegas, NV, USA", keywords = "braided networks; Braided-Line networks; computer network reliability; global reliability; network topology; recursive method; recursive techniques; reliability; reliability measure", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Brecht:1997:CDM, author = "Timothy Brecht and Xiaotie Deng and Nian Gu", title = "Competitive Dynamic Multiprocessor Allocation for Parallel Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "89--100", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C6150J (Operating systems); C6150N (Distributed systems software)", corpsource = "Dept. of Comput. Sci., York Univ., North York, Ont., Canada", keywords = "competitive algorithms; competitive analysis; competitive scheduling; multiprocessor allocation; parallel applications; parallel job; parallel jobs; parallel processing; parallel tasks; preemption; preemptive scheduling; processor scheduling; reallocation; resource allocation", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Bodeveix:1997:TAV, author = "J.-P. Bodeveix and M. Filali", title = "Towards the Automatic Verification of Atomic Memory Protocols", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "1", pages = "101--112", month = mar, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C5640 (Protocols)", corpsource = "IRIT, Univ. Paul Sabatier, Toulouse, France", keywords = "atomic memory protocols; automatic verification; cache protocols; formal logic; memory consistency protocols; memory protocols; refinements; S1S decidable logic; theorem proving; transition systems; validation", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1997:ENb, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "113--??", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Collard:1997:ADA, author = "Jean-Fan{\c{c}}ois Collard and Martin Griebl", title = "Array Dataflow Analysis for Explicitly Parallel Programs", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "117--131", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150N (Distributed systems software)", conflocation = "Wadern, Germany; April 1996", conftitle = "Fundamental Aspects of Parallel Processing", corpsource = "Lab. PRISM, CNRS, Versailles, France", keywords = "array data flow analysis; array data structures; control-parallel imperative languages; data flow analysis; data flow equations; data structures; data-parallel imperative languages; explicitly parallel programs; integer linear programming; integer programming; linear programming; parallel languages; parallel programming; parallel programming paradigms", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Darte:1997:PNL, author = "Alain Darte and Fr{\'e}d{\'e}ric Vivien", title = "Parallelizing nested loops with approximation of distance vectors: a survey", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "133--144", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", conflocation = "Wadern, Germany; April 1996", conftitle = "Fundamental Aspects of Parallel Processing", corpsource = "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France", keywords = "dependence analysis; distance vector approximation; nested loop parallelization algorithms; optimality; parallel algorithms; parallelising compilers; subroutines", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Gupta:1997:SAR, author = "Manish Gupta and Edith Schonberg", title = "Static Analysis to Reduce Synchronization Costs Data-Parallel Programs with Remote Memory Copy", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "145--156", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150N (Distributed systems software)", conflocation = "Wadern, Germany; April 1996", conftitle = "Fundamental Aspects of Parallel Processing", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", keywords = "communication analysis; compiled programs; computation patterns; data consumption; data flow analysis; data production; data-parallel programs; efficient execution; flexible cache-coherence protocol; HPF benchmark programs; multiple data transfers; parallel algorithms; parallel programming; parallelising compilers; parallelism; processors; reciprocal producer-consumer relationship; reductions; redundant synchronization; remote memory copy; shared memory machines; shared memory systems; SPMD execution; static analysis; stencil computations; synchronisation; synchronization cost reduction; synchronization messages", pubcountry = "Singapore", treatment = "P Practical", } @Article{Lam:1997:OCM, author = "Chi-Chung Lam and P. Sadayappan and Rephael Wenger", title = "On Optimizing a Class of Multi-Dimensional Loops with Reduction for Parallel Execution", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "157--168", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C6150C (Compilers, interpreters and other processors); C7320 (Physics and chemistry computing)", conflocation = "Wadern, Germany; April 1996", conftitle = "Fundamental Aspects of Parallel Processing", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", keywords = "associativity; communication requirements; commutativity; compile-time optimization; computational physics; minimisation; multidimensional loops optimisation; multidimensional surface; nested-loop computation; NP-completeness; operation minimization problem; optimising compilers; parallel execution; physics computing; polynomial-time algorithm; pruning search strategy; volume integrals", pubcountry = "Singapore", treatment = "A Application; P Practical", } @Article{Lee:1997:MMD, author = "Hyuk-Jae Lee and Jos{\'e} A. B. Fortes", title = "Modular Mappings and Data Distribution Independent Computations", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "169--180", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", conflocation = "Wadern, Germany; April 1996", conftitle = "Fundamental Aspects of Parallel Processing", corpsource = "Dept. of Comput. Sci., Louisiana Tech. Univ., Ruston, LA, USA", keywords = "Cannon's algorithm; data distribution independent computations; distributed memory parallel computers; execution time; functionality; functionally equivalent programs; initial data redistribution overheads; matrix-matrix multiplication; modular mappings; optimising compilers; parallel programming", pubcountry = "Singapore", treatment = "P Practical", } @Article{Quinton:1997:MPU, author = "Patrice Quinton and Sanjay Rajopadhye and Tanguy Risset", title = "On Manipulating {$Z$}-Polyhedra Using a Canonical Representation", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "181--194", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", conflocation = "Wadern, Germany; April 1996", conftitle = "Fundamental Aspects of Parallel Processing", corpsource = "IRISA, Rennes, France", keywords = "automatic parallelization; canonical representation; computation; computational kernel; high level synthesis; integer programming; integral lattices; linear programming; parallel algorithms; parallelising compilers; program control structures; program loops; VLSI; VLSI array synthesis; Z-polyhedra manipulation", pubcountry = "Singapore", treatment = "T Theoretical or Mathematical", } @Article{Venkatachar:1997:CGB, author = "A. Venkatachar and J. Ramanujam and A. Thirumalai", title = "Communication Generation for Block-Cyclic Distributions", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "195--202", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", conflocation = "Wadern, Germany; April 1996", conftitle = "Fundamental Aspects of Parallel Processing", corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA", keywords = "alignment; block-cyclic distributions; code generation; communication generation; compiler; data-parallel languages; distributed memory systems; distributed-memory multiprocessor; FORTRAN; Fortran D; High Performance Fortran; local memory addresses; nonlocal data access; parallel algorithms; parallel languages; parallel programming; program compilers; storage allocation; Vienna Fortran", pubcountry = "Singapore", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wilde:1997:MRA, author = "D. Wilde and S. Rajopadhye", title = "Memory Reuse Analysis in the Polyhedral Model", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "2", pages = "203--215", month = jun, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", conflocation = "Wadern, Germany; April 1996", conftitle = "Fundamental Aspects of Parallel Processing", corpsource = "Dept. of Electr. Eng., Brigham Young Univ., Provo, UT, USA", keywords = "affine recurrence equations; ALPHA; compiler; functional data-parallel language; functional languages; functional programming; memory reuse analysis; multiple assignment code; parallel languages; parallel programming; polyhedral model; program compilers; program variables; scheduled single-assignment code; scheduling; storage allocation", pubcountry = "Singapore", treatment = "P Practical", } @Article{Cosnard:1997:EN, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "217--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Nov 09 08:05:00 1998", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Rajasekaran:1997:DRA, author = "Sanguthevar Rajasekaran and Sartaj Sahni", title = "Deterministic Routing on the Array with Reconfigurable Optical Buses", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "219--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Panaite:1997:RPG, author = "Petri{\c{s}}or Panaite", title = "Routing Permutations on a {$2$D} Grid with One-Way Edges", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "225--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Boari:1997:RSO, author = "Maurelio Boari and Antonioo Corradi and Letizia Leonardi", title = "A Routing Strategy for Object-Oriented Applications in Massively Parallel Architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "237--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Spirakis:1997:PGH, author = "Paul Spirakis and Vassilis Triantafillou", title = "Pure Greedy Hot-Potato Routing in the {$2$-D} Mesh with Random Destinations", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "249--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Hwang:1997:PRA, author = "F. K. Hwang and Tzai-Shunne Lin and Rong-Hong Jan", title = "A Permutation Routing Algorithm for Double Loop Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "259--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Greenberg:1997:PAS, author = "Ronald I. Greenberg and Shih-Chuan Hung and Jau-Der Shih", title = "Parallel Algorithms for Single-Layer Channel Routing", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "267--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Chang:1997:ASB, author = "Chihming Chang and Rami Melhem", title = "Arbitrary Size {Benes} Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "279--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Kim:1997:REH, author = "Jin S. Kim and Seung Ryoul Maeng and H. Yoon", title = "Ring Embedding in Hypercubes with Faculty Nodes", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "285--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Hirschberg:1997:DCP, author = "Daniel S. Hirschberg and Lynn M. Stauffer", title = "Dictionary Compression on the {PRAM}", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "297--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Badache:1997:GDC, author = "Nadjib Badache and Aomar Maddi", title = "Gradual Design of a Causal Broadcast Protocol", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "309--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Papatriantafilou:1997:SSW, author = "Marina Papatriantafilou and Philippas Tsigas", title = "On Self-Stabilizing Wait-Free Clock Synchronization", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "321--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Uncover database", acknowledgement = ack-nhfb, } @Article{Debbabi:1997:MBC, author = "Maurad Debbabi", title = "A Model-Based Concurrent Specification Language over {CML}: Semantic Foundations", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "3", pages = "329--??", month = sep, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "Uncover database; http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, xxauthor = "M. Debbadi", } @Article{Anonymous:1997:ENd, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "4", pages = "357--??", month = dec, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Yuan:1997:DDD, author = "Xin Yuan and Rajiv Gupta and Rami Melhem", title = "Demand-Driven Data Flow Analysis for Communication Optimization", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "4", pages = "359--??", month = dec, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Kremer:1997:ONO, author = "Ulrich Kremer", title = "Optimal and Near--Optimal Solutions for Hard Compilation Problems", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "4", pages = "371--??", month = dec, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Darte:1997:CRS, author = "Alain Darte and Georges-Andr{\'e} Silber and Fr{\'e}d{\'e}ric Vivien", title = "Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "4", pages = "379--??", month = dec, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Kaplow:1997:CTC, author = "Wesley K. Kaplow and Boleslaw K. Szymanski", title = "Compile-Time Cache Performance Prediction and Its Application to Tiling", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "4", pages = "393--??", month = dec, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Xue:1997:TLT, author = "Jingling Xue", title = "On Tiling as a Loop Transformation", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "4", pages = "409--??", month = dec, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Paek:1997:CSM, author = "Yunheung Paek and David A. Padua", title = "Compiling for Scalable Multiprocessors with {Polaris}", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "4", pages = "425--??", month = dec, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Schreiber:1997:HPF, author = "Robert Schreiber", title = "{High Performance Fortran, Version 2}", journal = j-PARALLEL-PROCESS-LETT, volume = "7", number = "4", pages = "437--??", month = dec, year = "1997", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:33 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1998:ENa, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "1--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Coffman:1998:NLP, author = "E. G. {Coffman, Jr.} and S. Even", title = "A Note on Limited Preemption", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "3--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Dolev:1998:OTS, author = "Shlomi Dolev", title = "Optimal Time Self-Stabilization in Uniform Dynamic Systems", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "7--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Vajnovszki:1998:PAL, author = "Vincent Vajnovszki and Jean Pallo", title = "Parallel Algorithms for Listing Well-Formed Parentheses Strings", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "19--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Raghavan:1998:EPS, author = "Padma Raghavan", title = "Efficient Parallel Sparse Triangular Solution Using Selective Inversion", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "29--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Chen:1998:IPB, author = "Yung-Syau Chen and Jean-Luc Gaudiot", title = "Implementing Parallel Branch-and-Bound with Extended {Sisal 2.0}", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "41--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Brunie:1998:MPR, author = "Lionel Brunie and Harald Kosch and Wolfgang Wohner", title = "From the Modeling of Parallel Relational Query Processing to Query Optimization and Simulation", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "51--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Mattes:1998:PIP, author = "J. Mattes and D. Trystram and J. Demongeot", title = "Parallel Image Processing Using Neural Networks: Applications in Contrast Enhancement of Medical Images", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "63--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Izadi:1998:OSA, author = "Baback A. Izadi and F{\"u}sun {\"O}zg{\"u}ner", title = "Optimal Subcube Allocation in a Circuit-Switched Faulty Hypercube", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "77--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Michail:1998:OBS, author = "Amir Michail", title = "Optimal Broadcast and Summation on Hierarchical Ring Architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "83--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Prylli:1998:EDS, author = "L. Prylli and B. Tourancheau", title = "Execution-Driven Simulation of Parallel Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "95--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Ramesh:1998:ISP, author = "S. Ramesh and Chandrashekhar M. Shetty", title = "Impossibility of Synchronization in the Presence of Preemption", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "111--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Datta:1998:SSA, author = "Ajoy K. Datta and Teofilo F. Gonzalez and Visalakshi Thiagarajan", title = "Self-Stabilizing Algorithms for Tree Metrics", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "1", pages = "121--??", month = mar, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1998:ENb, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "135--??", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Liestman:1998:MAT, author = "Arthur L. Liestman and Nata{\v{s}}a Pr{\v{z}}ulj", title = "Minimum Average Time Broadcast Graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "139--147", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Simon Fraser Univ", affiliationaddress = "Burnaby, BC, Can", classification = "721.1; 921; 921.4", journalabr = "Parallel Process Lett", keywords = "Constraint theory; Graph theory; Minimum average time broadcast graphs; Theorem proving", } @Article{Harutyunyan:1998:MB, author = "Hovhannes A. Harutyunyan and Arthur L. Liestman", title = "Messy Broadcasting", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "149--159", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Simon Fraser Univ", affiliationaddress = "Barnaby, BC, Can", classification = "921; 921.4", journalabr = "Parallel Process Lett", keywords = "Boundary conditions; Butterfly graphs; Cube-connected cycles; DeBruijn graphs; Mathematical models; Messy broadcasting time; Shuffle-exchange graphs; Theorem proving; Trees (mathematics)", } @Article{Peters:1998:GCC, author = "Joseph G. Peters and Curtis C. Spencer", title = "Global Communication on Circuit-Switched Toroidal Meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "161--175", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Simon Fraser Univ", affiliationaddress = "Burnaby, BC, Can", classification = "716.1; 723; 921", journalabr = "Parallel Process Lett", keywords = "Algorithms; Broadcasting; Circuit-switched routing; Communication channels (information theory); Computer networks; Data communication systems; Global communication algorithms; Mathematical models; Routers; Torus networks; Virtual channels; Virtual reality", } @Article{Diks:1998:BUT, author = "Krzysztof Diks and Evangelos Kranakis and Andrzej Pelc", title = "Broadcasting in Unlabeled Tori", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "177--188", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Uniwersytet Warszawski", affiliationaddress = "Warszawa, Pol", classification = "703.1; 716; 716.3; 723", journalabr = "Parallel Process Lett", keywords = "Algorithms; Asynchronous totally unlabeled torus; Broadcasting; Broadcasting algorithms; Data communication systems; Electric network topology; Telecommunication networks", } @Article{Fujita:1998:NGH, author = "Satoshi Fujita and Stephane Perennes and Joseph G. Peters", title = "Neighbourhood Gossiping in Hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "189--195", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Hiroshima Univ", affiliationaddress = "Higashi-Hiroshima, Jpn", classification = "716; 723; 921", journalabr = "Parallel Process Lett", keywords = "Data communication systems; Hypercubes; Mathematical models; Neighborhood gossiping problems; Problem solving; Single-port half-duplex/full-duplex communication models; Telecommunication networks", } @Article{Hromkovic:1998:ESA, author = "Juraj Hromkovi{\v{c}} and Ralf Klasing and Dana Pardubsk{\'a} and Juraj Waczul{\'\i}k and Hubert Wagener", title = "Effective Systolic Algorithms for Gossiping in Cycles", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "197--205", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "RWTH Aachen", affiliationaddress = "Aachen, Ger", classification = "718.2; 721.1; 722.1; 722.4; 723; 903.2", journalabr = "Parallel Process Lett", keywords = "Computational complexity; Data communication systems; Information dissemination; One-way systolic gossip; Parallel processing systems; Systolic arrays; Telegraph", } @Article{Eilam:1998:CCP, author = "Tamar Eilam and Michele Flammini and Shmuel Zaks", title = "A Complete Characterization of the Path Layout Construction Problem for {ATM} Networks with Given Hop Count and Load", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "207--220", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Technion", affiliationaddress = "Haifa, Isr", classification = "716; 716.1; 721.1; 921; 921.1", journalabr = "Parallel Process Lett", keywords = "Asynchronous transfer mode; Computational complexity; Frequency hopping; High-speed networks; Maximum edge loads; Maximum hop count; Polynomials; Problem solving; Theorem proving; Virtual paths", } @Article{Rescigno:1998:HFT, author = "A. A. Rescigno and U. Vaccaro", title = "Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "221--230", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Universita di Salerno", affiliationaddress = "Baronissi, Italy", classification = "703.1; 716; 722.4; 921; 921.4", journalabr = "Parallel Process Lett", keywords = "Electric network topology; Failure analysis; Fault tolerant computer systems; Fault tolerant routing; Graph theory; Interconnection networks; Routers; Star/hypercube interconnection networks", } @Article{Rottger:1998:EDG, author = "Markus R{\"o}ttger and Ulf-Peter Schroeder", title = "Embedding $2$-Dimensional Grids into Optimal Hypercubes with Edge-Congestion $1$ or $2$", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "231--242", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Paderborn", affiliationaddress = "Paderborn, Ger", classification = "716; 723; 921.4", journalabr = "Parallel Process Lett", keywords = "Congestion control (communication); Data communication systems; Embedded systems; Graph theory; Optimal hypercubes; Set theory; Two-dimensional grid embedding", } @Article{Ellis:1998:EGG, author = "John Ellis and Minko Markov", title = "Embedding {Grids} into {Grids}: Dilation Four Suffices", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "243--250", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Univ of Victoria", affiliationaddress = "Victoria, BC, Can", classification = "723; 723.2; 921; 921.4; 921.5", journalabr = "Parallel Process Lett", keywords = "Aspect ratio; Data compression; Embedded systems; Graph theory; Optimization; Problem solving; Two-dimensional grid graph embedding", } @Article{Krumme:1998:ODP, author = "David W. Krumme", title = "An Optimal Disjoint Pair of Additive Spanners for the {$3$D Grid}", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "251--258", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Tufts Univ", affiliationaddress = "Medford, MA, USA", classification = "722.4; 921; 921.4", journalabr = "Parallel Process Lett", keywords = "Additive spanners; Connected graphs; Functions; Graph theory; Infinite three dimensional grids; Optimal disjoint pairs; Parallel processing systems; Problem solving; Spanning connected subgraphs", } @Article{Andreae:1998:HBG, author = "Thomas Andreae and Martin Hintz", title = "On Hypercubes in {de Bruijn} Graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "259--268", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; Compendex database", acknowledgement = ack-nhfb, affiliation = "Universitaet Hamburg", affiliationaddress = "Hamburg, Ger", classification = "921; 921.4", journalabr = "Parallel Process Lett", keywords = "de Bruijn graphs; Graph theory; Hypercubes; Problem solving; Theorem proving", } @Article{Anonymous:1998:ITC, author = "Anonymous", title = "Instructions for typesetting camera-ready manuscripts using computer software", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "269--273", month = jun, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Nov 9 07:34:02 MST 1998", bibsource = "Compendex database", acknowledgement = ack-nhfb, classification = "722.4; 723; 745.1; 903.2", journalabr = "Parallel Process Lett", keywords = "Camera-ready manuscripts; Computer software; Parallel processing systems; Technical writing; Typesetting", } @Article{Comellas:1998:GPD, author = "F. Comellas and G. Gim{\'e}nez", title = "Genetic Programming to Design Communication Algorithms for Parallel Architectures", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "549--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", URL = "http://www-mat.upc.es/~comellas/genprog/genprog.html", acknowledgement = ack-nhfb, } @Article{Hofri:1998:MTM, author = "Micha Hofri and David L. Thomson", title = "Matrix Transposition on a Mesh with Blocking Transmissions", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "561--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Farley:1998:ORN, author = "Arthur M. Farley", title = "Optimally Routable Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "567--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Choi:1998:SDI, author = "Jong Hyuk Choi and Kyu Ho Park", title = "Segment Directory: An Improvement to the Pointer in Directory Cache Coherence Schemes", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "577--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Cholvi:1998:SBM, author = "Vicent Cholvi", title = "Specification of the Behavior of Memory Operations in Distributed Systems", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "589--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1998:AIV, author = "Anonymous", title = "Author Index Volume 8 (1998)", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "2", pages = "599--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1998:ENc, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "269--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1998:ENd, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "270--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Trahan:1998:TBC, author = "Jerry L. Trahan and Anu G. Bourgeois and Ramachandran Vaidyanathan", title = "Tighter and Broader Complexity Results for Reconfigurable Models", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "271--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Li:1998:SPA, author = "Yueming Li and Jianhui Tao and S. Q. Zheng", title = "A Symmetric Processor Array with Synchronous Optical Buses and Switches", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "283--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Hong:1998:NOB, author = "Tzung-Pei Hong and Jyh-Jong Lee", title = "A Nearly Optimal Back-Propagation Learning Algorithm on a Bus-Based Architecture", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "297--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Wu:1998:FTC, author = "Jie Wu", title = "Fault-Tolerant Communications in Cube-Based Multiple-Bus Systems", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "307--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Qiao:1998:IEB, author = "Chunming Qiao and Yousong Mei", title = "An Improved Embedding of Binary Trees in a Square Reconfigurable Array with Spanning Optical Buses", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "321--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Kim:1998:EBH, author = "Sook-Yeon Kim and Oh-Heum Kwon and Kyung-Yong Chwa", title = "Embeddings of Butterflies into Hypermeshes", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "337--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Murshed:1998:CTA, author = "M. Manzur Murshed and Richard P. Brent", title = "Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "351--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anand:1998:SAX, author = "Tarun Anand and Phalguni Gupta", title = "A Selection Algorithm for {$X + Y$} on Mesh", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "363--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Bermond:1998:HCD, author = "J.-C. Bermond and E. Darrot and O. Delmas and S. Perennes", title = "Hamilton Cycle Decomposition of the Butterfly Network", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "371--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Karpinski:1998:STP, author = "Marek Karpinski and Wojciech Rytter", title = "On a Sublinear Time Parallel Construction of Optimal Binary Search Trees", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "387--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Bampis:1998:PAF, author = "E. Bampis and A. Giannakos and A. Karzanov and Y. Manoussakis and I. Milis", title = "A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "399--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Evripidou:1998:MFP, author = "Paraskevas Evripidou and Robert Barry", title = "Mapping {Fortran} Programs to Single Assignment Semantics for Efficient Parallelization", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "3", pages = "407--??", month = sep, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1998:ENe, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "419--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Charpentier:1998:SVAa, author = "Michel Charpentier and G{\'e}rard Padiou", title = "Specification and Verification of the {ATMR} Protocol Using Unity Part 1: Modeling and Specification of the Protocal", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "421--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Charpentier:1998:SVAb, author = "Michel Charpentier and G{\'e}rard Padiou", title = "Specification and Verification of the {ATMR} Protocol Using Unity Part 2: Correctness Proof", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "433--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Gorlatch:1998:GMI, author = "Sergei Gorlatch and Holger Bischof", title = "A Generic {MPI} Implementation for a Data-Parallel Skeleton: Formal Derivation and Application to {FFT}", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "447--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Rus:1998:UMC, author = "Teodor Rus and Eric van Wyk", title = "Using Model Checking in a Parallelizing Compiler", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "459--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Sanders:1998:DAL, author = "Beverly A. Sanders and Berna L. Massingill and Svetlana Kryukova", title = "Derivation of an Algorithm for Location Management for Mobile Communication Devices", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "473--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Marsh:1998:NAH, author = "Andy Marsh", title = "A Novel Algorithm and its Hardware Support for the Run-Time Detection of And-Parallelism", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "489--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Hamdi:1998:CPA, author = "M. Hamdi and C. Qiao and Y. Pan", title = "On the Computing Power of Arrays of Processors with Optical Pipelined Buses", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "503--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Lecroq:1998:OPP, author = "Thierry Lecroq and Jean-Frederic Myoupo and David Seme", title = "A One-Phase Parallel Algorithm for the Sequence Alignment Problem", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "515--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Trevisan:1998:PCP, author = "Luca Trevisan and Fatos Xhafa", title = "The Parallel Complexity of Positive Linear Programming", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "527--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Marsh:1998:UPP, author = "Andy Marsh and Dimitra I. Kaklamani and Konstantinos Adam", title = "Using Parallel Processing as a Computational Tool to Solve Multi-Plate Electromagnetic Scattering Problems", journal = j-PARALLEL-PROCESS-LETT, volume = "8", number = "4", pages = "535--??", month = dec, year = "1998", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1999:ENa, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "1--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Dimakopoulos:1999:BT, author = "Vassilios V. Dimakopoulos and Nikitas J. Dimopoulos", title = "On Broadcasting Time", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "3--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Fraigniaud:1999:CHO, author = "Pierre Fraigniaud and Sandrine Vial", title = "Comparison of Heuristics for One-To-All and All-To-All Communications In Partial Meshes", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "9--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Sheu:1999:FDS, author = "Jyh-Jian Sheu and Lih-Hsing Hsu", title = "Fault Diameter for Supercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "21--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Maheshwari:1999:SOA, author = "Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack", title = "Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "31--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Hsieh:1999:EPA, author = "Sun-Yuan Hsieh and Chin-Wen Ho and Tsan-Sheng Hsu and Ming-Tat Ko and Gen-Huey Chen", title = "Efficient Parallel Algorithms on Distance Hereditary Graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "43--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Dinneen:1999:CTR, author = "Michael J. Dinneen and Jose A. Ventura and Mark C. Wilson and Golbon Zakeri", title = "Construction of Time-Relaxed Minimal Broadcast Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "53--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Gerbessiotis:1999:EDS, author = "Alexandros V. Gerbessiotis and Constantinos J. Siniolakis", title = "Efficient Deterministic Sorting on the {BSP} Model", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "69--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Delacourt:1999:CTP, author = "Emmanuel Delacourt and Jean-Frederic Myoupo and David Seme", title = "A Constant Time Parallel Detection of Repetitions", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "81--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Vajnovszki:1999:SGK, author = "Vincent Vajnovszki and Chris Phillips", title = "Systolic Generation of $k$-ary Trees", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "93--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Xiang:1999:DDB, author = "Limin Xiang and Kazuo Ushijima", title = "Decoding and Drawing on {BSR} for a Binary Tree from its {I-P} Sequence", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "103--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Das:1999:EPA, author = "Sajal K. Das and Paolo Ferragina", title = "An {EREW PARM} Algorithm for Updating Minimum Spanning Trees", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "111--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Garg:1999:NCC, author = "Vijay K. Garg and Michel Raynal", title = "Normality: {A} Consistency Condition for Concurrent Objects", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "123--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Agrawal:1999:DDA, author = "Gagan Agrawal", title = "Data Distribution Analysis for Irregular and Adaptive Codes", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "135--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Benner:1999:PDS, author = "Peter Benner and Jos{\'e} M. Claver and Enrique S. Quintana-Orti", title = "Parallel Distributed Solvers for Large Stable Generalized {Lyapunov} Equations", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "147--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Chong:1999:SMV, author = "Frederic T. Chong and Anant Agarwal", title = "Shared Memory Versus Message Passing for Iterative Solution of Sparse, Irregular Problems", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "1", pages = "159--??", month = mar, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1999:ENb, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "171--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Ferreira:1999:ORQ, author = "Renato Ferreira and Tahsin Kurc and Michael Beynon and Chialin Chang and Alan Sussman and Joel Saltz", title = "Object-Relational Queries into Multidimensional Databases with the Active Data Repository", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "173--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Boulet:1999:AIH, author = "Pierre Boulet and Jack Dongarra and Fabrice Rastello and Yves Robert and Fr{\'e}d{\'e}ric Vivien", title = "Algorithmic Issues on Heterogeneous Computing Platforms", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "197--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Hollingsworth:1999:BVM, author = "Jeffrey K. Hollingsworth and Ethan L. Miller and Kennedy Akala", title = "Binary Version Management for {Computational Grids}", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "215--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Wolski:1999:PCA, author = "Rich Wolski", title = "Predicting {CPU} Availability on the {Computational Grid} Using the {Network Weather Service}", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "227--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Larsson:1999:SME, author = "O. Larsson and M. Feig and L. Johnsson", title = "Some Metacomputing Experiences for Scientific Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "243--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Geist:1999:HAV, author = "G. A. Geist and Ii and James Arthur Kohl and Stephen Scott and Philip M. Papadopoulos", title = "{Harness}: Adaptable Virtual Machine Environment for Heterogeneous Cluster", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "253--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Laure:1999:OHC, author = "Erwin Laure and Piyush Mehrotra and Hans Zima", title = "{Opus}: Heterogeneous Computing with Data Parallel Tasks", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "275--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Nguyen-Tuong:1999:URI, author = "Anh Nguyen-Tuong and Andrew S. Grimshaw", title = "Using Reflection for Incorporating Fault-Tolerance Techniques into Distributed Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "291--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Trefethen:1999:LIC, author = "Anne E. Trefethen and Mishi Derakhshan and Stefano Salvini", title = "Libraries and Infrastructure for Clustered Computing", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "303--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:1999:ENc, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "311--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Petit:1999:OSS, author = "Franck Petit and Vincent Villain", title = "Optimality and Self-Stabilization In Rooted Tree Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "313--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Herley:1999:FDP, author = "Kieran T. Herley and Andrea Pietracaprina and Geppino Pucci", title = "Fast Deterministic Parallel Branch-And-Bound", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "325--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Hu:1999:COH, author = "Zhenjiang Hu and Masato Takeichi", title = "Calculating An Optimal Homomorphic Algorithm for Bracket Matching", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "335--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Fraguela:1999:MHP, author = "Basilio B. Fraguela and Ram{\'o}n Doallo and Emilio L. Zapata", title = "Memory Hierarchy Performance Prediction for Blocked Sparse Algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "347--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Hambrusch:1999:MDT, author = "Susanne E. Hambrusch and Hyeong-Seok Lim", title = "Minimizing the Diameter In Tree Networks Under Edge Reductions", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "361--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Elgindy:1999:SSL, author = "Hossam Elgindy and Sanguthevar Rajasekaran", title = "Sorting and Selection on a Linear Array with Optical Bus System", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "373--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Chen:1999:PFP, author = "Lin Chen and Julius Y. Jiang and Maung T. Nyeu", title = "Provably Fastest Parallel Algorithms for Bipartite Permutation Graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "385--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Azagury:1999:NIR, author = "Alain Azagury and Elliot K. Kolodner and Erez Petrank", title = "A Note on the Implementation of Replication-Based Garbage Collection for Multithreaded Applications and Multiprocessor Environments", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "391--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Lee:1999:PEJ, author = "Bu-Sung Lee and Yan Gu and Wentong Cai and Alfred Heng", title = "Performance Evaluation of {JPVM}", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "401--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Ferreira:1999:RBC, author = "Afonso Ferreira and Nicolas Schabanel", title = "A Randomized {BSP\slash CGM} Algorithm for the Maximal Independent Set Problem", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "411--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Vaidehi:1999:AGA, author = "V. Vaidehi and C. N. Krishnan and P. Swaminathan", title = "An Aided Genetic Algorithm for Multiprocessor Scheduling", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "423--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Charpentier:1999:OAC, author = "Michel Charpentier and Mamoun Filali and Philippe Mauran and G{\'e}Rard Padiou and Philippe Qu{\'e}Innec", title = "The Observation: An Abstract Communication Mechanism", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "3", pages = "437--??", month = sep, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Cosnard:1999:EN, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "451--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904; http://www.wspc.com/journals/ppl/09/0904/0002.html", acknowledgement = ack-nhfb, } @Article{Feil:1999:CCW, author = "M. Feil and A. Uhl and M. Vajtersic", title = "Computation of the Continuous Wavelet Transform on Massively Parallel {SIMD} Arrays", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "453--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Gonzalez:1999:PIL, author = "P. Gonzalez and J. C. Cabaleiro and T. F. Pena", title = "Parallel Incomplete {LU} Factorization as a Preconditioner for {Krylov} Subspace Methods", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "467--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Igarashi:1999:SPM, author = "Y. Igarashi and Y. Nishitani", title = "Speedup of the $n$-Process Mutual Exclusion Algorithm", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "475--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Massingill:1999:EPP, author = "B. L. Massingill", title = "Experiments with Program Parallelization Using Archetypes and Stepwise Refinement", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "487--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Akl:1999:PRT, author = "S. G. Akl and S. D. Bruda", title = "Parallel Real-Time Optimization: Beyond Speedup", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "499--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Atallah:1999:PAL, author = "M. J. Atallah and D. Z. Chen and K. S. Klenk", title = "Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "511--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Pham:1999:TMA, author = "C. Pham and C. Albrecht", title = "Tuning Message Aggregation on High Performance Clusters for Efficient Parallel Simulations", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "521--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Chan:1999:NCG, author = "A. Chan and F. Dehne", title = "A Note on Coarse Grained Parallel Integer Sorting", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "533--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Carle:1999:AAB, author = "J. Carle and J.-F. Myoupo and D. Seme", title = "All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "539--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Megson:1999:FTR, author = "G. M. Megson and X. Liu and X. Yang", title = "Fault-Tolerant Ring Embedding in a Honeycomb Torus with Node Failures", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "551--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Das:1999:SSA, author = "S. K. Das and A. K. Datta and S. Tixeuil", title = "Self-Stabilizing Algorithms in {DAG} Structured Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "563--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Jain:1999:PSM, author = "A. Jain", title = "Parallel Search and Multisearch in Matrices with Sorted Columns", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "575--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Anonymous:1999:AI, author = "Anonymous", title = "Author Index", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "4", pages = "587--??", month = dec, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Oct 12 16:06:30 2000", URL = "http://www.wspc.com/journals/ppl/09/0904/1190904.html; http://www.wspc.com/journals/ppl/09/0904/", acknowledgement = ack-nhfb, } @Article{Cosnard:2000:EN, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "1--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/", acknowledgement = ack-nhfb, } @Article{Petit:2000:OSS, author = "F. Petit and V. Villain", title = "Optimality and Self-Stabilization in Rooted Tree Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "3--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000032.html", acknowledgement = ack-nhfb, } @Article{Djamegni:2000:NAD, author = "C. Tayou Djamegni and M. Tchuente", title = "A New Algorithm for Dynamic Programming on Regular Arrays", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "15--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000044.html", acknowledgement = ack-nhfb, } @Article{Kim:2000:WRE, author = "B. W. Kim and J. H. Choi and K.-I. Park and K. H. Park", title = "A Wormhole Router with Embedded Broadcasting Virtual Bus for Mesh Computers", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "29--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000056.html", acknowledgement = ack-nhfb, } @Article{DeMarco:2000:TTB, author = "G. {De Marco} and A. A. Rescigno", title = "Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "39--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:39:24 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000068.html", acknowledgement = ack-nhfb, } @Article{Venema:2000:NAS, author = "S. Venema and H. Shen and F. Suraweera", title = "{NC} Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "51--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S012962640000007X.html", acknowledgement = ack-nhfb, } @Article{Guyennet:2000:LBU, author = "H. Guyennet and M. Trehel", title = "Load Balancing Using Processor Groups", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "59--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000081.html", acknowledgement = ack-nhfb, } @Article{Chung:2000:ECM, author = "C.-M. Chung and P.-S. Shin and S.-D. Kim", title = "An Effective Configuration Method for {Java--Internet} Computing Environment", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "73--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000093.html", acknowledgement = ack-nhfb, } @Article{Ahn:2000:AMPa, author = "J. Ahn and T. Han", title = "An Analytical Method for Parallelization of Recursive Functions", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "87--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S012962640000010X.html", acknowledgement = ack-nhfb, } @Article{Oskin:2000:ACP, author = "M. Oskin and L.-V. Lita and F. T. Chong and J. Hensley and D. Keen", title = "Algorithmic Complexity with Page-Based Intelligent Memory", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "99--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000111.html", acknowledgement = ack-nhfb, } @Article{Vee:2000:LPL, author = "V.-Y. Vee and W.-J. Hsu", title = "Locality-Preserving Load-Balancing Mechanisms for Synchronous Simulations on Shared-Memory Multiprocessors", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "111--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000123.html", acknowledgement = ack-nhfb, } @Article{Bampis:2000:UDM, author = "E. Bampis and R. Giroudeau and J.-C. K{\"o}nig", title = "Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "133--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000135.html", acknowledgement = ack-nhfb, } @Article{Tamassia:2000:PAP, author = "R. Tamassia and I. G. Tollis and J. S. Vitter", title = "A Parallel Algorithm for Planar Orthogonal Grid Drawings", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "1", pages = "141--??", month = mar, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1001/S01296264001001.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000147.html", acknowledgement = ack-nhfb, } @Article{Anonymous:2000:ENa, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "151--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/", acknowledgement = ack-nhfb, } @Article{Artigas:2000:ALT, author = "P. V. Artigas and M. Gupta and S. P. Mikiff and J. E. Moreira", title = "Automatic Loop Transformations and Parallelization for {Java}", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "153--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000160.html", acknowledgement = ack-nhfb, } @Article{Rijpkema:2000:DPN, author = "E. Rijpkema and E. F. Deprettere and B. Kienhuis", title = "Deriving Process Networks from Nested Loop Algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "165--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000172.html", acknowledgement = ack-nhfb, } @Article{Loechner:2000:MCD, author = "V. Loechner and C. Mongenet", title = "Memory Cost Due to Anticipated Broadcast", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "177--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000184.html", acknowledgement = ack-nhfb, } @Article{Brandes:2000:HLC, author = "T. Brandes", title = "{HPF} Library and Compiler Support for Halos in Data Parallel Irregular Computations", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "189--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000196.html", acknowledgement = ack-nhfb, } @Article{Antoniu:2000:CDP, author = "G. Antoniu and L. Boug{\'e} and R. Namyst and C. P{\'e}rez", title = "Compiling Data-Parallel Programs to a Distributed Runtime Environment with Thread Isomigration", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "201--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000202.html", acknowledgement = ack-nhfb, } @Article{Quinlan:2000:RCS, author = "D. Quinlan", title = "{ROSE}: Compiler Support for Object-Oriented Frameworks", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "215--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000214.html", acknowledgement = ack-nhfb, } @Article{Kim:2000:WDS, author = "S. W. Kim and R. Eigenmann", title = "Where Does the Speedup Go: Quantitative Modeling of Performance Losses in Shared-Memory Programs", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "227--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000226.html", acknowledgement = ack-nhfb, } @Article{Herrmann:2000:HOL, author = "C. A. Herrmann and C. Lengauer", title = "A Higher-Order Language for Divide-and-Conquer", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "2/3", pages = "239--??", month = sep, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Apr 18 07:29:37 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S01296264001002_03.html", URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000238.html", acknowledgement = ack-nhfb, } @Article{Anonymous:2000:ENb, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "251--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S012962640000024X.html", acknowledgement = ack-nhfb, } @Article{Boros:2000:EIA, author = "E. Boros and K. Elbassioni and V. Gurvich and L. Khachiyan", title = "An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "253--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000251.html", acknowledgement = ack-nhfb, } @Article{Blazewicz:2000:SCT, author = "J. Blazewicz and F. Guinand and B. Penz and D. Trystram", title = "Scheduling Complete Trees on Two Uniform Processors with Integer Speed Ratios and Communication Delays", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "267--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000263.html", acknowledgement = ack-nhfb, } @Article{Wu:2000:FHP, author = "J. Wu", title = "On Finding a {Hamiltonian} Path in a Tournament Using Semi-Heap", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "279--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000275.html", acknowledgement = ack-nhfb, } @Article{DiIanni:2000:WDP, author = "M. {Di Ianni}", title = "Wormhole Deadlock Prediction", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "295--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000287.html", acknowledgement = ack-nhfb, } @Article{Caragiannis:2000:SCA, author = "I. Caragiannis and C. Kaklamanis and P. Persiano", title = "Symmetric Communication in All-Optical Tree Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "305--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000299.html", acknowledgement = ack-nhfb, } @Article{Kaklamanis:2000:HAS, author = "C. Kaklamanis and C. Konstantopoulos and A. Svolos", title = "A Hypercube Algorithm for Sliding Window Compression", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "315--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000305.html", acknowledgement = ack-nhfb, } @Article{Sengupta:2000:DFF, author = "A. Sengupta and S. Viswanathan", title = "Deadlock-Free Fault-Tolerant Multicast Routing in Hypercubes", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "327--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000317.html", acknowledgement = ack-nhfb, } @Article{Diaz:2000:FRG, author = "J. Diaz and J. Petit and M. Serna", title = "Faulty Random Geometric Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "343--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/", acknowledgement = ack-nhfb, } @Article{Ahn:2000:AMPb, author = "J. Ahn and T. Han", title = "An Analytical Method for Parallelization of Recursive Functions", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "359--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000330.html", acknowledgement = ack-nhfb, } @Article{Louca:2000:MFP, author = "S. Louca and N. Neophytou and A. Lachanas and P. Evripidou", title = "{MPI-FT}: Portable Fault Tolerance Scheme for {MPI}", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "371--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000342.html", acknowledgement = ack-nhfb, } @Article{Gruau:2000:CG, author = "F. Gruau and J. Tromp", title = "Cellular Gravity", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "383--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000354.html", acknowledgement = ack-nhfb, } @Article{Anonymous:2000:AI, author = "Anonymous", title = "Author Index", journal = j-PARALLEL-PROCESS-LETT, volume = "10", number = "4", pages = "395--??", month = dec, year = "2000", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Jul 25 16:34:42 2001", bibsource = "http://ejournals.wspc.com.sg/ppl/S0129626400000366.pdf", URL = "http://ejournals.wspc.com.sg/ppl/10/1004/", acknowledgement = ack-nhfb, } @Article{Anonymous:2001:NEC, author = "Anonymous", title = "Note from the {Editor-in-Chief}", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "1--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Anonymous:2001:EN, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "3--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Amamiya:2001:AFC, author = "M. Amamiya and H. Taniguchi and T. Matsuzaki", title = "An Architecture of Fusing Communication and Execution for Global Distributed Processing", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "7--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Cerin:2001:BCW, author = "C. C{\'e}rin and J.-L. Gaudiot", title = "Benchmarking Clusters of Workstations Through Parallel Sorting and {BSP} Libraries", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "25--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Danelutto:2001:ESS, author = "M. Danelutto", title = "Efficient Support for Skeletons on Workstation Clusters", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "41--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Siegelin:2001:SCD, author = "C. Siegelin and L. Castillo and U. Finger", title = "{Smart Cards}: Distributed Computing with \$5 Devices", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "57--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Arantes:2001:BLC, author = "L. Arantes and D. Poitrenaud and P. Sens and B. Folliot", title = "The Barrier-Lock Clock: {A} Scalable Synchronization-Oriented Logical Clock", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "65--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Phillips:2001:PDP, author = "C. Phillips and R. Perrott", title = "Problems with Data Parallelism", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "77--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Mostefaoui:2001:LBC, author = "A. Mostefaoui and M. Raynal", title = "Leader-Based Consensus", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "95--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Reijns:2001:PAM, author = "G. L. Reijns and A. J. C. van Gemund and H. Gautama", title = "Performance Analysis of Multi-Stage Interconnection Networks with Deterministic Service Times", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "109--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Mongelli:2001:PPM, author = "H. Mongelli and S. W. Song", title = "Parallel Pattern Matching with Scaling", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "125--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Evripidou:2001:NCW, author = "P. Evripidou and G. Samaras and C. Spyrou and A. Papagapiou", title = "Net-Console: {Web}-Based Development Environment for Parallel Programs", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "139--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Cosnard:2001:APT, author = "M. Cosnard and E. Jeannot", title = "Automatic Parallelization Techniques Based on Compact {DAG} Extraction and Symbolic Scheduling", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "151--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Kakulavarapu:2001:DLB, author = "P. Kakulavarapu and O. C. Maquelin and J. N. Amaral and G. R. Gao", title = "Dynamic Load Balancers for a Multithreaded Multiprocessor System", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "1", pages = "169--??", month = mar, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Dongarra:2001:PCC, author = "J. Dongarra and B. Tourancheau", title = "Preface: Clusters and Computational Grids for Scientific Computing", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "185--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Arnold:2001:CCD, author = "D. C. Arnold and S. S. Vahdiyar and J. J. Dongarra", title = "On the Convergence of Computational and Data Grids", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "187--202", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", URL = "http://ejournals.wspc.com.sg/ppl/11/sample/S012962640100052X.html; http://www.netlib.org/utk/people/JackDongarra/PAPERS/convergence-data-grids.pdf", acknowledgement = ack-nhfb, } @Article{Baker:2001:ERJ, author = "M. Baker and G. Smith", title = "Establishing a Reliable {Jini} Infrastructure for Parallel Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "203--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Chiola:2001:UCF, author = "G. Chiola and G. Ciaccio and C. Anglano", title = "On the Use of Coscheduling in Fast Communication Systems", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "223--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Geoffray:2001:OPI, author = "P. Geoffray", title = "{OPIOM}: Off-Processor {I/O} with {Myrinet}", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "237--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Kranzlmuller:2001:NAS, author = "D. Kranzlm{\"u}ller", title = "Nondeterminism Analysis on Supercomputers and Clusters", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "251--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Miller:2001:PIB, author = "B. P. Miller and M. Christodorescu and R. Iverson and T. Kosar and A. Mirgorodskii and F. Popovici", title = "Playing Inside the Black Box: Using Dynamic Instrumentation to Create Security Holes", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "267--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Migliardi:2001:EPP, author = "M. Migliardi and V. Sunderam", title = "Emulating Parallel Programming Environments in the Harness Metacomputing System", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "281--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Tourancheau:2001:SMM, author = "B. Tourancheau and R. Westrelin", title = "Study of the Medium Message Performance of {BIP\slash Myrinet}", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "297--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Cosnard:2001:EN, author = "M. Cosnard", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "311--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Vee:2001:SES, author = "V.-Y. Vee and W.-J. Hsu", title = "A Scalable and Efficient Storage Allocator on Shared-Memory Multiprocessors", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "313--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Diallo:2001:NCE, author = "M. Diallo and A. Ferreira and A. Rau-Chaplin", title = "A Note on Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and {$2$D} {Vorono{\"\i}} Diagram", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "327--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Lee:2001:IPA, author = "S. Lee and C.-I. Park and C.-M. Park", title = "An Improved Parallel Algorithm for {Delaunay} Triangulation on Distributed Memory Parallel Computers", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "341--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Bruda:2001:NFM, author = "S. D. Bruda and S. G. Akl", title = "On the Necessity of Formal Models for Real-Time Parallel Computations", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "353--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Guo:2001:DSH, author = "M. Guo", title = "Denotational Semantics of an {HPF}-Like Data-Parallel Language Model", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "2--3", pages = "363--??", year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Feb 23 19:27:51 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Hains:2001:PHL, author = "G. Hains and Q. Miller", title = "Preface: High-Level Parallel Programming and Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "375--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Anonymous:2001:TTD, author = "J. Serot", title = "Tagged-Token Data-Flow for Skeletons", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "377--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Zavanella:2001:SBP, author = "A. Zavanella", title = "Skeletons, {BSP} and Performance Portability", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "393--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Tiskin:2001:NWD, author = "A. Tiskin", title = "A New Way to Divide and Conquer", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "409--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Loulergue:2001:DEF, author = "F. Loulergue", title = "Distributed Evaluation of Functional {BSP} Programs", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "423--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Chen:2001:WSB, author = "Y. Chen and J. W. Sanders", title = "Weakest Specifunctions for {BSP}", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "439--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Kelly:2001:TCD, author = "P. H. J. Kelly and O. Beckmann and T. Field and S. B. Baden", title = "{THEMIS}: Component Dependence Metadata in Adaptive Parallel Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "455--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Loidl:2001:TTG, author = "H.-W. Loidl and P. W. Trinder and C. Butz", title = "Tuning Task Granularity and Data Locality of Data Parallel {G P H} Programs", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "471--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Habbas:2001:SMI, author = "Z. Habbas and M. Krajecki and D. Singer", title = "Shared Memory Implementation of Constraint Satisfaction Problem Resolution", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "487--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Anonymous:2001:AI, author = "Anonymous", title = "Author Index", journal = j-PARALLEL-PROCESS-LETT, volume = "11", number = "4", pages = "503--??", month = dec, year = "2001", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Anonymous:2002:ENa, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "1--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Loh:2002:EFT, author = "P. K. K. Loh and W. J. Hsu", title = "Embedding of Fault-Tolerant Trees in the {Josephus} Cube", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "3--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Dobrev:2002:OBT, author = "S. Dobrev and I. Vrto", title = "Optimal Broadcasting in Tori with Dynamic Faults", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "17--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Paterson:2002:PCA, author = "M. S. Paterson and H. Schr{\"o}der and O. S{\'y}kora and I. Vrto", title = "Permutation Communication in All-Optical Rings", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "23--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Barth:2002:CMA, author = "D. Barth and P. Fragopoulou", title = "Compact Multicast Algorithms on Grids and Tori Without Intermediate Buffering", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "31--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Afsahi:2002:ALH, author = "A. Afsahi and N. J. Dimopoulos", title = "Analysis of a Latency Hiding Broadcasting Algorithm on a Reconfigurable Optical Interconnect", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "41--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Panda:2002:PAH, author = "B. S. Panda and V. Natarajan and S. K. Das", title = "Parallel Algorithms for {Hamiltonian} $2$-Separator Chordal Graphs", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "51--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Kee:2002:EIB, author = "Y. Kee and S. Ha", title = "An Efficient Implementation of the {BSP} Programming Library for {VIA}", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "65--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Irony:2002:TRC, author = "D. Irony and S. Toledo", title = "Trading Replication for Communication in Parallel Distributed-Memory Dense Solvers", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "79--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Hayashi:2002:ACA, author = "Y. Hayashi and M. Cole", title = "Automated Cost Analysis of a Parallel Maximum Segment Sum Program Derivation", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "95--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Aguilar:2002:GTM, author = "J. Aguilar", title = "A Graph Theoretical Model for Scheduling Simultaneous {I/O} Operations on Parallel and Distributed Environments", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "113--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Serna:2002:PAF, author = "M. Serna and F. Xhafa", title = "The Parallel Approximability of the False and True Gates Problems for {NOR}-Circuits", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "1", pages = "127--??", month = mar, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Wed Oct 23 16:03:39 MDT 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Gorlatch:2002:F, author = "S. Gorlatch and C. Lengauer", title = "Foreword", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "137--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Kuchen:2002:APS, author = "H. Kuchen and M. Cole", title = "Application Programming with Skeletons", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "141--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Alt:2002:PDC, author = "M. Alt and H. Bischof and S. Gorlatch", title = "Program Development for Computational Grids Using Skeletons and Performance Prediction", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "157--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Gerlach:2002:GPP, author = "J. Gerlach", title = "Generic Programming of Parallel Applications with {Janus}", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "175--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Herrmann:2002:FFI, author = "C. A. Herrmann and C. Lengauer", title = "Functional Formalisms and Implementations", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "193--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Hidalgo-Herrero:2002:OSP, author = "M. Hidalgo-Herrero and Y. Ortega-Mall{\'e}n", title = "An Operational Semantics for the Parallel Language {Eden}", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "211--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Fischer:2002:TUR, author = "J. Fischer and S. Gorlatch", title = "{Turing} Universality of Recursive Patterns for Parallel Programming", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "229--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Lechtchinsky:2002:PFP, author = "R. Lechtchinsky and M. M. T. Chakravarty and G. Keller", title = "Parallel Functional Programming", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "249--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Nitsche:2002:LSF, author = "T. Nitsche", title = "Lifting Sequential Functions to Parallel Skeletons", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "2", pages = "267--??", month = jun, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Fri Nov 22 12:11:03 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml", acknowledgement = ack-nhfb, } @Article{Anonymous:2002:ENb, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "285--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Beauquier:2002:ASW, author = "B. Beauquier and E. Darrot", title = "On Arbitrary Size {Waksman} Networks and Their Vulnerability", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "287--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 08:59:31 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Lavault:2002:EPI, author = "Christian Lavault", title = "Embeddings Into the {Pancake} Interconnection Network", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "297--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Oskin:2002:OST, author = "Mark Oskin and Diana Keen and Justin Hensley and Lucian-Vlad Lita and Frederic T. Chong", title = "Operating Systems Techniques for Parallel Computation in Intelligent Memory", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "311--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 08:59:26 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Johnen:2002:OSS, author = "Colette Johnen and Luc O. Alima and Ajoy K. Datta and S{\'e}bastien Tixeuil", title = "Optimal Snap-Stabilizing Neighborhood Synchronizer in Tree Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "327--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:39:34 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Kavi:2002:MEO, author = "Krishna M. Kavi and Dinesh P. Mehta", title = "Mutual Exclusion on Optical Buses", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "341--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:00:28 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Rajasekaran:2002:EPA, author = "Sanguthevar Rajasekaran", title = "Efficient Parallel Algorithms for Template Matching", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "359--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Xiang:2002:TOS, author = "Limin Xiang and Kazuo Ushijima and Jianjun Zhao", title = "Time Optimal $n$-Size Matching Parentheses and Binary Tree Decoding Algorithms on a $p$-Processor {BSR}", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "365--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:01:21 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Sibeyn:2002:OLR, author = "Jop F. Sibeyn", title = "Optimal List Ranking on One-Dimensional Arrays", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "375--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:2002:AIV, author = "Anonymous", title = "Author Index Volume 12 (2002)", journal = j-PARALLEL-PROCESS-LETT, volume = "12", number = "3--4", pages = "385--??", month = sep # "--" # dec, year = "2002", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Anonymous:2003:EN, author = "Anonymous", title = "Editorial Note", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "1--??", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Gascard:2003:FPA, author = "Eric Gascard and Laurence Pierre", title = "Formal Proof of Applications Distributed in Symmetric Interconnection Networks", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "3--??", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:01:16 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Charron-Bost:2003:NLG, author = "Bernadette Charron-Bost and Robert Cori", title = "A Note on Linearizability and the Global Time Axiom", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "19--??", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:39:43 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Chiao:2003:SSP, author = "Yiwei Chiao", title = "A Self-Stabilizing Phase Synchronization Protocol", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "25--??", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Sibeyn:2003:OGC, author = "Jop F. Sibeyn and Michal {\v{S}}och", title = "Optimal Gossiping on {CCCs} of Even Dimension", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "35--??", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Wu:2003:QRH, author = "Jie Wu and Fei Dai", title = "{QoS} Routing in Hypercube Multicomputers", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "43--??", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:39:52 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Gamess:2003:ESP, author = "Eric Gamess", title = "Execution of Sequential and Parallel {Java} Bytecode in a Metacomputing System", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "53--64", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Akl:2003:PRT, author = "Selim G. Akl", title = "Parallel Real-Time Computation of Nonlinear Feedback Functions", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "65--??", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Petit:2003:CSS, author = "Jordi Petit", title = "Combining Spectral Sequencing and Parallel Simulated Annealing for the {Minla} Problem", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "1", pages = "77--??", month = mar, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Dongarra:2003:P, author = "Jack Dongarra and Bernard Tourancheau", title = "Preface", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "93--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:39:58 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Vallee:2003:CSS, author = "Geoffroy Vall{\'e}e and Renaud Lottiaux and Louis Rilling and Jean-Yves Berthou and Ivan Dutka Malhen and Christine Morin", title = "A Case for Single System Image Cluster Operating Systems: the {Kerrighed} Approach", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "95--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:40:02 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Chung:2003:RSA, author = "I-Hsin Chung and Jeffrey K. Hollingsworth", title = "Runtime Selection Among Different {API} Implementations", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "123--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:40:10 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Heinzlreiter:2003:VSG, author = "Paul Heinzlreiter and Dieter Kranzlm{\"u}ller", title = "Visualization Services on the {Grid}: the {Grid Visualization Kernel}", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "135--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:40:14 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Gelas:2003:TDH, author = "Jean-Patrick Gelas and Saad El Hadri and Laurent Lef{\`e}vre", title = "Towards the Design of a High Performance Active Node", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "149--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:40:18 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Morajko:2003:APA, author = "Anna Morajko and Oleg Morajko and Josep Jorba and Tom{\`a}s Margalef and Emilio Luque", title = "Automatic Performance Analysis and Dynamic Tuning of Distributed Applications", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "169--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:40:22 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Pancake:2003:UID, author = "Cherri M. Pancake", title = "Usability Issues in Developing Tools for the {Grid} --- and How Visual Representations Can Help", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "189--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Sat Nov 6 18:06:29 MST 2004", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Plank:2003:AHP, author = "James S. Plank and Scott Atchley and Ying Ding and Micah Beck", title = "Algorithms for High Performance, Wide-Area Distributed File Downloads", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "207--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:40:30 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Beaumont:2003:SSM, author = "O. Beaumont and A. Legrand and L. Marchal and Y. Robert", title = "Scheduling Strategies for Mixed Data and Task Parallelism on Heterogeneous Clusters", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "225--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:40:34 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Narayanan:2003:DSD, author = "Sivaramakrishnan Narayanan and Tahsin Kurc and Umit Catalyurek and Joel Saltz", title = "Database Support for Data-Driven Scientific Applications in the {Grid}", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "245--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:40:41 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Kurzyniec:2003:TSO, author = "Dawid Kurzyniec and Tomasz Wrzosek and Dominik Drzewiecki and Vaidy Sunderam", title = "Towards Self-Organizing Distributed Computing Frameworks: the {H2O} Approach", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "273--??", month = jun, year = "2003", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Thu Jan 06 09:03:47 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/", acknowledgement = ack-nhfb, } @Article{Vadhiyar:2003:SFD, author = "Sathish S. Vadhiyar and Jack J. Dongarra", title = "{SRS}: a Framework for Developing Malleable and Migratable Parallel Applications for Distributed Systems", journal = j-PARALLEL-PROCESS-LETT, volume = "13", number = "2", pages = "291--??", month = jun