@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/|"}
@String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220
(Computer architecture)",
corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
Canada",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6120 (File
organisation)",
corpsource = "Dept. d'Arquitectura de Computadors, Univ. Politecnica
de Catalunya, Barcelona, Spain",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Scuola Normale Superior, Pisa, Italy",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Math. and Comput. Sci., Paderborn Univ.,
Germany",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems); C6150N (Distributed
systems)",
corpsource = "Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV,
USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "David Taylor Res. Center, Bethesda, MD, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Vancouver,
BC, Canada",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C5220P (Parallel
architecture)",
corpsource = "Lab. de Recherche en Inf., Univ. Paris-Sud, Orsay,
France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection)",
corpsource = "Dept. of Comput. Technol., Nanyang Technol. Univ.,
Singapore",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
VA, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C6150N
(Distributed systems)",
corpsource = "Dept. of Electr. Eng., Nat. Sun Yat-Sen Univ.,
Kaohsiung, Taiwan",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Colorado State Univ., Ft. Collins, CO, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Mankato State Univ.,
MN, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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$^1$} 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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
keywords = "computational complexity; Different Than Majority;
Labeling; logspace hard; NC; NC$^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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "IMAG, Ecole Normale Superieure, Lyon, France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150N (Distributed systems)",
corpsource = "CNRS, Univ. de Paris-Sud, Orsay, France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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$^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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dipartimento di Inf. e Sistemistica, Pavia Univ.,
Italy",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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$^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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Instytut Informatyki, Warszawski Univ., Warszawa,
Poland",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150J (Operating systems)",
corpsource = "LRI, Univ. de Paris Sud, Orsay, France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming); C6120 (File
organisation)",
corpsource = "CWI, Amsterdam, Netherlands",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4200 (Computer
theory)",
corpsource = "Inst. of Inf. Syst., Russian Acad. of Sci.,
Novosibirsk, Russia",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.ens-lyon.fr/PPL/vol3_1.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., IIT, Madras, India",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection)",
corpsource = "Inst. of Math., Acad. of Sci., Novosibirsk, Russia",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5260B (Computer vision and picture processing)",
corpsource = "JJMA Inc., Virginia, VA, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Fac. de Inf., Univ. Politecnica de Valencia, Spain",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Electr. Eng., Hiroshima Univ., Japan",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Lab. d'Automatique et d'Analyse des Syst., Toulouse,
France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis,
OR, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "B6210 (Telecommunication applications); C5670
(Network performance)",
corpsource = "Oregon Univ., Eugene, OR, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5670 (Network performance)",
corpsource = "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
Italy",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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$^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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
journalabr = "Parallel Process Lett",
keywords = "(mathematics); algorithm; Algorithms; arbitrary trees;
carried dependencies; Codes (symbols); Computational
complexity; computational complexity; data
dependencies; Data handling; Data transfer; deadlines;
delay minimization; delay problem; fast (O(n log$^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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture)",
corpsource = "Sandia Nat. Labs., Albuquerque, NM, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C6150N
(Distributed systems software)",
corpsource = "Parallel Comput. Centre, Edinburgh Univ., UK",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C5470 (Performance
evaluation and testing)",
corpsource = "Tata Inf. Syst. Ltd., Bangalore, India",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C5440 (Multiprocessing
systems)",
corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1290 (Applications of systems theory); C4240P
(Parallel programming and algorithm theory)",
corpsource = "IMAG, Grenoble, France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
corpsource = "Dept. Comput. and Inf. Sci., Mankato State Univ., MN,
USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C4260 (Computational geometry)",
corpsource = "URA CNRS, Lyon, France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C5440
(Multiprocessing systems)",
corpsource = "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
Troy, NY, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
keywords = "affine dependencies; 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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.ens-lyon.fr/PPL/vol6_1.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "B0290H (Linear algebra); C4140 (Linear algebra);
C4240P (Parallel programming and algorithm theory)",
corpsource = "Lab. LMC, IMAG, Grenoble, France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C6110F (Formal methods)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.ens-lyon.fr/PPL/vol6_2.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput., King's Coll., London, UK",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Knowledge Based Syst. Inc., College Station, TX, USA",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory)",
corpsource = "Lab. d'Inf. Fondamentale, Orleans Univ., France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150G (Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "IRISA, Rennes, France",
countrypub = "Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Santa Barbara, CA, USA",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C5470 (Performance
evaluation and testing)",
corpsource = "Colorado State Univ., Fort Collins, CO, USA",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C6110F (Formal
methods)",
corpsource = "LIP, CNRS, Lyon, France",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Fakultat fur Math. und Inf., Passau Univ., Germany",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C6110B (Software
engineering techniques); C6150N (Distributed systems
software)",
corpsource = "Sch. of Appl. Sci., Nanyang Technol. Univ.,
Singapore",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5230 (Digital arithmetic methods)",
corpsource = "Univ. Sci. Instrum. Centre, Kalyani Univ., West
Bengal, India",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C5220P (Parallel
architecture)",
corpsource = "L'Aquila Univ., Italy",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Univ. of Wales, Swansea, UK",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5640 (Protocols); C6150N (Distributed systems
software)",
corpsource = "Inst. of Inf., Warsaw Univ., Poland",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory); C5640 (Protocols)",
corpsource = "IRIT, Univ. Paul Sabatier, Toulouse, France",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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 = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
Uncover database",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Simon Fraser Univ",
affiliationaddress = "Burnaby, BC, Can",
classification = "721.1; 921; 921.4",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Simon Fraser Univ",
affiliationaddress = "Barnaby, BC, Can",
classification = "921; 921.4",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Simon Fraser Univ",
affiliationaddress = "Burnaby, BC, Can",
classification = "716.1; 723; 921",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Uniwersytet Warszawski",
affiliationaddress = "Warszawa, Pol",
classification = "703.1; 716; 716.3; 723",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Hiroshima Univ",
affiliationaddress = "Higashi-Hiroshima, Jpn",
classification = "716; 723; 921",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "RWTH Aachen",
affiliationaddress = "Aachen, Ger",
classification = "718.2; 721.1; 722.1; 722.4; 723; 903.2",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Technion",
affiliationaddress = "Haifa, Isr",
classification = "716; 716.1; 721.1; 921; 921.1",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Universita di Salerno",
affiliationaddress = "Baronissi, Italy",
classification = "703.1; 716; 722.4; 921; 921.4",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Paderborn",
affiliationaddress = "Paderborn, Ger",
classification = "716; 723; 921.4",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Victoria",
affiliationaddress = "Victoria, BC, Can",
classification = "723; 723.2; 921; 921.4; 921.5",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Tufts Univ",
affiliationaddress = "Medford, MA, USA",
classification = "722.4; 921; 921.4",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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 = "Compendex database; http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
affiliation = "Universitaet Hamburg",
affiliationaddress = "Hamburg, Ger",
classification = "921; 921.4",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
classification = "722.4; 723; 745.1; 903.2",
journal-URL = "http://www.worldscientific.com/loi/ppl",
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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www-mat.upc.es/~comellas/genprog/genprog.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Geist:1999:HAV,
author = "G. A. {Geist 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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/0002.html;
http://www.wspc.com/journals/ppl/09/0904/1190904",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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",
bibsource = "http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://www.wspc.com/journals/ppl/09/0904/;
http://www.wspc.com/journals/ppl/09/0904/1190904.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000032.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000044.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000056.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000068.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S012962640000007X.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000081.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000093.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S012962640000010X.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000111.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000123.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000135.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1001/S0129626400000147.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000160.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000172.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000184.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000196.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000202.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000214.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000226.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1002_03/S0129626400000238.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S012962640000024X.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000251.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000263.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000275.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000287.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000299.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000305.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000317.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000330.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000342.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000354.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
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,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@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,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:03:57 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hains:2003:PSI,
author = "Ga{\'e}tan Hains and Fr{\'e}d{\'e}ric Loulergue",
title = "Preface: Special Issue on High-Level Parallel
Programming and Applications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "313--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:40:55 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bamha:2003:PSI,
author = "M. Bamha and M. Exbrayat",
title = "Pipelining a Skew-Insensitive Parallel Join
Algorithm",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "317--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:04:05 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Vasilev:2003:BVR,
author = "Vasil P. Vasilev",
title = "{BSPGRID}: Variable Resources Parallel Computation and
Multiprogrammed Parallelism",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "329--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Marowka:2003:EOT,
author = "Ami Marowka",
title = "Extending {OpenMP} for Task Parallelism",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "341--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yong:2003:AMC,
author = "Xie Yong and Hsu Wen-Jing",
title = "Aligned Multithreaded Computations and Their
Scheduling with {FAB} Performance Guarantees",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "353--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:41:03 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gava:2003:FPF,
author = "Fr{\'e}d{\'e}ric Gava",
title = "Formal Proofs of Functional {BSP} Programs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "365--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{DiCosmo:2003:CDA,
author = "Roberto {Di Cosmo} and Susanna Pelagatti",
title = "A Calculus for Dense Array Distributions",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "377--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:41:06 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Chen:2003:TDB,
author = "Yifeng Chen and J. W. Sanders",
title = "Top-Down Design of Bulk-Synchronous Parallel
Programs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "389--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:41:18 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grelck:2003:SHL,
author = "Clemens Grelck and Sven-Bodo Scholz",
title = "{SAC} --- From High-Level Programming with Arrays to
Efficient Parallel Execution",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "401--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:41:23 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hammond:2003:AST,
author = "Kevin Hammond and Jost Berthold and Rita Loogen",
title = "Automatic Skeletons in {Template Haskell}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "413--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:41:54 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Chailloux:2003:PIO,
author = "Emmanuel Chailloux and Christian Foisy",
title = "A Portable Implementation for {Objective Caml
Flight}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "425--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:00 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dorta:2003:LPS,
author = "Antonio J. Dorta and Jes{\'u}s A. Gonz{\'a}lez and
Casiano Rodr{\'i}guez and Francisco {De Sande}",
title = "{LLC}: a Parallel Skeletal Language",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "437--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:10 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Aldinucci:2003:ESS,
author = "Marco Aldinucci",
title = "{{\sf eskimo}}: Experimenting with Skeletons in the
Shared Address Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "449--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bischof:2003:DDP,
author = "Holger Bischof and Sergei Gorlatch and Roman
Leshchinskiy",
title = "{DatTeL}: {A} Data-Parallel {C++} Template Library",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "461--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:12 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hinsen:2003:HLP,
author = "Konrad Hinsen",
title = "High-Level Parallel Software Development with {Python}
and {BSP}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "473--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dessmark:2003:TOB,
author = "Anders Dessmark and Andrzej Lingas and Andrzej Pelc",
title = "Trade-Offs Between Load and Degree in Virtual Path
Layouts",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "485--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Thornton:2003:PEP,
author = "Mitchell Thornton",
title = "Performance Evaluation of a Parallel Decoupled Data
Driven Multiprocessor",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "3",
pages = "497--??",
month = sep,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kosch:2003:ENS,
author = "Harald Kosch and Laszlo B{\"o}sz{\"o}rm{\'e}nyi and
Hermann Hellwagner",
title = "Editorial Note: {``Part I: the Best Papers from
Euro-Par 2003''}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "509--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cosnard:2003:ENS,
author = "Michel Cosnard",
title = "Editorial Note: {``Part II: Regular Papers''}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "511--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gautama:2003:SPE,
author = "H. Gautama and A. J. C. {Van Gemund}",
title = "Symbolic Performance Estimation of Speculative
Parallel Programs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "513--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Scholz:2003:PPR,
author = "Bernhard Scholz and Eduard Mehofer and Nigel
Horspool",
title = "Predicated Partial Redundancy Elimination Using a Cost
Analysis",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "525--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lawley:2003:ANB,
author = "Richard Lawley and Michael Luck and Keith Decker and
Terry Payne and Luc Moreau",
title = "Automated Negotiation Between Publishers and Consumers
of Grid Notifications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "537--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Pohl:2003:OPC,
author = "Thomas Pohl and Markus Kowarschik and Jens Wilke and
Klaus Iglberger and Ulrich R{\"u}de",
title = "Optimization and Profiling of the Cache Performance of
Parallel Lattice {Boltzmann} Codes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "549--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Almasi:2003:OBS,
author = "George Alm{\'a}si and Ralph Bellofatto and Jos{\'e}
Brunheroto and C{\u{a}}lin Ca{\c{s}}caval and Jos{\'e}
G. Casta{\~n}os and Paul Crumley and C. Christopher
Erway and Derek Lieber and Xavier Martorell and
Jos{\'e} E. Moreira and Ramendra Sahoo and Alda
Sanomiya and Luis Ceze and Karin Strauss",
title = "An Overview of the {Bluegene/L} System Software
Organization",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "561--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bischof:2003:COP,
author = "Holger Bischof and Sergei Gorlatch and Emanuel
Kitzelmann",
title = "Cost Optimality and Predictability of Parallel
Programming with Skeletons",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "575--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cores:2003:IBE,
author = "F. Cores and A. Ripoll and X. Y. Yang and B. Qazzaz
and R. Suppi and P. Hernandez and E. Luque",
title = "Improving Bandwidth Efficiency in Distributed
Video-On-Demand Architectures",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "589--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:14 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gallard:2003:DSE,
author = "Pascal Gallard and Christine Morin",
title = "Dynamic Streams for Efficient Communications Between
Migrating Processes in a Cluster",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "601--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:21 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Chatzigiannakis:2003:CSP,
author = "Ioannis Chatzigiannakis and Tassos Dimitriou and
Marios Mavronicolas and Sotiris Nikoletseas and Paul
Spirakis",
title = "A Comparative Study of Protocols for Efficient Data
Propagation in Smart Dust Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "615--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:26 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Popov:2003:PAB,
author = "Konstantin Popov and Mahmoud Rafea and Fredrik
Holmgren and Per Brand and Vladimir Vlassov and Seif
Haridi",
title = "Parallel Agent-Based Simulation on a Cluster of
Workstations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "629--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Garces-Erice:2003:HPP,
author = "L. Garc{\'e}s-Erice and E. W. Biersack and K. W. Ross
and P. A. Felber and G. Urvoy-Keller",
title = "Hierarchical Peer-To-Peer Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "643--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Santos:2003:TSM,
author = "Eunice E. Santos",
title = "Tridiagonal Solvers with Multiple Right Hand Sides on
$k$-Dimensional Mesh and Torus Interconnection
Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "659--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gupta:2003:PAV,
author = "Arvind Gupta and Ramesh Krishnamurti",
title = "Parallel Algorithms for Vehicle Routing Problems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "673--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Futamura:2003:PSA,
author = "Natsuhiko Futamura and Srinivas Aluru and Xiaoqiu
Huang",
title = "Parallel Syntenic Alignments",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "689--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Wu:2003:DFR,
author = "Jie Wu and Li Sheng",
title = "Deadlock-Free Routing in Irregular Networks Using
Prefix Routing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "705--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gontmakher:2003:CVJ,
author = "Alex Gontmakher and Sergey Polyakov and Assaf
Schuster",
title = "Complexity of Verifying {Java} Shared Memory
Execution",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "721--734",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2003:AIV,
author = "Anonymous",
title = "Author Index Volume 13 (2003)",
journal = j-PARALLEL-PROCESS-LETT,
volume = "13",
number = "4",
pages = "735--??",
month = dec,
year = "2003",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Blazewicz:2004:ENS,
author = "Jacek B{\l}a{\.z}ewicz and Klaus Ecker and Denis
Trystram",
title = "Editorial Note: {``Part I: the Best Papers from CIRM
Workshop (October 2001)''}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "1--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cosnard:2004:ENS,
author = "Michel Cosnard",
title = "Editorial Note: {``Part II: Regular Papers''}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "2--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Krings:2004:SIS,
author = "Axel W. Krings and William S. Harrison and Azad
Azadmanesh and Miles Mcqueen",
title = "Scheduling Issues in Survivability Applications Using
Hybrid Fault Models",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "5--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Blazewicz:2004:PTS,
author = "Jacek B{\l}a{\.z}ewicz and Adrian Moret-Salvador and
Rafa{\l} Walkowiak",
title = "Parallel {Tabu} Search Approaches for Two-Dimensional
Cutting",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "23--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Drews:2004:SWB,
author = "F. Drews and K. Ecker and O. Kao and S. Schomann",
title = "Strategies for Workload Balancing in Cluster-Based
Image Databases",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "33--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:31 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Medina:2004:ASH,
author = "Maira T. Medina and Celso C. Ribeiro and Luiz F. G.
Soares",
title = "Automatic Scheduling of Hypermedia Documents With
Elastic Times",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "45--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:31 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Elsasser:2004:ODS,
author = "Robert Els{\"a}sser and Burkhard Monien and Robert
Preis and Andreas Frommer",
title = "Optimal Diffusion Schemes and Load Balancing on
Product Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "61--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:31 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gairing:2004:SSM,
author = "Martin Gairing and Wayne Goddard and Stephen T.
Hedetniemi and David P. Jacobs",
title = "Self-Stabilizing Maximal $k$-Dependent Sets in Linear
Time",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "75--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:31 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Tsay:2004:DSA,
author = "Jong-Chuang Tsay",
title = "Designing a Systolic Algorithm for Generating
Well-Formed Parenthesis Strings",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "83--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:31 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Karpinski:2004:WEA,
author = "Marek Karpinski and Lawrence Larmore and Yakov
Nekrich",
title = "Work-Efficient Algorithms for the Construction of
Length-Limited {Huffman} Codes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "99--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:31 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhi:2004:UPS,
author = "Xiaoli Zhi and Rong Lu and Xinda Lu",
title = "Universal Parallel Solver for Convection-Diffusion
Equations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "107--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nikolopoulos:2004:PAR,
author = "Stavros D. Nikolopoulos and Leonidas Palios",
title = "Parallel Algorithms for Recognizing $p_5$-Free and
$\bar p_5$-Free Weakly Chordal Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "1",
pages = "119--??",
month = mar,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2004:ENPa,
author = "Anonymous",
title = "Editorial Note: {``Part I: Editorial from Alberto
Apostolico''}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "131--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:32 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2004:ENPb,
author = "Anonymous",
title = "Editorial Note: {``Part II: Regular Papers''}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "134--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:32 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Geijer:2004:GCA,
author = "Johan Geijer and Boris Lenhard and Roxana
Merino-Martinez and Gunnar Norstedt and Amilcar
Flores-Morales",
title = "Grid Computing for the Analysis of Regulatory Elements
in Co-Regulated Sets of Genes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "137--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bilbao-Castro:2004:PGC,
author = "J. R. Bilbao-Castro and R. Marabini and J. M. Carazo
and I. Garcia and J. J. Fernandez",
title = "The Potential of Grid Computing in Three-Dimensional
Electron Microscopy",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "151--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Comin:2004:GDB,
author = "Matteo Comin and Carlo Ferrari and Concettina Guerra",
title = "Grid Deployment of Bioinformatics Applications: a Case
Study in Protein Similarity Determination",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "163--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Maigne:2004:PMC,
author = "Lydia Maigne and David Hill and Pascal Calvat and
Vincent Breton and Romain Reuillon and Delphine Lazaro
and Yannick Legre and Denise Donnarieix",
title = "Parallelization of {Monte Carlo} Simulations and
Submission to a Grid Environment",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "177--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Stefanescu:2004:GEN,
author = "Radu Stefanescu and Xavier Pennec and Nicholas
Ayache",
title = "Grid-Enabled Non-Rigid Registration of Medical
Images",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "197--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cannataro:2004:PBP,
author = "Mario Cannataro and Carmela Comito and Antonio
Congiusta and Pierangelo Veltri",
title = "{PROTEUS}: a Bioinformatics Problem Solving
Environment on Grids",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "217--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Green:2004:CSP,
author = "Mark L. Green and Russ Miller",
title = "A Client-Server Prototype for Grid-Enabling
Application Template Design",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "241--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Abawajy:2004:PJS,
author = "Jemal H. Abawajy",
title = "Preemptive Job Scheduling Policy for
Distributively-Owned Workstation Clusters",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "255--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Sat Nov 6 18:06:32 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Petrank:2004:PCG,
author = "Erez Petrank and Elliot K. Kolodner",
title = "Parallel Copying Garbage Collection Using Delayed
Allocation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "271--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Touati:2004:EPR,
author = "Sid-Ahmed-Ali Touati and Christine Eisenbeis",
title = "Early Periodic Register Allocation on {ILP}
Processors",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "287--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Baille:2004:NBS,
author = "Fabien Baille and Evripidis Bampis and Christian
Laforest",
title = "A Note on Bicriteria Schedules with Optimal
Approximations Ratios",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "2",
pages = "315--??",
month = jun,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jan 06 09:42:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2004:EN,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "325--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Shin:2004:NAD,
author = "Chulho Shin and Seong-Won Lee and Jean-Luc Gaudiot",
title = "The Need for Adaptive Dynamic Thread Scheduling in
Simultaneous Multithreading",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "327--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Eshaghian-Wilner:2004:SRM,
author = "Mary M. Eshaghian-Wilner and Russ Miller",
title = "The Systolic Reconfigurable Mesh",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "337--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{DeAgostino:2004:AWO,
author = "Sergio {De Agostino}",
title = "Almost Work-Optimal {PRAM EREW} Decoders of {LZ}
Compressed Text",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "351--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Monien:2004:IBC,
author = "Burkhard Monien and Imrich Vr{\v{t}}o",
title = "Improved Bounds on Cutwidths of Shuffle-Exchange and
{de Bruijn} Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "361--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bein:2004:OEH,
author = "Doina Bein and Wolfgang W. Bein and Natasa Brajkovska
and Shahram Latifi",
title = "Optimal Embedding of Honeycomb Networks into
Hypercubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "367--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Stacho:2004:RBC,
author = "Ladislav Stacho and Jozef {\v{S}}ir{\'a}{\v{n}} and
Sanming Zhou",
title = "Routing Balanced Communications on {Hamilton}
Decomposable Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "377--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gairing:2004:DTI,
author = "Martin Gairing and Wayne Goddard and Stephen T.
Hedetniemi and Petter Kristiansen and Alice A. Mcrae",
title = "Distance-Two Information in Self-Stabilizing
Algorithms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "387--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yang:2004:STDa,
author = "Xiaofan Yang and Graham M. Megson and Shaomln Zhang
and Xiaoping Liu",
title = "A Solution to the Three Disjoint Path Problem on
Honeycomb Meshes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "399--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yang:2004:STDb,
author = "Xiaofan Yang and Graham M. Mengson and Shaomin Zhang
and Xiaoping Liu",
title = "A Solution to the Three Disjoint Path Problem on
Honeycomb Tori",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "411--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2004:AIV,
author = "Anonymous",
title = "Author Index Volume 14 (2004)",
journal = j-PARALLEL-PROCESS-LETT,
volume = "14",
number = "3/4",
pages = "423--??",
month = sep # "\slash " # dec,
year = "2004",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Jul 7 07:41:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2005:P,
author = "Anonymous",
title = "Preface",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "1--2",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bastoul:2005:APT,
author = "C{\'e}dric Bastoul and Paul Feautrier",
title = "Adjusting a Program Transformation for Legality",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "3--17",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002027",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Malony:2005:OCP,
author = "Allen D. Malony and Sameer S. Shende",
title = "Overhead Compensation in Performance Profiling",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "19--35",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002039",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Rantakokko:2005:DMO,
author = "Jarmo Rantakokko",
title = "A Dynamic {MPI--OpenMP} Model for Structured Adaptive
Mesh Refinement",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "37--47",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002040",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Arber:2005:IMB,
author = "Leon Arber and Scott Pakin",
title = "The Impact of Message-Buffer Alignment on
Communication Performance",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "49--65",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002052",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Talia:2005:APD,
author = "Domenico Talia and Paolo Trunfio",
title = "Adapting a Pure Decentralized Peer-To-Peer Protocol
for {Grid} Services Invocation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "67--84",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002064",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Floros:2005:TGS,
author = "Evangelos Floros and Yiannis Cotronis",
title = "Towards a {Grid} Services Based Framework for the
Virtualization, Execution and Composition of {MPI}
Applications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "85--98",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002076",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yalcinkaya:2005:AVA,
author = "Yasemin Yal{\c{c}}inkaya and Trond Steihaug",
title = "Aggregating Variables for Asynchronous Iterations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "99--114",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002088",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yalcinkaya:2005:EN,
author = "Yasemin Yal{\c{c}}inkaya and Trond Steihaug",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "115--115",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002088",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Galdi:2005:SPN,
author = "Clemente Galdi and Christos Kaklamanis and Manuela
Montangero and Giuseppe Persiano",
title = "Station Placement in Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "117--129",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002106",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Aguilar:2005:PLS,
author = "Jose Aguilar and Ernst Leiss",
title = "Parallel Loop Scheduling Approaches for Distributed
and Shared Memory Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "131--152",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002118",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Khonsari:2005:PMS,
author = "A. Khonsari and H. Sarbazi-Azad and M. Ould-Khaoua",
title = "A Performance Model of Software-Based Deadlock
Recovery Routing Algorithm in Hypercubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "153--168",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640500212X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Friedman:2005:BCA,
author = "Roy Friedman and Achour Mostefaoui and Michel Raynal",
title = "{$\diamondsuit {\cal P}_{{\rm mute}}$}-based consensus
for asynchronous {Byzantine} systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "169--182",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002131",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Devismes:2005:SSS,
author = "St{\'e}phane Devismes",
title = "A Silent Self-Stabilizing Algorithm for Finding
Cut-Nodes and Bridges",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "183--198",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002143",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gusatto:2005:EPA,
author = "{\'E}der Gusatto and Jos{\'e} C. M. Mombach and
Fernando P. Cercato and Gerson H. Cavalheiro",
title = "An Efficient Parallel Algorithm to Evolve Simulations
of the Cellular {Potts} Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "199--208",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002155",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Barth:2005:CMR,
author = "Dominique Barth and Pascal Berthome and Paraskevi
Fragopoulou",
title = "The Complexity of the Maximal Requests Satisfaction
Problem in Multipoint Communication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "209--222",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002167",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bernaschi:2005:ERA,
author = "Massimo Bernaschi and Giulio Iannello and Saverio
Crea",
title = "Experimental Results About {MPI} Collective
Communication Operations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "1/2",
pages = "223--236",
month = mar # "\slash " # jun,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002179",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2005:ENa,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "3",
pages = "237--237",
month = sep,
year = "2005",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kelly:2005:GAM,
author = "Paul H. J. Kelly and Olav Beckmann",
title = "Generative and Adaptive Methods in Performance
Programming",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "3",
pages = "239--255",
month = sep,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002192",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bischof:2005:DPC,
author = "Holger Bischof and Sergei Gorlatch and Roman
Leshchinskiy and Jens M{\"u}ller",
title = "Data Parallelism in {C++} Template Programs: a
{Barnes--Hut} Case Study",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "3",
pages = "257--272",
month = sep,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002209",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{DuBois:2005:TMS,
author = "Andr{\'e} Rauber {Du Bois} and Phil Trinder and
Hans-Wolfgang Loidl",
title = "Towards Mobility Skeletons",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "3",
pages = "273--288",
month = sep,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002210",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gava:2005:FLD,
author = "Fr{\'e}d{\'e}ric Gava and Fr{\'e}d{\'e}ric Loulergue",
title = "A Functional Language for Departmental Metacomputing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "3",
pages = "289--304",
month = sep,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002222",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Herrmann:2005:GMP,
author = "Christoph A. Herrmann",
title = "Generating Message-Passing Programs from Abstract
Specifications by Partial Evaluation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "3",
pages = "305--320",
month = sep,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002234",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Matsuzaki:2005:SDT,
author = "Kiminori Matsuzaki and Zhenjiang Hu and Kazuhiko
Kakehi and Masato Takeichi",
title = "Systematic Derivation of Tree Contraction Algorithms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "3",
pages = "321--336",
month = sep,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002246",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nitsche:2005:DSC,
author = "Thomas Nitsche",
title = "Deriving and Scheduling Communication Operations for
Generic Skeleton Implementations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "3",
pages = "337--352",
month = sep,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002258",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2005:ENb,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "353--356",
month = dec,
year = "2005",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Byna:2005:ICS,
author = "Surendra Byna and Kirk W. Cameron and Xian-He Sun",
title = "Isolating Costs in Shared Memory Communication
Buffering",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "357--365",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002271",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Rufai:2005:MPO,
author = "Raimi Rufai and Muslim Bozyigit and Jaralla Alghamdi
and Moataz Ahmed",
title = "Multithreaded Parallelism with {OpenMP}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "367--378",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002283",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Schikuta:2005:TXB,
author = "Erich Schikuta",
title = "Towards an {XML} Based Datagrid Description Language",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "379--386",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002295",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kerbyson:2005:UPP,
author = "Darren J. Kerbyson and Adolfy Hoisie and Harvey J.
Wasserman",
title = "Use of Predictive Performance Modeling During
Large-Scale System Installation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "387--395",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002301",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nethi:2005:AMS,
author = "Murali K. Nethi and James H. Aylor",
title = "Advances in Modelling and Simulation of Large
Parallel\slash Distributed Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "397--405",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002313",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Soliman:2005:PEB,
author = "Mostafa I. Soliman and Stanislav G. Sedukhin",
title = "Performance Evaluation of {BLAS} on the {Trident}
Processor",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "407--414",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002325",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Carino:2005:PAQ,
author = "Ricolindo L. Cari{\~n}o and Ioana Banicescu and Ravi
K. Vadapalli and Charles A. Weatherford and Jianping
Zhu",
title = "Parallel Adaptive Quantum Trajectory Method for
Wavepacket Simulations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "415--422",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002337",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ishii:2005:ISC,
author = "Renato P. Ishii and Rodrigo F. {De Mello} and Luciano
J. Senger and Marcos J. Santana and Regina H. C.
Santana and Laurence Tianruo Yang",
title = "Improving Scheduling of Communication Intensive
Parallel Applications on Heterogeneous Computing
Environments",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "423--438",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002349",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lin:2005:GAE,
author = "Man Lin and Sai Man Ng",
title = "A Genetic Algorithm for Energy Aware Task Scheduling
in Heterogeneous Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "439--449",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002350",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Joo:2005:ASM,
author = "Kil Hong Joo and Won Suk Lee",
title = "Adaptive Selection of Materialized Queries in a
Mediator",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "451--458",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002362",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yang:2005:IPI,
author = "Laurence Tianruo Yang",
title = "The Improved Parallel {ICGS} Method for Large and
Sparse Unsymmetric Linear Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "459--467",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002374",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
keywords = "Improved Conjugate Gradient Squared method (ICGS);
large and sparse linear systems; parallel distributed
memory systems; the CGS method; the ICGS method;
unsymmetric coefficient matrices",
}
@Article{Chang:2005:SIS,
author = "Weng-Long Chang and Minyi Guo and Jesse Wu",
title = "Solving the Independent-set Problem in a {DNA}-Based
Supercomputer Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "469--479",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002386",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hayashi:2005:PCS,
author = "Ryoko Hayashi and Kenji Tanaka and Susumu Horiguchi
and Yasuaki Hiwatari",
title = "A Parallelization Case-Study of {MD} Simulation of a
Low Density Physical System",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "481--489",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002398",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Tabirca:2005:AFG,
author = "Tatiana Tabirca and Len Freeman and Sabin Tabirca and
Laurence Tianruo Yang",
title = "Applying the Feedback Guided Dynamic Loop Scheduling
Method for the Shortest Path Problem",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "491--497",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002404",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2005:AIV,
author = "Anonymous",
title = "Author Index Volume 15 (2005)",
journal = j-PARALLEL-PROCESS-LETT,
volume = "15",
number = "4",
pages = "499--502",
month = dec,
year = "2005",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626405002404",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2006:ENa,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "1--2",
month = mar,
year = "2006",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grosu:2006:TLB,
author = "Daniel Grosu and Anthony T. Chronopoulos",
title = "A Truthful Load Balancing Mechanism with
Verification",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "3--17",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002435",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2006:IPG,
author = "Selim G. Akl",
title = "Inherently Parallel Geometric Computations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "19--37",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002447",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
note = "See errata \cite{Akl:2006:ESP}.",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nakashima:2006:COP,
author = "Takaaki Nakashima and Akihiro Fujiwara",
title = "A Cost Optimal Parallel Algorithm for Patience
Sorting",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "39--51",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002459",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kiniwa:2006:RLT,
author = "Jun Kiniwa and Masafumi Yamashita",
title = "A Randomized 1-Latent, Time-Adaptive and Safe
Self-Stabilizing Mutual Exclusion Protocol",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "53--61",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002460",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Elhadef:2006:PPS,
author = "Mourad Elhadef and Kaouther Abrougui and Shantanu Das
and Amiya Nayak",
title = "A Parallel Probabilistic System-Level Fault Diagnosis
Approach for Large Multiprocessor Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "63--79",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002472",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Karpinski:2006:ACO,
author = "Marek Karpinski and Yakov Nekrich",
title = "Algorithms for Construction of Optimal and
Almost-Optimal Length-Restricted Codes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "81--92",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002484",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Pelc:2006:VMA,
author = "Andrzej Pelc",
title = "Voting Mechanisms in Asynchronous {Byzantine}
Environments",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "93--99",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002496",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Haddad:2006:NEP,
author = "Serge Haddad and Jean-Fran{\c{c}}ois Pradat-Peyre",
title = "New Efficient {Petri} Nets Reductions for Parallel
Programs Verification",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "101--116",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002502",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gairing:2006:PAR,
author = "Martin Gairing and Thomas L{\"u}cking and Marios
Mavronicolas and Burkhard Monien",
title = "The Price of Anarchy for Restricted Parallel Links",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "117--131",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002514",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Mendiburu:2006:IPE,
author = "A. Mendiburu and J. Miguel-Alonso and J. A. Lozano",
title = "Implementation and Performance Evaluation of a
Parallelization of Estimation of {Bayesian} Network
Algorithms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "1",
pages = "133--148",
month = mar,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002526",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2006:ENb,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "149--149",
month = jun,
year = "2006",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2006:GENa,
author = "Anonymous",
title = "{Guest Editor}'s Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "151--151",
month = jun,
year = "2006",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{AlNaMneh:2006:TPD,
author = "Rami {Al Na'Mneh} and W. David Pan and Seong-Moo Yoo",
title = "Two Parallel {$1$-D} {FFT} Algorithms Without
All-To-All Communication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "153--164",
month = jun,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640600254X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bermond:2006:HAG,
author = "Jean-Claude Bermond and Jerome Galtier and Ralf
Klasing and Nelson Morales and Stephane Perennes",
title = "Hardness and Approximation of Gathering in Static
Radio Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "165--183",
month = jun,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002551",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2006:ESP,
author = "Selim G. Akl",
title = "Errata: {{\em Inherently Parallel Geometric
Computations}}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "185--188",
month = jun,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002563",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
note = "See \cite{Akl:2006:IPG}.",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Mostefaoui:2006:TFA,
author = "Achour Mostefaoui and Eric Mourgaya and Michel Raynal
and Corentin Travers",
title = "A Time-Free Assumption to Implement Eventual
Leadership",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "189--207",
month = jun,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002575",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jesshope:2006:MMD,
author = "Chris Jesshope",
title = "Microthreading a Model for Distributed
Instruction-Level Concurrency",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "209--228",
month = jun,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002587",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kyriacou:2006:CCO,
author = "Costas Kyriacou and Paraskevas Evripidou and Pedro
Trancoso",
title = "{CacheFlow}: Cache Optimizations for Data Driven
Multithreading",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "229--244",
month = jun,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002599",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cerin:2006:MSS,
author = "Christophe C{\'e}rin and Jean-Luc Gaudiot and Michel
Koskas",
title = "A Multithreaded {SQL} Service",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "245--259",
month = jun,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002605",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Thomas:2006:AHL,
author = "Nathan Thomas and Steven Saunders and Tim Smith and
Gabriel Tanase and Lawrence Rauchwerger",
title = "{ARMI}: {A} High Level Communication Library for
{STAPL}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "2",
pages = "261--280",
month = jun,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002617",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2006:ENS,
author = "Anonymous",
title = "Editorial Note: {September} Special Issue 2006",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "281--282",
month = sep,
year = "2006",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2006:GENb,
author = "Anonymous",
title = "Guest Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "283--284",
month = sep,
year = "2006",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hofbauer:2006:QMC,
author = "Heinz Hofbauer and Andreas Uhl and Peter Zinterhof",
title = "Quasi {Monte Carlo} Integration in {Grid}
Environments: Further Leaping Effects",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "285--311",
month = sep,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002654",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Purcz:2006:CCS,
author = "Pavol Purcz",
title = "Communication Complexity and Speed-Up in the Explicit
Difference Method",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "313--321",
month = sep,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002666",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Rozman:2006:CPL,
author = "Igor Rozman and Marjan {\v{s}}terk and Roman Trobec",
title = "Communication Performance of {LAM\slash MPI} and
{MPICH} on a {Linux} Cluster",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "323--334",
month = sep,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002678",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kutil:2006:PWF,
author = "Rade Kutil and Peter Eder",
title = "Parallelization of Wavelet Filters Using {SIMD}
Extensions",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "335--349",
month = sep,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640600268X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Doerner:2006:PCS,
author = "Karl F. Doerner and Richard F. Hartl and Siegfried
Benkner and Maria Lucka",
title = "Parallel Cooperative Savings Based Ant Colony
Optimization --- Multiple Search And Decomposition
Approaches",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "351--369",
month = sep,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002691",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Oksa:2006:PPB,
author = "Gabriel Ok{\v{s}}a and Mari{\'a}n Vajter{\v{s}}ic",
title = "Preconditioned Parallel Block-{Jacobi} {SVD}
Algorithm",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "371--379",
month = sep,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002708",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2006:TCD,
author = "Selim G. Akl",
title = "Three Counterexamples to Dispel the Myth of the
Universal Computer",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "3",
pages = "381--403",
month = sep,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640600271X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2006:ENc,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "405--406",
month = dec,
year = "2006",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Klimke:2006:CDA,
author = "Andreas Klimke and Barbara Wohlmuth",
title = "Constructing Dimension-Adaptive Sparse Grid
Interpolants Using Parallel Function Evaluations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "407--418",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002733",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Attiya:2006:SMS,
author = "Hagit Attiya and Amir Bar-Or",
title = "Sharing Memory with Semi-{Byzantine} Clients and
Faulty Storage Servers",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "419--428",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002745",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jana:2006:IPP,
author = "Prasanta K. Jana and Bhabani P. Sinha",
title = "An Improved Parallel Prefix Algorithm on {OTIS-Mesh}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "429--440",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002757",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Huang:2006:MWR,
author = "Kuo-Chan Huang",
title = "Minimizing Waiting Ratio for Dynamic Workload on
Parallel Computers",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "441--453",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002769",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Huang:2006:PAT,
author = "Kuo-Chan Huang and Feng-Jian Wang",
title = "Parallelizing an Application with Time-Increasing
Workload Using Adaptive Processor Allocation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "455--466",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002770",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Vidyasankar:2006:HCG,
author = "K. Vidyasankar",
title = "A Highly Concurrent Group Mutual ${L}$-Exclusion
Algorithm",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "467--483",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002782",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ruby:2006:ODC,
author = "Catherine L. Ruby and Mark L. Green and Russ Miller",
title = "The {Operations Dashboard}: a Collaborative
Environment for Monitoring Virtual
Organization-Specific Compute Element Operational
Status",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "485--500",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002794",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Deng:2006:OCS,
author = "Yuhui Deng and Frank Wang and Na Helian and Dan Feng
and Ke Zhou",
title = "Optimal Clustering Size of Small File Access in
Network Attached Storage Device",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "501--512",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002800",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2006:AIV,
author = "Anonymous",
title = "Author Index Volume 16",
journal = j-PARALLEL-PROCESS-LETT,
volume = "16",
number = "4",
pages = "513--515",
month = dec,
year = "2006",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626406002800",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2007:ENa,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "1--1",
month = mar,
year = "2007",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2007:GENa,
author = "Anonymous",
title = "Guest Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "3--3",
month = mar,
year = "2007",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lumsdaine:2007:CPG,
author = "Andrew Lumsdaine and Douglas Gregor and Bruce
Hendrickson and Jonathan Berry",
title = "Challenges in Parallel Graph Processing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "5--20",
month = mar,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002843",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Brevik:2007:UMB,
author = "John Brevik and Daniel Nurmi and Rich Wolski",
title = "Using Model-based Clustering to Improve Predictions
for Queueing Delay on Parallel Machines",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "21--46",
month = mar,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002855",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jeannot:2007:IRT,
author = "Emmanuel Jeannot and Keith Seymour and Asym Yarkhan
and Jack J. Dongarra",
title = "Improved Runtime and Transfer Time Prediction
Mechanisms in a Network Enabled Servers Middleware",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "47--59",
month = mar,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002867",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Marchal:2007:SAD,
author = "Loris Marchal and Veronika Rehn and Yves Robert and
Fr{\'e}d{\'e}ric Vivien",
title = "Scheduling Algorithms for Data Redistribution and
Load-Balancing on Master-Slave Platforms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "61--77",
month = mar,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002879",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Graham:2007:OMH,
author = "Richard L. Graham and Brian W. Barrett and Galen M.
Shipman and Timothy S. Woodall and George Bosilca",
title = "{Open MPI}: {A} High Performance, Flexible
Implementation of {MPI} Point-to-Point Communications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "79--88",
month = mar,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002880",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lusk:2007:LHP,
author = "Ewing Lusk and Katherine Yelick",
title = "Languages for High-Productivity Computing: the {DARPA
HPCS Language Project}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "89--102",
month = mar,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002892",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Plank:2007:ENA,
author = "James S. Plank and Michael G. Thomason",
title = "An Exploration of Non-Asymptotic Low-Density, Parity
Check Erasure Codes for Wide-Area Storage
Applications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "1",
pages = "103--123",
month = mar,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002909",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2007:ENb,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "2",
pages = "125--125",
month = jun,
year = "2007",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Marquez:2007:IPM,
author = "A. M{\'a}rquez and C. Gil and R. Ba{\~n}os and J.
G{\'o}mez",
title = "Improving the Performance of Multi-Objective
Evolutionary Algorithms Using the Island Parallel
Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "2",
pages = "127--139",
month = jun,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002922",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Khachiyan:2007:CMM,
author = "Leonid Khachiyan and Endre Boros and Vladimir Gurvich
and Khaled Elbassioni",
title = "Computing Many Maximal Independent Sets for
Hypergraphs in Parallel",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "2",
pages = "141--152",
month = jun,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002934",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Georgiou:2007:FSA,
author = "Chryssis Georgiou and Alexander Russell and Alexander
A. Shvartsman",
title = "Failure-Sensitive Analysis of Parallel Algorithms with
Controlled Memory Access Concurrency",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "2",
pages = "153--168",
month = jun,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002946",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Coudert:2007:SRR,
author = "D. Coudert and P. Datta and S. Perennes and H. Rivano
and M.-E. Voge",
title = "Shared Risk Resource Group Complexity and
Approximability Issues",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "2",
pages = "169--184",
month = jun,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002958",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2007:ABC,
author = "Naya Nagy and Selim G. Akl",
title = "Aspects of Biomolecular Computing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "2",
pages = "185--211",
month = jun,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640700296X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Khonsari:2007:PMD,
author = "A. Khonsari and A. Shahrabi and M. Ould-Khaoua",
title = "A Performance Model of {Disha} Routing in {$k$}-Ary
{$n$}-Cube Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "2",
pages = "213--228",
month = jun,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407002971",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2007:ENc,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "229--229",
month = sep,
year = "2007",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2007:GENb,
author = "Anonymous",
title = "Guest Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "231--232",
month = sep,
year = "2007",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2007:PQI,
author = "Marius Nagy and Selim G. Akl",
title = "Parallelism in Quantum Information Processing Defeats
the Universal Computer",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "233--262",
month = sep,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003009",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jafer:2007:PAC,
author = "Shafagh Jafer and Gabriel A. Wainer",
title = "Parallel Algorithms for Cellular Models Simulation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "263--285",
month = sep,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003010",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hamann:2007:EC,
author = "Heiko Hamann and Heinz W{\"o}rn",
title = "Embodied Computation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "287--298",
month = sep,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003022",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Drzadzewski:2007:CMN,
author = "Grzegorz Drzadzewski and Mark Wineberg",
title = "Comparing Minimum Neighborhood Evaluation Schemes for
Finding Spatially Robust Solutions",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "299--309",
month = sep,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003034",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Drzadzewski:2007:HSD,
author = "Grzegorz Drzadzewski and Mark Wineberg",
title = "How Solution Density Affects the Finding of Spatially
Robust Solutions",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "311--321",
month = sep,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003046",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2007:AQK,
author = "Naya Nagy and Selim G. Akl",
title = "Authenticated Quantum Key Distribution Without
Classical Communication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "323--335",
month = sep,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003058",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2007:ENd,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "337--338",
month = dec,
year = "2007",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Head:2007:PET,
author = "Tom Head",
title = "Photocomputing: Explorations with Transparency and
Opacity",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "339--347",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003071",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Carbajal:2007:PTD,
author = "Santiago Garcia Carbajal",
title = "Parallelizing Three Dimensional Cellular Automata with
{OpenMP}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "349--361",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003083",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gamess:2007:AAB,
author = "Eric Gamess",
title = "An Architectural Approach to Building Grids Using
Legacy Code",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "363--378",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003095",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kulkarni:2007:TA,
author = "Sandeep S. Kulkarni",
title = "Terminating Alternator",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "379--390",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003101",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Neocleous:2007:FMG,
author = "Kyriakos Neocleous and Marios D. Dikaiakos and
Paraskevi Fragopoulou and Evangelos P. Markatos",
title = "Failure Management in {Grids}: the Case of the {EGEE}
Infrastructure",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "391--410",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003113",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Heller:2007:LCL,
author = "Steve Heller and Maurice Herlihy and Victor Luchangco
and Mark Moir and William N. {Scherer III} and Nir
Shavit",
title = "A Lazy Concurrent List-Based Set Algorithm",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "411--424",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003125",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Qiu:2007:UNB,
author = "Ke Qiu",
title = "On a Unified Neighbourhood Broadcasting Scheme for
Interconnection Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "425--437",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003137",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dong:2007:TTS,
author = "Fangpeng Dong",
title = "A Taxonomy of Task Scheduling Algorithms in the
{Grid}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "439--454",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003149",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Adamatzky:2007:PMI,
author = "Andrew Adamatzky",
title = "{Physarum} Machine: Implementation of a
{Kolmogorov--Uspensky} Machine on a Biological
Substrate",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "455--467",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003150",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2007:AIV,
author = "Anonymous",
title = "Author Index Volume 17",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "4",
pages = "469--471",
month = dec,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003150",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2008:ENa,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "1--1",
month = mar,
year = "2008",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2008:GENa,
author = "Anonymous",
title = "Guest Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "3--5",
month = mar,
year = "2008",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Krusche:2008:EEB,
author = "Peter Krusche",
title = "Experimental Evaluation of {BSP} Programming
Libraries",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "7--21",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003193",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grelck:2008:HSM,
author = "Clemens Grelck and Steffen Kuthe and Sven-Bodo
Scholz",
title = "A Hybrid Shared Memory Execution Model for a Data
Parallel Language with {I/O}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "23--37",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640800320X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gava:2008:MID,
author = "Fr{\'e}d{\'e}ric Gava",
title = "A Modular Implementation of Data Structures in
Bulk-Synchronous Parallel {ML}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "39--53",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003211",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Chailloux:2008:HFT,
author = "Emmanuel Chailloux and Vivien Ravet and Julien
Verlaguet",
title = "{HirondML}: Fair Threads Migrations for {Objective
Caml}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "55--69",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003223",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Rodriguez:2008:IRI,
author = "Noemi Rodriguez and Silvana Rossetto",
title = "Integrating Remote Invocations with Asynchronism and
Cooperative Multitasking",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "71--85",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003235",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yaikhom:2008:MPM,
author = "Gagarine Yaikhom",
title = "Message Passing Without Memory Copy",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "87--100",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003247",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Berthold:2008:IDC,
author = "Jost Berthold and Rita Loogen",
title = "The Impact of Dynamic Channels on Functional Topology
Skeletons",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "101--115",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003259",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Poldner:2008:IFS,
author = "Michael Poldner and Herbert Kuchen",
title = "On Implementing the Farm Skeleton",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "117--131",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003260",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Pelaez:2008:HLP,
author = "Ignacio Pel{\'a}ez and Francisco Almeida and Daniel
Gonz{\'a}lez",
title = "High Level Parallel Skeletons for Dynamic
Programming",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "133--147",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003272",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{DiCosmo:2008:SPP,
author = "Roberto {Di Cosmo} and Zheng Li and Susanna Pelagatti
and Pierre Weis",
title = "Skeletal Parallel Programming with {OcamlP3L 2.0}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "149--164",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003284",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Campa:2008:ECC,
author = "Sonia Campa",
title = "Evaluating Computational Costs While Handling Data and
Control Parallelism",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "165--174",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003296",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Aldinucci:2008:AMA,
author = "Marco Aldinucci and Anne Benoit",
title = "Automatic Mapping of Assist Applications Using Process
Algebra",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "175--188",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003302",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Goddard:2008:SSG,
author = "Wayne Goddard and Stephen T. Hedetniemi and David P.
Jacobs and Pradip K. Srimani and Zhenyu Xu",
title = "Self-Stabilizing Graph Protocols",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "1",
pages = "189--199",
month = mar,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003314",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2008:ENb,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "201--201",
month = jun,
year = "2008",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2008:GEI,
author = "Anonymous",
title = "Guest {Editor}'s Introduction",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "203--204",
month = jun,
year = "2008",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lemeire:2008:MPC,
author = "Jan Lemeire and Erik Dirkx and Walter Colitti",
title = "Modeling the Performance of Communication Schemes on
Network Topologies",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "205--220",
month = jun,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640800334X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grelck:2008:GIN,
author = "Clemens Grelck and Sven-Bodo Scholz and Alex
Shafarenko",
title = "A Gentle Introduction to {S-Net}: Typed Stream
Processing and Declarative Coordination of Asynchronous
Components",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "221--237",
month = jun,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003351",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bahn:2008:DAM,
author = "Jun Ho Bahn and Seung Eun Lee and Yoon Seok Yang and
Jungsook Yang and Nader Bagherzadeh",
title = "On Design and Application Mapping of a Network-On-Chip
({NOC}) Architecture",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "239--255",
month = jun,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003363",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jesshope:2008:OSS,
author = "Chris Jesshope",
title = "Operating Systems in Silicon and the Dynamic
Management of Resources in Many-Core Chips",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "257--274",
month = jun,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003375",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Pionteck:2008:ACA,
author = "Thilo Pionteck and Carsten Albrecht and Roman Koch and
Erik Maehle",
title = "Adaptive Communication Architectures for Runtime
Reconfigurable System-On-Chips",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "275--289",
month = jun,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003387",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Tatas:2008:RPD,
author = "Konstantinos Tatas and Costas Kyriacou and Paraskevas
Evripidou and Pedro Trancoso and Stephan Wong",
title = "Rapid Prototyping of the Data-Driven
Chip-Multiprocessor {(D$^2$-CMP)} using {FPGAs}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "291--306",
month = jun,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003399",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Haddix:2008:ODA,
author = "F. Furman Haddix",
title = "An Order Degree Alternator for Arbitrary Topologies",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "2",
pages = "307--322",
month = jun,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003405",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2008:ENc,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "3",
pages = "323--323",
month = sep,
year = "2008",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2008:GENb,
author = "Anonymous",
title = "Guest Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "3",
pages = "325--327",
month = sep,
year = "2008",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zimeo:2008:CSC,
author = "Eugenio Zimeo and Alberto Troisi and Harris Papadakis
and Paraskevi Fragopoulou and Agostino Forestiero and
Carlo Mastroianni",
title = "Cooperative Self-Composition and Discovery of {Grid}
Services in {P2P} Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "3",
pages = "329--346",
month = sep,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003430",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zanikolas:2008:IAA,
author = "Serafeim Zanikolas and Rizos Sakellariou",
title = "An Importance-Aware Architecture for Large-Scale
{Grid} Information Services",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "3",
pages = "347--370",
month = sep,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003442",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zeinalipour-Yazti:2008:MRP,
author = "Demetrios Zeinalipour-Yazti and Harris Papadakis and
Chryssis Georgiou and Marios D. Dikaiakos",
title = "Metadata Ranking and Pruning for Failure Detection in
{Grids}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "3",
pages = "371--390",
month = sep,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003454",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Costa:2008:ODD,
author = "Fernando Costa and Luis Silva and Gilles Fedak and Ian
Kelley",
title = "Optimizing Data Distribution in Desktop {Grid}
Platforms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "3",
pages = "391--410",
month = sep,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003466",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Mejias:2008:RRF,
author = "Boris Mej{\'i}as and Peter {Van Roy}",
title = "The Relaxed-Ring: a Fault-Tolerant Topology for
Structured Overlay Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "3",
pages = "411--432",
month = sep,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003478",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Balaton:2008:ECB,
author = "Zoltan Balaton and Zoltan Farkas and Gabor Gombas and
Peter Kacsuk and Roberto Lovas and Attila Csaba Marosi
and Ad Emmen and Gabor Terstyanszky and Tamas Kiss and
Ian Kelley and Ian Taylor and Oleg Lodygensky and
Miguel Cardenas-Montes and Gilles Fedak and Filipe
Araujo",
title = "{EDGeS}: The Common Boundary Between Service and
Desktop {Grids}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "3",
pages = "433--445",
month = sep,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640800348X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2008:ENd,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "447--447",
month = dec,
year = "2008",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jones:2008:GEN,
author = "Alex K. Jones and Darren J. Kerbyson and Ram Rajamony
and Charles Weems",
title = "Guest {Editor}'s Note: Large-Scale Parallel
Processing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "449--451",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003508",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Barker:2008:PEN,
author = "Kevin J. Barker and Kei Davis and Adolfy Hoisie and
Darren J. Kerbyson and Mike Lang and Scott Pakin and
Jose Carlos Sancho",
title = "A Performance Evaluation of the {Nehalem} Quad-Core
Processor for Scientific Computing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "453--469",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640800351X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hager:2008:DAC,
author = "Georg Hager and Thomas Zeiser and Gerhard Wellein",
title = "Data Access Characteristics and Optimizations for {Sun
UltraSPARC} {T2} and {T2+} Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "471--490",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003521",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Schaffer:2008:UHM,
author = "Kevin Schaffer and Robert A. Walker",
title = "Using Hardware Multithreading to Overcome
Broadcast\slash Reduction Latency in an Associative
{SIMD} Processor",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "491--509",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003533",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Fujimoto:2008:DMV,
author = "Noriyuki Fujimoto",
title = "Dense Matrix-Vector Multiplication on the {CUDA}
Architecture",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "511--530",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003545",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Michalakes:2008:GAN,
author = "John Michalakes and Manish Vachharajani",
title = "{GPU} Acceleration of Numerical Weather Prediction",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "531--548",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003557",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bhatele:2008:BTA,
author = "Abhinav Bhatel{\'e} and Laxmikant V. Kal{\'e}",
title = "Benefits of Topology Aware Mapping for Mesh
Interconnects",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "549--566",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003569",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jones:2008:SEA,
author = "Alex K. Jones and Shuyi Shao and Yu Zhang and Rami
Melhem",
title = "Symbolic Expression Analysis for Compiled
Communication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "567--587",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003570",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kerbyson:2008:IRT,
author = "Darren J. Kerbyson and Mike Lang and Gregory Johnson",
title = "{InfiniBand} Routing Table Optimizations for
Scientific Applications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "589--608",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003582",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2008:AIV,
author = "Anonymous",
title = "Author Index -- Volume 18",
journal = j-PARALLEL-PROCESS-LETT,
volume = "18",
number = "4",
pages = "609--612",
month = dec,
year = "2008",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626408003582",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2009:ENa,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "1--2",
month = mar,
year = "2009",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Calheiros:2009:SMV,
author = "Rodrigo N. Calheiros and Tiago Ferreto and C{\'e}sar
A. F. De Rose",
title = "Scheduling and Management of Virtual Resources in
{Grid} Sites: the Site Resource Scheduler",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "3--18",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640900002X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cheng:2009:SNS,
author = "Eddie Cheng and Ke Qiu and Zhizhang Shen",
title = "A short note on the surface area of star graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "19--22",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000031",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Maksoud:2009:ECS,
author = "Ehab Y. Abdel Maksoud",
title = "Efficient Combined Scheduling of Hard and Soft
Real-Time Tasks in Multiprocessor Systems Under a
Processing Power-Share Strategy",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "23--38",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000043",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2009:LMT,
author = "Marius Nagy",
title = "Locating the Median of a Tree in Real Time",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "39--55",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000055",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Papadakis:2009:HBO,
author = "Harris Papadakis and Paraskevi Fragopoulou and
Evangelos P. Markatos and Marios D. Dikaiakos and
Alexandros Labrinidis",
title = "Hash-Based Overlay Partitioning in Unstructured
Peer-To-Peer Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "57--71",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000067",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Torbey:2009:TFI,
author = "Sami Torbey",
title = "Towards a Framework for Intuitive Programming of
Cellular Automata",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "73--83",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000079",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Traff:2009:RBR,
author = "Jesper Larsson Tr{\"a}ff",
title = "Relationships Between Regular and Irregular Collective
Communication Operations on Clustered Multiprocessors",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "85--96",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000080",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Baddar:2009:SSN,
author = "Sherenaz W. Al-Haj Baddar and Kenneth E. Batcher",
title = "An 11-Step Sorting Network for 18 Elements",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "97--103",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000092",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Adamatzky:2009:DPG,
author = "Andrew Adamatzky",
title = "Developing Proximity Graphs by {{\em Physarum
Polycephalum}}: Does the Plasmodium Follow the
{Toussaint} Hierarchy?",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "105--127",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000109",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gonzalez:2009:ICS,
author = "Teofilo F. Gonzalez",
title = "Improved Communication Schedules with Buffers",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "129--139",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000110",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Georgiou:2009:SRP,
author = "Chryssis Georgiou and Theophanis Pavlides and Anna
Philippou",
title = "Selfish Routing in the Presence of Network
Uncertainty",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "141--157",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000122",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Soliman:2009:PEM,
author = "Mostafa I. Soliman",
title = "Performance Evaluation of Multi-Core {Intel Xeon}
Processors on {Basic Linear Algebra Subprograms}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "159--174",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000134",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dieudonne:2009:SR,
author = "Yoann Dieudonn{\'e} and Franck Petit",
title = "Scatter of Robots",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "1",
pages = "175--184",
month = mar,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000146",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2009:ENb,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "185--185",
month = jun,
year = "2009",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Barth:2009:DLE,
author = "Dominique Barth and Johanne Cohen and Olivier Bournez
and Octave Boussaton",
title = "Distributed Learning of Equilibria in a Routing Game",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "189--204",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640900016X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Thomsen:2009:PRR,
author = "Michael Kirkedal Thomsen and Holger Bock Axelsen",
title = "Parallelization of Reversible Ripple-Carry Adders",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "205--222",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000171",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Thomsen:2009:GEN,
author = "Michael Kirkedal Thomsen and Holger Bock Axelsen",
title = "Guest {Editor}'s Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "225--225",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000171",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Margenstern:2009:NUC,
author = "Maurice Margenstern and Yu Song",
title = "A New Universal Cellular Automaton on the
{Pentagrid}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "227--246",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000195",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kutrib:2009:CDI,
author = "Martin Kutrib and Andreas Malcher",
title = "Computations and Decidability of Iterative Arrays with
Restricted Communication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "247--264",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000201",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Schulz:2009:HFI,
author = "Matthias Schulz",
title = "How Far Is It to the Next Recurrent Configuration? An
{NP}-Complete Problem in the {Sandpile Model}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "265--281",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000213",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Wuensche:2009:CAE,
author = "Andrew Wuensche",
title = "{Cellular Automata Encryption}: the reverse algorithm,
{Z}-parameter and chain-rules",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "283--297",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000225",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Umeo:2009:FSS,
author = "Hiroshi Umeo and Naoki Kamikawa and Jean-Baptiste
Yun{\`e}s",
title = "A Family of Smallest Symmetrical Four-State Firing
Squad Synchronization Protocols for Ring Arrays",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "299--313",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000237",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Maignan:2009:CAM,
author = "Luidnel Maignan and Fr{\'e}d{\'e}ric Gruau",
title = "A {$1$D} Cellular Automaton That Moves Particles Until
Regular Spatial Placement",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "315--331",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000249",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Rieksts:2009:TRF,
author = "Brian Q. Rieksts and Jose A. Ventura",
title = "Time-Relaxed 1-Fault Tolerant Broadcast Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "335--353",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000250",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Soliman:2009:EIT,
author = "Mostafa I. Soliman",
title = "Exploiting {ILP}, {TLP}, and {DLP} to Improve
Multi-Core Performance of One-Sided {Jacobi} {SVD}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "355--375",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000262",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2009:ENc,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "377--377",
month = sep,
year = "2009",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2009:GEN,
author = "Anonymous",
title = "Guest {Editor}'s Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "379--379",
month = sep,
year = "2009",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Benoit:2009:CML,
author = "Anne Benoit and Yves Robert and Eric Thierry",
title = "On the Complexity of Mapping Linear Chain Applications
Onto Heterogeneous Platforms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "383--397",
month = sep,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000298",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gustedt:2009:EML,
author = "Jens Gustedt and Emmanuel Jeannot and Martin Quinson",
title = "Experimental Methodologies for Large-Scale Systems: a
Survey",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "399--418",
month = sep,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000304",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lefevre:2009:TEA,
author = "Laurent Lef{\`e}vre and Anne-Cecile Orgerie",
title = "Towards Energy Aware Reservation Infrastructure for
Large-Scale Experimental Distributed Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "419--433",
month = sep,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000316",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Morin:2009:CNP,
author = "Christine Morin and Yvon J{\'e}gou and J{\'e}r{\^o}me
Gallard and Pierre Riteau",
title = "Clouds: a New Playground for the {XtreemOS} {Grid}
Operating System",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "435--449",
month = sep,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000328",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
abstract = "The emerging cloud computing model has recently gained
a lot of interest both from commercial companies and
from the research community. XtreemOS is a distributed
operating system for large-scale wide-area dynamic
infrastructures spanning multiple administrative
domains. XtreemOS, which is based on the Linux
operating system, has been designed as a Grid operating
system providing native support for virtual
organizations. In this paper, we discuss the
positioning of XtreemOS technologies with regard to
cloud computing. More specifically, we investigate a
scenario where XtreemOS could help users take full
advantage of clouds in a global environment including
their own resources and cloud resources. We also
discuss how the XtreemOS system could be used by cloud
service providers to manage their underlying
infrastructure. This study shows that the XtreemOS
distributed operating system is a highly relevant
technology in the new era of cloud computing where
future clouds seamlessly span multiple bare hardware
providers and where customers extend their IT
infrastructure by provisioning resources from different
cloud service providers.",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
keywords = "Cloud Computing; Distributed System; Grid Computing;
Virtualization",
}
@Article{Kaya:2009:EAT,
author = "Kamer Kaya and Bora U{\c{c}}ar",
title = "Exact Algorithms for a Task Assignment Problem",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "451--465",
month = sep,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962640900033X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Tang:2009:SPA,
author = "Joseph Tang",
title = "A Simple Parallel Adaptive Mesh {CFD} Method Suitable
for Small Engineering Workstations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "469--476",
month = sep,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000341",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Boxer:2009:ECG,
author = "Laurence Boxer",
title = "Efficient Coarse Grained Permutation Exchanges and
Matrix Multiplication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "3",
pages = "477--484",
month = sep,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000353",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2009:ENd,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "485--485",
month = dec,
year = "2009",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jones:2009:GEN,
author = "Alex K. Jones and Darren J. Kerbyson and Ram Rajamony
and Charles Weems",
title = "Guest {Editor}'s Note: Large Scale Parallel
Processing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "487--490",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000377",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zeiser:2009:BAA,
author = "Thomas Zeiser and Georg Hager and Gerhard Wellein",
title = "Benchmark Analysis and Application Results for Lattice
{Boltzmann} Simulations on {NEC SX Vector} and {Intel
Nehalem} Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "491--511",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000389",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ino:2009:HPI,
author = "Fumihiko Ino and Yuki Kotani and Yuma Munekawa and
Kenichi Hagihara",
title = "Harnessing the Power of Idle {GPUs} for Acceleration
of Biological Sequence Alignment",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "513--533",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000390",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dursun:2009:MPM,
author = "Hikmet Dursun and Kevin J. Barker and Darren J.
Kerbyson and Scott Pakin and Richard Seymour and Rajiv
K. Kalia and Aiichiro Nakano and Priya Vashishta",
title = "An {MPI} Performance Monitoring Interface for Cell
Based Compute Nodes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "535--552",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000407",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bhatele:2009:QNC,
author = "Abhinav Bhatel{\'e} and Laxmikant V. Kal{\'e}",
title = "Quantifying Network Contention on Large Parallel
Machines",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "553--572",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000419",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hoefler:2009:ENN,
author = "Torsten Hoefler and Timo Schneider and Andrew
Lumsdaine",
title = "The Effect of Network Noise on Large-Scale Collective
Communications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "573--593",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000420",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhang:2009:NUS,
author = "Yu Zhang and Alex K. Jones",
title = "Non-uniform `Fat-Meshes' for Chip Multiprocessors",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "595--617",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000432",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Davis:2009:PPM,
author = "Kei Davis and Kevin J. Barker and Darren J. Kerbyson",
title = "Performance Prediction Via Modeling: a Case Study of
the {ORNL Cray XT4} Upgrade",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "619--639",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000444",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2009:AIV,
author = "Anonymous",
title = "Author Index Volume 19",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "4",
pages = "641--644",
month = dec,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000444",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2010:ENa,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "1",
pages = "1--1",
month = mar,
year = "2010",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Klappenecker:2010:SST,
author = "Andreas Klappenecker and Hyunyoung Lee and Jennifer L.
Welch",
title = "Scheduling Sensors by Tiling Lattices",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "1",
pages = "3--13",
month = mar,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000028",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Caron:2010:SSP,
author = "Eddy Caron and Fr{\'e}d{\'e}ric Desprez and Franck
Petit and C{\'e}dric Tedeschi",
title = "Snap-Stabilizing Prefix Tree for Peer-To-Peer
Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "1",
pages = "15--30",
month = mar,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641000003X",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gramoli:2010:IAT,
author = "Vincent Gramoli and Derin Harmanci and Pascal Felber",
title = "On the Input Acceptance of Transactional Memory",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "1",
pages = "31--50",
month = mar,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000041",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bernard:2010:CLG,
author = "Thomas A. M. Bernard and Clemens Grelck and Chris R.
Jesshope",
title = "On the Compilation of a Language for General
Concurrent Target Architectures",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "1",
pages = "51--69",
month = mar,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000053",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Silveira:2010:IBS,
author = "C{\'e}sar L. B. Silveira and Gerson Geraldo H.
Cavalheiro and Cl{\'a}udio R. Jung and Julio C. S.
{Jacques, Jr.} and Soraia R. Musse",
title = "An Improved Background Subtraction Algorithm and
Concurrent Implementations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "1",
pages = "71--89",
month = mar,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000065",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yasim:2010:OSE,
author = "Shameema Yasim and Shahram Latifi",
title = "Optimal Subcube Embeddability in Hypercubes with
Additional Dimensions",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "1",
pages = "91--99",
month = mar,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000077",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2010:ENb,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "2",
pages = "101--101",
month = jun,
year = "2010",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Soliman:2010:SIP,
author = "Mostafa I. Soliman and Abdulmajid F. Al-Junaid",
title = "{SystemC} Implementation and Performance Evaluation of
a Decoupled General-Purpose Matrix Processor",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "2",
pages = "103--121",
month = jun,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000090",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{DaRosaRighi:2010:OIM,
author = "Rodrigo {Da Rosa Righi} and La{\'e}rcio Lima Pilla and
Nicolas Maillard and Alexandre Carissimi and Philippe
Olivier Alexandre Navaux",
title = "Observing the Impact of Multiple Metrics and Runtime
Adaptations on {BSP} Process Rescheduling",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "2",
pages = "123--144",
month = jun,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000107",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lucas:2010:SRO,
author = "Keny T. Lucas and Prasanta K. Jana",
title = "Sorting and Routing on {OTIS-Mesh} of Trees",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "2",
pages = "145--154",
month = jun,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000119",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dash:2010:DMS,
author = "Dinesh Dash and Arobinda Gupta and Arijit Bishnu",
title = "Dynamic Maintenance of Support Coverage in Sensor
Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "2",
pages = "155--172",
month = jun,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000120",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Turau:2010:SSV,
author = "Volker Turau",
title = "Self-Stabilizing Vertex Cover in Anonymous Networks
with Optimal Approximation Ratio",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "2",
pages = "173--186",
month = jun,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000132",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hadjidoukas:2010:NOP,
author = "Panagiotis E. Hadjidoukas and Laurent Amsaleg",
title = "Nested {OpenMP} Parallelization of a Hierarchical Data
Clustering Algorithm",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "2",
pages = "187--208",
month = jun,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000144",
ISSN = "0129-6264",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2010:ENc,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "209--209",
month = sep,
year = "2010",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Qiu:2010:GEN,
author = "Ke Qiu",
title = "{Guest Editor}'s Note: Advances in Quantum
Computation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "211--212",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000168",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2010:CDP,
author = "Marius Nagy and Selim G. Akl",
title = "Coping with Decoherence: Parallelizing the {Quantum
Fourier Transform}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "213--226",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641000017X",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2010:EVA,
author = "Marius Nagy and Selim G. Akl",
title = "Entanglement Verification with an Application to
Quantum Key Distribution Protocols",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "227--237",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000181",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2010:KDV,
author = "Naya Nagy and Marius Nagy and Selim G. Akl",
title = "Key Distribution Versus Key Enhancement in Quantum
Cryptography",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "239--250",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000193",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2010:QCS,
author = "Naya Nagy and Selim G. Akl",
title = "A Quantum Cryptographic Solution to the Problem of
Access Control in a Hierarchy",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "251--261",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641000020X",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2010:OTP,
author = "Naya Nagy and Selim G. Akl",
title = "One-Time Pads Without Prior Encounter",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "263--273",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000211",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2010:IBQ,
author = "Selim G. Akl",
title = "On the Importance of Being Quantum",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "275--286",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000223",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2010:ENd,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "287--287",
month = dec,
year = "2010",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Weems:2010:GEN,
author = "Charles C. Weems and Darren J. Kerbyson and Ram
Rajamony and Alex K. Jones",
title = "{Guest Editor}'s Note: Large-Scale Parallel
Processing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "289--291",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000247",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Emmart:2010:HPI,
author = "Niall Emmart and Charles Weems",
title = "High Precision Integer Addition, Subtraction and
Multiplication with a Graphics Processing Unit",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "293--306",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000259",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
note = "See later improvements \cite{Emmart:2011:HPI}.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
keywords = "GNU GMP multiple precision package; graphics
processing unit; Karatsuba multiplication algorithm;
multiple precision arithmetic; parallel algorithm;
Strassen FFT multiplication algorithm",
remark = "The abstract reports improvements (GPU compared to
GMP) of 3x for multiplication, and 8x for addition and
subtraction, with very long operands (32KB or
greater).",
}
@Article{Luong:2010:NSG,
author = "Th{\'e} Van Luong and Nouredine Melab and El-Ghazali
Talbi",
title = "Neighborhood Structures for {GPU}-Based Local Search
Algorithms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "307--324",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000260",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Soman:2010:SGA,
author = "Jyothish Soman and Kishore Kothapalli and P. J.
Narayanan",
title = "Some {GPU} Algorithms for Graph Connected Components
and Spanning Tree",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "325--339",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000272",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Sancho:2010:PTI,
author = "Jose Carlos Sancho and Darren J. Kerbyson and Michael
Lang",
title = "On the Performance and Technological Impact of Adding
Memory Controllers in Multi-Core Processors",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "341--357",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000284",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Wittmann:2010:LSC,
author = "Markus Wittmann and Georg Hager and Jan Treibig and
Gerhard Wellein",
title = "Leveraging Shared Caches for Parallel Temporal
Blocking of Stencil Codes on Multicore Processors and
Clusters",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "359--376",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000296",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Liu:2010:MPP,
author = "Ning Liu and Jing Fu and Christopher D. Carothers and
Onkar Sahni and Kenneth E. Jansen and Mark S.
Shephard",
title = "Massively Parallel {I/O} for Partitioned Solver
Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "377--395",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000302",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Wylie:2010:LSP,
author = "Brian J. N. Wylie and Markus Geimer and Bernd Mohr and
David B{\"o}Hme and Zolt{\'a}N Szebenyi and Felix
Wolf",
title = "Large-Scale Performance Analysis of {Sweep$3$D} with
the {Scalasca Toolset}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "397--414",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000314",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2010:AIV,
author = "Anonymous",
title = "Author Index Volume 20",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "4",
pages = "415--417",
month = dec,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000314",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:05 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2011:ENa,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "1--1",
month = mar,
year = "2011",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ceres:2011:FTS,
author = "Pietro Ceres and Raffaele Ceres",
title = "On the Fault-Tolerance and Size of {WDM} Optical
Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "3--12",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000023",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Robertazzi:2011:PFS,
author = "Thomas G. Robertazzi",
title = "A Product Form Solution for Tree Networks with
Divisible Loads",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "13--20",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000035",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lee:2011:TAT,
author = "Cheng-Chi Lee and Chun-Ta Li and Shun-Der Chen",
title = "Two Attacks on a Two-Factor User Authentication in
Wireless Sensor Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "21--26",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000047",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Pan:2011:TCR,
author = "Tien-Tai Pan and Shun-Shii Lin",
title = "The Transitive Closure and Related Algorithms of
Digraph on the Reconfigurable Architecture",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "27--43",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000059",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Balaji:2011:MMC,
author = "Pavan Balaji and Darius Buntinas and David Goodell and
William Gropp and Torsten Hoefler and Sameer Kumar and
Ewing Lusk and Rajeev Thakur and Jesper Larsson
Tr{\"a}ff",
title = "{MPI} on Millions of Cores",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "45--60",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000060",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cheng:2011:SAA,
author = "Eddie Cheng and Ke Qiu and Zhizhang Shen",
title = "On the Surface Areas and Average Distances of Meshes
and Tori",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "61--75",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000072",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Tzeng:2011:BVM,
author = "Shiang-Feng Tzeng and Cheng-Chi Lee and Min-Shiang
Hwang",
title = "A Batch Verification for Multiple Proxy Signature",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "77--84",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000084",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Alves:2011:HLC,
author = "Marco A. Z. Alves and Henrique C. Freitas and Philippe
O. A. Navaux",
title = "High Latency and Contention on Shared {L2}-Cache for
Many-Core Architectures",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "85--106",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000096",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2011:ENb,
author = "Anonymous",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "107--107",
month = jun,
year = "2011",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dongarra:2011:GEN,
author = "Jack Dongarra and Bernard Tourancheau",
title = "{Guest Editors}' Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "109--109",
month = jun,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000114",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cappello:2011:PMV,
author = "Franck Cappello and Henri Casanova and Yves Robert",
title = "Preventive Migration vs. Preventive Checkpointing for
Extreme Scale Supercomputers",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "111--132",
month = jun,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000126",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Orgerie:2011:EEE,
author = "Anne-Cecile Orgerie and Laurent Lefevre",
title = "{Eridis}: Energy-Efficient Reservation Infrastructure
for Large-Scale Distributed Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "133--154",
month = jun,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000138",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Walker:2011:APG,
author = "Coral Walker and Dashan Lu and David W. Walker",
title = "Automatic Portal Generation Based on Workflow
Description",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "155--171",
month = jun,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641100014X",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Duran:2011:OPP,
author = "Alejandro Duran and Eduard Ayguad{\'e} and Rosa M.
Badia and Jes{\'u}s Labarta and Luis Martinell and
Xavier Martorell and Judit Planas",
title = "{OmpSs}: a proposal for programming heterogeneous
multi-core architectures",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "173--193",
month = jun,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000151",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Clarke:2011:DLB,
author = "David Clarke and Alexey Lastovetsky and Vladimir
Rychkov",
title = "Dynamic Load Balancing of Parallel Computational
Iterative Routines on Highly Heterogeneous {HPC}
Platforms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "195--217",
month = jun,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000163",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Oprescu:2011:BEC,
author = "Ana-Maria Oprescu and Thilo Kielmann and Haralambie
Leahu",
title = "Budget Estimation and Control for Bag-Of-Tasks
Scheduling in Clouds",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "219--243",
month = jun,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000175",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Merrill:2011:HPS,
author = "Duane Merrill and Andrew Grimshaw",
title = "High Performance and Scalable Radix Sorting: a Case
Study of Implementing Dynamic Parallelism for {GPU}
Computing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "2",
pages = "245--272",
month = jun,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000187",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:07 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2011:TAI,
author = "Selim G. Akl",
title = "Twentieth Anniversary Issue: Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "3",
pages = "273--273",
month = sep,
year = "2011",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:08 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Weems:2011:GEN,
author = "Charles C. Weems and Darren J. Kerbyson and Ram
Rajamony",
title = "{Guest Editor}'s Note: Large-Scale Parallel
Processing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "3",
pages = "275--277",
month = sep,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000217",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:08 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Chung:2011:HMH,
author = "I-Hsin Chung and Che-Rung Lee and Jiazheng Zhou and
Yeh-Ching Chung",
title = "Hierarchical Mapping for {HPC} Applications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "3",
pages = "279--299",
month = sep,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000229",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:08 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kerbyson:2011:MPD,
author = "Darren J. Kerbyson and Kevin J. Barker",
title = "Modeling the Performance of Direct Numerical
Simulation on Parallel Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "3",
pages = "301--318",
month = sep,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000230",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:08 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Sun:2011:PAP,
author = "Yanhua Sun and Gengbin Zheng and Pritish Jetley and
Laxmikant V. Kale",
title = "{Parssse}: an Adaptive Parallel State Space Search
Engine",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "3",
pages = "319--338",
month = sep,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000242",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:08 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Schubert:2011:HPS,
author = "Gerald Schubert and Holger Fehske and Georg Hager and
Gerhard Wellein",
title = "Hybrid-Parallel Sparse Matrix-Vector Multiplication
with Explicit Communication Overlap on Current
Multicore-Based Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "3",
pages = "339--358",
month = sep,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000254",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:08 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Emmart:2011:HPI,
author = "Niall Emmart and Charles C. Weems",
title = "High Precision Integer Multiplication with a {GPU}
Using {Strassen}'s Algorithm with Multiple {FFT}
Sizes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "3",
pages = "359--375",
month = sep,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000266",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:08 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
note = "See earlier work \cite{Emmart:2010:HPI}.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "The abstract reports an improvement (GPU compared to
GMP) of 13.9x to 19x for multiplication with operands
of 255Kbits to 16320Kbits, compared to earlier work
\cite{Emmart:2010:HPI}.",
}
@Article{Akl:2011:EN,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "4",
pages = "377--377",
month = dec,
year = "2011",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:09 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Varghese:2011:CAI,
author = "Blesson Varghese and Gerard Mckee and Vassil
Alexandrov",
title = "Can Agent Intelligence Be Used to Achieve Fault
Tolerant Parallel Computing Systems?",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "4",
pages = "379--396",
month = dec,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641100028X",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:09 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Diakite:2011:PSS,
author = "S{\'e}kou Diakit{\'e} and Loris Marchal and Jean-Marc
Nicod and Laurent Philippe",
title = "Practical Steady-State Scheduling for Tree-Shaped Task
Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "4",
pages = "397--412",
month = dec,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000291",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:09 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Uddin:2011:HLS,
author = "M. Irfan Uddin and Michiel W. {Van Tol} and Chris R.
Jesshope",
title = "High Level Simulation of {SVP} Many-Core Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "4",
pages = "413--438",
month = dec,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000308",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:09 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gamboa:2011:SPB,
author = "Carlos Fernando Gamboa and Thomas Robertazzi",
title = "Simple Performance Bounds for Multicore and Parallel
Channel Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "4",
pages = "439--460",
month = dec,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641100031X",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:09 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Banu:2011:ADE,
author = "Nazreen Banu and Taisuke Izumi and Koichi Wada",
title = "Adaptive and Doubly-Expedited One-Step Consensus in
{Byzantine} Asynchronous Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "4",
pages = "461--477",
month = dec,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000321",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:09 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2011:AIV,
author = "Anonymous",
title = "Author Index Volume 21",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "4",
pages = "479--481",
month = dec,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000321",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:09 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2012:ENa,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1201001",
month = mar,
year = "2012",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "1",
}
@Article{Fragopoulou:2012:GEN,
author = "Paraskevi Fragopoulou and Artur Andrzejak and Carlo
Mastroianni and Costas Panagiotakis",
title = "Guest Editors' Note: Special Issue on Community
Structures in Networks: Methods and Applications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1202001",
month = mar,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641202001X",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "2",
}
@Article{Pollner:2012:PCC,
author = "Peter Pollner and Gergely Palla and Tamas Vicsek",
title = "Parallel Clustering with {CFinder}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1240001",
month = mar,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400014",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "10",
}
@Article{Brahim:2012:DCS,
author = "Abdelhamid Salah Brahim and B{\'e}n{\'e}dicte {Le
Grand} and Matthieu Latapy",
title = "Diffusion Cascades: Spreading Phenomena in Blog
Network Communities",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1240002",
month = mar,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400026",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "16",
}
@Article{Papadakis:2012:LCR,
author = "Harris Papadakis and Costas Panagiotakis and Paraskevi
Fragopoulou",
title = "Locating Communities on Real Dataset Graphs Using
Synthetic Coordinates",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1240003",
month = mar,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400038",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "11",
}
@Article{Ngonmang:2012:LCI,
author = "Blaise Ngonmang and Maurice Tchuente and Emmanuel
Viennet",
title = "Local Community Identification in Social Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1240004",
month = mar,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641240004X",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "16",
}
@Article{Phoha:2012:DFD,
author = "Shashi Phoha and Goutham Mallapragada and Yicheng Wen
and Doina Bein and Asok Ray",
title = "Designing a Fusion-Driven Sensor Network to
Selectively Track Mobile Targets",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1250001",
month = mar,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500016",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "15",
}
@Article{Anta:2012:RIB,
author = "Antonio Fern{\'a}ndez Anta and Chryssis Georgiou and
Luis L{\'o}pez and Agust{\'\i}n Santos",
title = "Reliable {Internet}-Based Master-Worker Computing in
the Presence of Malicious Workers",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1250002",
month = mar,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500028",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "17",
}
@Article{Stewart:2012:CCR,
author = "Iain A. Stewart",
title = "On the Computational Complexity of Routing in Faulty
{$K$}-Ary {$N$}-Cubes and Hypercubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "1",
pages = "1250003",
month = mar,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641250003X",
ISSN = "0129-6264",
bibdate = "Fri Apr 13 07:56:18 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
pagecount = "13",
}
@Article{Akl:2012:ENb,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1201002",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412010025",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hains:2012:GEN,
author = "Ga{\'e}tan Hains and Fr{\'e}d{\'e}ric Gava and Kevin
Hammond",
title = "{Guest Editors}' Note: High-Level Programming for
Heterogeneous and Hierarchical Parallel Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1202002",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412020021",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Collins:2012:ATP,
author = "Alexander Collins and Christian Fensch and Hugh
Leather",
title = "Auto-Tuning Parallel Skeletons",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1240005",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400051",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Aldinucci:2012:THA,
author = "M. Aldinucci and M. Danelutto and P. Kilpatrick and M.
Torquati",
title = "Targeting Heterogeneous Architectures Via Macro Data
Flow",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1240006",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400063",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bourgoin:2012:SGP,
author = "Mathias Bourgoin and Emmanuel Chailloux and Jean-Luc
Lamotte",
title = "{SPOC}: {GPGPU} Programming Through Stream Processing
with {OCaml}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1240007",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400075",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Garba:2012:APU,
author = "Michael T. Garba and Horacio Gonz{\'a}lez-V{\'e}lez",
title = "Asymptotic Peak Utilisation in Heterogeneous Parallel
{CPU\slash GPU} Pipelines: a Decentralised Queue
Monitoring Strategy",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1240008",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400087",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Senger:2012:BSB,
author = "Hermes Senger and Fabr{\'i}cio Alves {Barbosa Da
Silva}",
title = "Bounds on the Scalability of Bag-Of-Tasks Applications
Running on Master-Slave Platforms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1250004",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500041",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cheng:2012:MPC,
author = "Eddie Cheng and Sachin Padmanabhan",
title = "Matching Preclusion and Conditional Matching
Preclusion for Crossed Cubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1250005",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500053",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ooshita:2012:PMO,
author = "Fukuhito Ooshita and Tomoko Izumi and Taisuke Izumi",
title = "The Price of Multi-Organization Constraint in
Unrelated Parallel Machine Scheduling",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "2",
pages = "1250006",
month = jun,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500065",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:49 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2012:ENc,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1201003",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412010037",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Stannett:2012:GEN,
author = "Mike Stannett",
title = "{Guest Editor}'s Note: Special Issue on
Hypercomputation, Physics and Computation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1202003",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412020033",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Szabo:2012:MFP,
author = "L{\'a}szl{\'o} E. Szab{\'o}",
title = "Mathematical Facts in a Physicalist Ontology",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1240009",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400099",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Andreka:2012:CTC,
author = "Hajnal Andr{\'e}ka and Istv{\'a}n N{\'e}meti and
Gergely Sz{\'e}kely",
title = "Closed Timelike Curves in Relativistic Computation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1240010",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400105",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Andreka:2012:DUG,
author = "Hajnal Andr{\'e}ka and Judit Madar{\'a}sz and
Istv{\'a}n N{\'e}meti",
title = "Decidability, Undecidability, and {G{\"o}del}'s
Incompleteness in Relativity Theories",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1240011",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400117",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Govindarajulu:2012:MMH,
author = "Naveen Sundar Govindarajulu and Selmer Bringsjord",
title = "The Myth of `the Myth of Hypercomputation'",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1240012",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400129",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Maclennan:2012:ECA,
author = "Bruce J. Maclennan",
title = "Embodied Computation: Applying the Physics of
Computation to Artificial Morphogenesis",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1240013",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412400130",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Rodriguez:2012:EMH,
author = "Pedro Rodr{\'i}guez and Mar{\'i}a Cecilia Rivara and
Isaac D. Scherson",
title = "Exploiting the Memory Hierarchy of Multicore Systems
for Parallel Triangulation Refinement",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1250007",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500077",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dehne:2012:DSS,
author = "Frank Dehne and Hamidreza Zaboli",
title = "Deterministic Sample Sort for {GPUs}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1250008",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500089",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Madanayake:2012:BPS,
author = "H. L. P. Arjuna Madanayake and R. J. Cintra and V. S.
Dimitrov and L. T. Bruton",
title = "Block-Parallel Systolic-Array Architecture for {$2$-D}
{NTT}-Based Fragile Watermark Embedding",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1250009",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500090",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
keywords = "NTT (number theoretic transform)",
}
@Article{Akl:2012:EN,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "4",
pages = "1201004",
month = dec,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412010049",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:17 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grosser:2012:PPP,
author = "Tobias Grosser and Armin Groesslinger and Christian
Lengauer",
title = "{Polly} --- Performing Polyhedral Optimizations on a
Low-Level Intermediate Representation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "4",
pages = "1250010",
month = dec,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500107",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:17 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Salem:2012:CBP,
author = "Fatima K. Abu Salem and Lama B. Tamim",
title = "Communication Balancing in the Parallel {G{\"o}ttfert}
Algorithm",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "4",
pages = "1250011",
month = dec,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500119",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:17 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Wei:2012:OLL,
author = "Zheng Wei and Joseph Jaja",
title = "Optimization of Linked List Prefix Computations on
Multithreaded {GPUs} Using {CUDA}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "4",
pages = "1250012",
month = dec,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500120",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:17 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Xiao:2012:CDC,
author = "Wenjun Xiao and Huomin Liang and Behrooz Parhami",
title = "A Class of Data-Center Network Models Offering
Symmetry, Scalability, and Reliability",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "4",
pages = "1250013",
month = dec,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500132",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:17 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dumrauf:2012:CNE,
author = "Dominic Dumrauf and Burkhard Monien",
title = "Computing {Nash} Equilibria for Two-Player Restricted
Network Congestion Games Is {$\cal PLS$}-Complete",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "4",
pages = "1250014",
month = dec,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500144",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:17 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Mishra:2012:RSA,
author = "Pramod Kumar Mishra and Kamal Sheel Mishra and
Abhishek Mishra and Anil Kumar Tripathi",
title = "A Randomized Scheduling Algorithm for Multiprocessor
Environments",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "4",
pages = "1250015",
month = dec,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500156",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:17 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2012:AIV,
author = "Anonymous",
title = "Author Index Volume 22",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "4",
pages = "1299001",
month = dec,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412990010",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:17 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2013:ENa,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "1",
pages = "1301001",
month = mar,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413010019",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:27 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hedetniemi:2013:SSA,
author = "Sandra M. Hedetniemi and Stephen T. Hedetniemi and K.
E. Kennedy and Alice A. Mcrae",
title = "Self-Stabilizing Algorithms for Unfriendly Partitions
into Two Disjoint Dominating Sets",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "1",
pages = "1350001",
month = mar,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500011",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:27 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dehne:2013:PCD,
author = "Frank Dehne and Hamidreza Zaboli",
title = "Parallel Construction of Data Cubes on Multi-Core
Multi-Disk Platforms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "1",
pages = "1350002",
month = mar,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500023",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:27 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Goraya:2013:FTT,
author = "Major Singh Goraya and Lakhwinder Kaur",
title = "Fault Tolerance Task Execution Through Cooperative
Computing in Grid",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "1",
pages = "1350003",
month = mar,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500035",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:27 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cheng:2013:CMP,
author = "Eddie Cheng and L{\'a}szl{\'o} Lipt{\'a}k",
title = "Conditional Matching Preclusion for $ (n, k) $-Star
Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "1",
pages = "1350004",
month = mar,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500047",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:27 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Syropoulos:2013:HFR,
author = "Apostolos Syropoulos",
title = "Hypercomputation: Fantasy Or Reality? a Position
Paper",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "1",
pages = "1350005",
month = mar,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500059",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:27 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Reza:2013:RMI,
author = "Sajjid Reza and Gregory T. Byrd",
title = "Reducing Migration-Induced Misses in an
Over-Subscribed Multiprocessor System",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "1",
pages = "1350006",
month = mar,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500060",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:27 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Calude:2013:ICP,
author = "Cristian S. Calude and Elena Calude and Melissa S.
Queen",
title = "Inductive Complexity of the {P} Versus {NP} Problem",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "1",
pages = "1350007",
month = mar,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500072",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Jun 22 15:54:27 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2013:ENb,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "2",
pages = "1301002",
month = jun,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413010020",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:51:02 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dongarra:2013:GEN,
author = "Jack Dongarra and Bernard Tourancheau",
title = "{Guest Editors}' Note: Special Issue on Clusters,
Clouds, and Data for Scientific Computing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "2",
pages = "1302001",
month = jun,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413020015",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:51:02 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Shantharam:2013:SAC,
author = "Manu Shantharam and Youngtae Youn and Padma Raghavan",
title = "Speedup-Aware Co-Schedules for Efficient Workload
Management",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "2",
pages = "1340001",
month = jun,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641340001X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:51:02 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Slawinski:2013:TCU,
author = "Jaroslaw Slawinski and Vaidy Sunderam",
title = "Towards Computing As a Utility Via Adaptive
Middleware: an Experiment in Cross-Paradigm Execution",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "2",
pages = "1340002",
month = jun,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400021",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:51:02 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Benoit:2013:APE,
author = "Anne Benoit and Rami Melhem and Paul Renaud-Goud and
Yves Robert",
title = "Assessing the Performance of Energy-Aware Mappings",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "2",
pages = "1340003",
month = jun,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400033",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:51:02 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Deelman:2013:HSM,
author = "Ewa Deelman and Gideon Juve and Maciej Malawski and
Jarek Nabrzyski",
title = "Hosted Science: Managing Computational Workflows in
the Cloud",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "2",
pages = "1340004",
month = jun,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400045",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:51:02 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grimshaw:2013:GXG,
author = "Andrew Grimshaw and Mark Morgan and Avinash
Kalyanaraman",
title = "{GFFS} --- the {XSEDE} {Global Federated File
System}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "2",
pages = "1340005",
month = jun,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400057",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:51:02 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
keywords = "eXtreme Science and Engineering Discovery Environment
(XSEDE) program; Global Federated File System (GFFS)",
}
@Article{Fox:2013:RSV,
author = "Geoffrey Fox",
title = "Robust Scalable Visualized Clustering in Vector and
Non Vector Semi-Metric Spaces",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "2",
pages = "1340006",
month = jun,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400069",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:51:02 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2013:ENc,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "3",
pages = "1301003",
month = sep,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413010032",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:31 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhao:2013:PMP,
author = "Di Zhao and Shenghua Ni",
title = "Parallel multi-proposal and multi-chain {MCMC} for
calculating $p$-value of genome-wide association
study",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "3",
pages = "1350008",
month = sep,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500084",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:31 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Chong:2013:ASG,
author = "Song-Kong Chong and Cheng-Chi Lee and Min-Shiang
Hwang",
title = "An Authentication Scheme for the Global Mobility
Network",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "3",
pages = "1350009",
month = sep,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500096",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:31 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Page:2013:PAS,
author = "Daniel R. Page",
title = "Parallel Algorithm for Second-Order Restricted Weak
Integer Composition Generation for Shared Memory
Machines",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "3",
pages = "1350010",
month = sep,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500102",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:31 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cheng:2013:GCG,
author = "Eddie Cheng and Nart Shawash",
title = "The {$ Q_{n, k, m} $} Graph: a Common Generalization
of Various Popular Interconnection Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "3",
pages = "1350011",
month = sep,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500114",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:31 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Thabtah:2013:MAM,
author = "Fadi Thabtah and Suhel Hammoud",
title = "{MR-ARM}: a {Map-Reduce} Association Rule Mining
Framework",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "3",
pages = "1350012",
month = sep,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500126",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:31 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2013:ENd,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "4",
pages = "1301004",
month = dec,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413010044",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:39 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Weems:2013:GEN,
author = "Charles C. Weems and Darren J. Kerbyson and Ram
Rajamony",
title = "{Guest Editors}' Note: Large-Scale Parallel
Processing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "4",
pages = "1302002",
month = dec,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413020027",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:39 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kerbyson:2013:PAT,
author = "Darren J. Kerbyson and Kevin J. Barker and Diego S.
Gallo and Dong Chen and Jose R. Brunheroto and Kyung
Dong Ryu and George L. Chiu and Adolfy Hoisie",
title = "A Performance Analysis of Three Generations of {Blue
Gene}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "4",
pages = "1340007",
month = dec,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400070",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:39 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
http://www.math.utah.edu/pub/tex/bib/super.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Carrington:2013:CLS,
author = "Laura Carrington and Michael Laurenzano and Ananta
Tiwari",
title = "Characterizing Large-Scale {HPC} Applications Through
Trace Extrapolation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "4",
pages = "1340008",
month = dec,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400082",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:39 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Emmart:2013:SBA,
author = "Niall Emmart and Charles Weems",
title = "Search-Based Automatic Code Generation for
Multiprecision Modular Exponentiation on Multiple
Generations of {GPU}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "4",
pages = "1340009",
month = dec,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400094",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:39 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Barrett:2013:RBB,
author = "R. F. Barrett and C. T. Vaughan and S. D. Hammond and
D. Roweth",
title = "Reducing the Bulk in the Bulk Synchronous Parallel
Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "4",
pages = "1340010",
month = dec,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400100",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:39 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Shahzad:2013:SCR,
author = "Faisal Shahzad and Markus Wittmann and Moritz Kreutzer
and Thomas Zeiser and Georg Hager and Gerhard Wellein",
title = "A Survey of Checkpoint\slash Restart Techniques on
Distributed Memory Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "4",
pages = "1340011",
month = dec,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413400112",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:39 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2013:AIV,
author = "Anonymous",
title = "Author Index Volume 23",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "4",
pages = "1399001",
month = dec,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413990016",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:39 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2014:ENa,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "1",
pages = "1401001",
month = mar,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414010014",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Apr 2 06:30:59 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Abdelhamid:2014:MLR,
author = "Neda Abdelhamid and Aladdin Ayesh and Wael Hadi",
title = "Multi-Label Rules Algorithm Based Associative
Classification",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "1",
pages = "1450001",
month = mar,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414500017",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Apr 2 06:30:59 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kawai:2014:ADT,
author = "Shinji Kawai and Fukuhito Ooshita and Hirotsugu
Kakugawa and Toshimitsu Masuzawa",
title = "Analysis of Distributed Token Circulation Algorithm
with Faulty Random Number Generator",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "1",
pages = "1450002",
month = mar,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414500029",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Apr 2 06:30:59 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
http://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lapillonne:2014:UCD,
author = "Xavier Lapillonne and Oliver Fuhrer",
title = "Using Compiler Directives to Port Large Scientific
Applications to {GPUs}: An Example from Atmospheric
Science",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "1",
pages = "1450003",
month = mar,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414500030",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Apr 2 06:30:59 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lucas:2014:PIF,
author = "Andrew Lucas and Mark Stalzer and John Feo",
title = "Parallel Implementation of Fast Randomized Algorithms
for Low Rank Matrix Decomposition",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "1",
pages = "1450004",
month = mar,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414500042",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Apr 2 06:30:59 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Siebert:2014:PLB,
author = "Christian Siebert and Jesper Larsson Tr{\"a}ff",
title = "Perfectly Load-Balanced, Stable, Synchronization-Free
Parallel Merge",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "1",
pages = "1450005",
month = mar,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414500054",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Apr 2 06:30:59 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2014:ENb,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "2",
pages = "1401002",
month = jun,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414010026",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Sep 10 07:02:42 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dediu:2014:GEN,
author = "Adrian-Horia Dediu and Carlos Mart{\'\i}n-Vide and
Bianca Truthe",
title = "{Guest Editors}' Note --- Special Issue: {First
International Conference on the Theory and Practice of
Natural Computing, TPNC 2012}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "2",
pages = "1402001",
month = jun,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414020010",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Sep 10 07:02:42 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Garzon:2014:DCD,
author = "Max H. Garzon",
title = "{DNA} Codeword Design: Theory and Applications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "2",
pages = "1440001",
month = jun,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414400015",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Sep 10 07:02:42 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kmet:2014:NNS,
author = "Tibor Kmet",
title = "Neural Networks Solving Free and Fixed Final Time
Optimal Control Problems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "2",
pages = "1440002",
month = jun,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414400027",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Sep 10 07:02:42 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kucevalovs:2014:ITL,
author = "Ilja Kucevalovs and Oj{\=a}rs Krasts and
R{\=u}si{\c{n}}{\v{s}} Freivalds and Thomas Zeugmann",
title = "On the Influence of Technology on Learning Processes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "2",
pages = "1440003",
month = jun,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414400039",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Sep 10 07:02:42 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Spirov:2014:EDG,
author = "A. V. Spirov and E. A. Zagriychuk and D. M. Holloway",
title = "Evolutionary Design of Gene Networks: Forced Evolution
by Genomic Parasites",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "2",
pages = "1440004",
month = jun,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414400040",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Wed Sep 10 07:02:42 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2014:EN,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "3",
pages = "1401003",
month = sep,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414010038",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:13 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grosslinger:2014:GEN,
author = "Armin Gr{\"o}{\ss}linger and Harald K{\"o}stler",
title = "{Guest Editors}' Note: Special Issue On
High-Performance Stencil Computations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "3",
pages = "1402002",
month = sep,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414020022",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:13 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grebhahn:2014:EOP,
author = "Alexander Grebhahn and Sebastian Kuckuk and Christian
Schmitt and Harald K{\"o}stler and Norbert Siegmund and
Sven Apel and Frank Hannig and J{\"u}rgen Teich",
title = "Experiments on Optimizing the Performance of Stencil
Codes with {SPL} Conqueror",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "3",
pages = "1441001",
month = sep,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414410011",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:13 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Grosser:2014:RBD,
author = "Tobias Grosser and Sven Verdoolaege and Albert Cohen
and P. Sadayappan",
title = "The Relation Between Diamond Tiling and Hexagonal
Tiling",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "3",
pages = "1441002",
month = sep,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414410023",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:13 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Koster:2014:CRS,
author = "Marcel K{\"o}ster and Roland Lei{\ss}a and Sebastian
Hack and Richard Membarth and Philipp Slusallek",
title = "Code Refinement of Stencil Codes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "3",
pages = "1441003",
month = sep,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414410035",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:13 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kronawitter:2014:DSO,
author = "Stefan Kronawitter and Holger Stengel and Georg Hager
and Christian Lengauer",
title = "Domain-Specific Optimization of Two {Jacobi} Smoother
Kernels and Their Evaluation in the {ECM} Performance
Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "3",
pages = "1441004",
month = sep,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414410047",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:13 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Steuwer:2014:HLP,
author = "Michel Steuwer and Michael Haidl and Stefan Breuer and
Sergei Gorlatch",
title = "High-Level Programming of Stencil Computations on
Multi-{GPU} Systems Using the {SkelCL} Library",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "3",
pages = "1441005",
month = sep,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414410059",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:13 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Weinzierl:2014:BFD,
author = "Tobias Weinzierl and Michael Bader and Kristof
Unterweger and Roland Wittmann",
title = "Block Fusion on Dynamically Adaptive Spacetree Grids
for Shallow Water Waves",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "3",
pages = "1441006",
month = sep,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414410060",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:13 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2014:DIE,
author = "Selim G. Akl",
title = "{December} Issue 2014 Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1401004",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641401004X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Weems:2014:GEN,
author = "Charles C. Weems and Darren J. Kerbyson and Ram
Rajamony",
title = "{Guest Editors}' Note: Special Issue on Large-Scale
Parallel Processing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1402003",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414020034",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Li:2014:EPP,
author = "Bo Li and Hung-Ching Chang and Shuaiwen Song and
Chun-Yi Su and Timmy Meyer and John Mooring and Kirk
Cameron",
title = "Extending {PowerPack} for Profiling and Analysis of
High-Performance Accelerator-Based Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1442001",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414420018",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Leidel:2014:HSS,
author = "John D. Leidel and Yong Chen",
title = "{HMC-SIM}: A Simulation Framework for Hybrid Memory
Cube Devices",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1442002",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641442002X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gioiosa:2014:OMS,
author = "Roberto Gioiosa and Gokcen Kestor and Darren J.
Kerbyson",
title = "Online Monitoring Systems for Performance Fault
Detection",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1442003",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414420031",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yamazaki:2014:DIL,
author = "Ichitaro Yamazaki and Jakub Kurzak and Piotr Luszczek
and Jack Dongarra",
title = "Design and Implementation of a Large Scale Tree-Based
{QR} Decomposition Using a {$3$D} Virtual Systolic
Array and a Lightweight Runtime",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1442004",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414420043",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lin:2014:TES,
author = "Paul Lin and Matthew Bettencourt and Stefan Domino and
Travis Fisher and Mark Hoemmen and Jonathan Hu and Eric
Phipps and Andrey Prokopenko and Sivasankaran
Rajamanickam and Christopher Siefert and Stephen
Kennon",
title = "Towards Extreme-Scale Simulations for Low {Mach}
Fluids with Second-Generation {Trilinos}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1442005",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414420055",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Alkowaileet:2014:NAM,
author = "Wail Y. Alkowaileet and David Carrillo-Cisneros and
Robert V. Lim and Isaac D. Scherson",
title = "{NUMA}-Aware Multicore Matrix Multiplication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1450006",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414500066",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2014:AIV,
author = "Anonymous",
title = "Author Index Volume 24",
journal = j-PARALLEL-PROCESS-LETT,
volume = "24",
number = "4",
pages = "1499001",
month = dec,
year = "2014",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626414990011",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Fri Feb 13 13:51:16 MST 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2015:EN,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1501001",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641501001X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Adamatzky:2015:GEN,
author = "Andrew Adamatzky",
title = "{Guest Editors}' Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1502001",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415020016",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Fratto:2015:BCR,
author = "Brian E. Fratto and Nataliia Guz and Evgeny Katz",
title = "Biomolecular Computing Realized in Parallel Flow
Systems: Enzyme-Based Double {Feynman} Logic Gate",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1540001",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415400010",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Moles:2015:DLC,
author = "Josh Moles and Peter Banda and Christof Teuscher",
title = "Delay Line as a Chemical Reaction Network",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1540002",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415400022",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Costello:2015:CVD,
author = "Ben De Lacy Costello",
title = "Calculating {Voronoi} Diagrams Using Simple Chemical
Reactions",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1540003",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415400034",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jones:2015:MIP,
author = "Jeff Jones",
title = "Mechanisms Inducing Parallel Computation in a Model of
{{\em Physarum polycephalum\/}} Transport Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1540004",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415400046",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhang:2015:PIA,
author = "Xiaoge Zhang and Sankaran Mahadevan and Yong Deng",
title = "{\em {Physarum\/}}-Inspired Applications in
Graph-Optimization Problems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1540005",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415400058",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dourvas:2015:HAC,
author = "Nikolaos Dourvas and Michail-Antisthenis Tsompanas and
Georgios Ch. Sirakoulis and Philippos Tsalides",
title = "Hardware Acceleration of Cellular Automata {{\em
Physarum polycephalum\/}} Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1540006",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641540006X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Costa:2015:UT,
author = "Jos{\'e} F{\'e}lix Costa",
title = "Uncertainty in Time",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1540007",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415400071",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Schumann:2015:TCB,
author = "Andrew Schumann",
title = "Towards Context-Based Concurrent Formal Theories",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "1",
pages = "1540008",
month = mar,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415400083",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu May 28 17:08:02 MDT 2015",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2015:ENa,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "2",
pages = "1501002",
month = jun,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415010021",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:24 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kari:2015:WCS,
author = "Chadi Kari and Alexander Russell and Narasimha
Shashidhar",
title = "Work-Competitive Scheduling on Task Dependency
Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "2",
pages = "1550001",
month = jun,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500012",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:24 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Thabtah:2015:PAC,
author = "Fadi Thabtah and Suhel Hammoud and Hussein
Abdel-Jaber",
title = "Parallel Associative Classification Data Mining
Frameworks Based {MapReduce}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "2",
pages = "1550002",
month = jun,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500024",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:24 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Becka:2015:NDO,
author = "Martin Be{\v{c}}ka and Gabriel Ok{\v{s}}a and
Mari{\'a}n Vajter{\v{s}}ic",
title = "New Dynamic Orderings for the Parallel One--Sided
Block-{Jacobi} {SVD} Algorithm",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "2",
pages = "1550003",
month = jun,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500036",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:24 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Ribeiro:2015:FEE,
author = "Roberto Ribeiro and Jo{\~a}o Barbosa and Lu{\'\i}s
Paulo Santos",
title = "A Framework for Efficient Execution of Data Parallel
Irregular Applications on Heterogeneous Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "2",
pages = "1550004",
month = jun,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500048",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:24 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Sharma:2015:DQD,
author = "Gokarna Sharma and Costas Busch",
title = "Distributed Queuing in Dynamic Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "2",
pages = "1550005",
month = jun,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641550005X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:24 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Akl:2015:ENb,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "3",
pages = "1501003",
month = sep,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415010033",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:25 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dongarra:2015:GEN,
author = "Jack Dongarra and Bernard Tourancheau",
title = "{Guest Editors}' Note: Special Issue on Clusters,
Clouds and Data for Scientific Computing",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "3",
pages = "1502002",
month = sep,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415020028",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:25 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Obrecht:2015:PEO,
author = "Christian Obrecht and Bernard Tourancheau and
Fr{\'e}d{\'e}ric Kuznik",
title = "Performance Evaluation of an {OpenCL} Implementation
of the {Lattice Boltzmann Method} on the {Intel Xeon
Phi}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "3",
pages = "1541001",
month = sep,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415410017",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:25 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
http://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Casanova:2015:TMS,
author = "Henri Casanova and Anshul Gupta and Fr{\'e}d{\'e}ric
Suter",
title = "Toward More Scalable Off-Line Simulations of {MPI}
Applications",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "3",
pages = "1541002",
month = sep,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415410029",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:25 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
http://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{daSilva:2015:OTR,
author = "Rafael Ferreira da Silva and Gideon Juve and Mats
Rynge and Ewa Deelman and Miron Livny",
title = "Online Task Resource Consumption Prediction for
Scientific Workflows",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "3",
pages = "1541003",
month = sep,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415410030",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:25 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Georgakoudis:2015:IQS,
author = "Giorgis Georgakoudis and Charles Gillan and Ahmed
Sayed and Ivor Spence and Richard Faloon and Dimitrios
S. Nikolopoulos",
title = "Iso-Quality of Service: Fairly Ranking Servers for
Real-Time Data Analytics",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "3",
pages = "1541004",
month = sep,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415410042",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:25 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Filip:2015:BEA,
author = "Alexandra Vintila Filip and Ana-Maria Oprescu and
Stefania Costache and Thilo Kielmann",
title = "{E-BaTS}: Energy-Aware Scheduling for Bag-of-Task
Applications in {HPC} Clusters",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "3",
pages = "1541005",
month = sep,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415410054",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:25 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Villebonnet:2015:BML,
author = "Violaine Villebonnet and Georges {Da Costa} and
Laurent Lefevre and Jean-Marc Pierson and Patricia
Stolf",
title = "``{Big}, Medium, Little'': Reaching Energy
Proportionality with Heterogeneous Computing
Scheduler",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "3",
pages = "1541006",
month = sep,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415410066",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:25 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Akl:2015:ENc,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "4",
pages = "1501004",
month = dec,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415010045",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:26 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Medarametla:2015:LME,
author = "Dhruv Medarametla and Eddie Cheng and Steven Cheng and
Lawrance Wu",
title = "Linearly Many Edge-Faults in $2$-Bijective Connection
Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "4",
pages = "1550006",
month = dec,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500061",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:26 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Merry:2015:PCS,
author = "Bruce Merry",
title = "A Performance Comparison of Sort and Scan Libraries
for {GPUs}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "4",
pages = "1550007",
month = dec,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500073",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:26 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Rajasingh:2015:LTA,
author = "Indra Rajasingh and R. Sundara Rajan and Paul Manuel",
title = "A Linear Time Algorithm for Embedding {Christmas}
Trees into Certain Trees",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "4",
pages = "1550008",
month = dec,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500085",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:26 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gopalan:2015:MDS,
author = "N. P. Gopalan and S. Suresh",
title = "Modified Delay Scheduling: A Heuristic Approach for
{Hadoop} Scheduling to Improve Fairness and Response
Time",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "4",
pages = "1550009",
month = dec,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500097",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:26 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jain:2015:SSP,
author = "Surabhi Jain and N. Sadagopan",
title = "Simpler Sequential and Parallel Biconnectivity
Augmentation in Trees",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "4",
pages = "1550010",
month = dec,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500103",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:26 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ding:2015:SSA,
author = "Yihua Ding and James Z. Wang and Pradip K. Srimani",
title = "Self-Stabilizing Algorithm for Minimal Dominating Set
with Safe Convergence in an Arbitrary Graph",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "4",
pages = "1550011",
month = dec,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415500115",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:26 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2015:AIV,
author = "Anonymous",
title = "Author Index Volume 25",
journal = j-PARALLEL-PROCESS-LETT,
volume = "25",
number = "4",
pages = "1599001",
month = dec,
year = "2015",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626415990017",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:26 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2016:ENa,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "1",
pages = "1601001",
month = mar,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416010015",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Aupy:2016:AAE,
author = "Guillaume Aupy and Anne Benoit",
title = "Approximation Algorithms for Energy, Reliability, and
Makespan Optimization Problems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "1",
pages = "1650001",
month = mar,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500018",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Mishra:2016:RSA,
author = "Abhishek Mishra and Pramod Kumar Mishra",
title = "A Randomized Scheduling Algorithm for Multiprocessor
Environments Using Local Search",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "1",
pages = "1650002",
month = mar,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641650002X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Maurer:2016:TRB,
author = "Alexandre Maurer and Sebastien Tixeuil",
title = "Tolerating Random {Byzantine} Failures in an Unbounded
Network",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "1",
pages = "1650003",
month = mar,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500031",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Applebaum:2016:CHD,
author = "Benny Applebaum and Dariusz R. Kowalski and Boaz
Patt-Shamir and Adi Ros{\'e}n",
title = "Clique Here: On the Distributed Complexity in
Fully-Connected Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "1",
pages = "1650004",
month = mar,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500043",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Cheng:2016:CDH,
author = "Eddie Cheng and Ke Qiu and Zhizhang Shen",
title = "On the Conditional Diagnosability of Hyper-Buttery
Graphs and Related Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "1",
pages = "1650005",
month = mar,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500055",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Akl:2016:ENb,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "2",
pages = "1601002",
month = jun,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416010027",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Trefftz:2016:ECE,
author = "Christian Trefftz and Hugh McGuire and Zachary Kurmas
and Jerry Scripps",
title = "Exhaustive Community Enumeration in Parallel",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "2",
pages = "1650006",
month = jun,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500067",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Wu:2016:ANG,
author = "Jing Wu and Joseph Jaja",
title = "Achieving Native {GPU} Performance for Out-of-Card
Large Dense Matrix Multiplication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "2",
pages = "1650007",
month = jun,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500079",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Higham:2016:PMC,
author = "Lisa Higham and Jalal Kawash",
title = "Pitfalls in Memory Consistency Modelling",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "2",
pages = "1650008",
month = jun,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500080",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Wang:2016:OSA,
author = "Yang Wang and Wei Shi and Kenneth B. Kent",
title = "On Optimal Scheduling Algorithms for Well-Structured
Workflows in the Cloud with Budget and Deadline
Constraints",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "2",
pages = "1650009",
month = jun,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500092",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Bandyopadhyay:2016:PCA,
author = "Soumyadip Bandyopadhyay and Dipankar Sarkar and
Chittaranjan Mandal and Kunal Banerjee and Krishnam
Raju Duddu",
title = "A Path Construction Algorithm for Translation
Validation Using {PRES+} Models",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "2",
pages = "1650010",
month = jun,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500109",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:27 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Akl:2016:ENc,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "3",
pages = "1601003",
month = sep,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416010039",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:28 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zaichenkov:2016:CBC,
author = "Pavel Zaichenkov and Olga Tveretina and Alex
Shafarenko and Bert Gijsbers and Clemens Grelck",
title = "The Cost and Benefits of Coordination Programming: Two
Case Studies in Concurrent Collections and {S-NET}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "3",
pages = "1650011",
month = sep,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500110",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:28 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Bruda:2016:LCT,
author = "Stefan D. Bruda and Mary Sarah Ruth Wilkin",
title = "Limitations of Coverability Trees for Context-Free
Parallel Communicating Grammar Systems and Why these
Grammar Systems are not Linear Space",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "3",
pages = "1650012",
month = sep,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500122",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:28 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Abdelkafi:2016:SMA,
author = "Omar Abdelkafi and Lhassane Idoumghar and Julien
Lepagnot",
title = "A Survey on the Metaheuristics Applied to {QAP} for
the Graphics Processing Units",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "3",
pages = "1650013",
month = sep,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500134",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:28 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Flatz:2016:PNM,
author = "Markus Flatz and Mari{\'a}n Vajter{\v{s}}ic",
title = "Parallel Nonnegative Matrix Factorization via {Newton}
Iteration",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "3",
pages = "1650014",
month = sep,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500146",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:28 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Crain:2016:FCF,
author = "Tyler Crain and Vincent Gramoli and Michel Raynal",
title = "A Fast Contention-Friendly Binary Search Tree",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "3",
pages = "1650015",
month = sep,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500158",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:28 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2016:ENd,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1601004",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416010040",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gao:2016:NMG,
author = "Jiaquan Gao and Yuanshen Zhou and Kesong Wu",
title = "A Novel Multi-{GPU} Parallel Optimization Model for
The Sparse Matrix-Vector Multiplication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1640001",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416400016",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Fang:2016:EMS,
author = "Jianbin Fang and Peng Zhang and Zhaokui Li and Tao
Tang and Xuhao Chen and Cheng Chen and Canqun Yang",
title = "Evaluating Multiple Streams on Heterogeneous
Platforms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1640002",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416400028",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cohen:2016:SSA,
author = "Johanne Cohen and Jonas Lef{\`e}vre and Khaled
Ma{\^a}mra and Laurence Pilard and Devan Sohier",
title = "A Self-Stabilizing Algorithm for Maximal Matching in
Anonymous Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1650016",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641650016X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Imbs:2016:TRE,
author = "Damien Imbs and Michel Raynal",
title = "Trading off $t$-Resilience for Efficiency in
Asynchronous {Byzantine} Reliable Broadcast",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1650017",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500171",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Chande:2016:NSC,
author = "Manoj Kumar Chande and Cheng-Chi Lee and Chun-Ta Li",
title = "A New Self-Certified Convertible Authenticated
Encryption Scheme Based on Discrete Logarithm Problem",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1650018",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500183",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Michalakes:2016:OWM,
author = "John Michalakes and Michael J. Iacono and Elizabeth R.
Jessup",
title = "Optimizing Weather Model Radiative Transfer Physics
for {Intel}'s {Many Integrated Core (MIC)}
Architecture",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1650019",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500195",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Anonymous:2016:AIV,
author = "Anonymous",
title = "Author Index: Volume 26",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1699001",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416990012",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Akl:2017:ENa,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "1",
pages = "1701001",
month = mar,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417010010",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:30 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gorlatch:2017:GEN,
author = "Sergei Gorlatch and Herbert Kuchen",
title = "{Guest Editors}' Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "1",
pages = "1702001",
month = mar,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417020017",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:30 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Suijlen:2017:MBT,
author = "Wijnand Suijlen",
title = "{Mock} {BSPlib} for Testing and Debugging Bulk
Synchronous Parallel Software",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "1",
pages = "1740001",
month = mar,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417400011",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:30 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Tachon:2017:AGB,
author = "Thibaut Tachon and Chong Li and Ga{\'e}tan Hains and
Fr{\'e}d{\'e}ric Loulergue",
title = "Automated Generation of {BSP} Automata",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "1",
pages = "1740002",
month = mar,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417400023",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:30 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Misale:2017:CBD,
author = "Claudia Misale and Maurizio Drocco and Marco Aldinucci
and Guy Tremblay",
title = "A Comparison of Big Data Frameworks on a Layered
Dataflow Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "1",
pages = "1740003",
month = mar,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417400035",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:30 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Danelutto:2017:PAS,
author = "Marco Danelutto and Daniele {De Sensi} and Massimo
Torquati",
title = "A Power-Aware, Self-Adaptive Macro Data Flow
Framework",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "1",
pages = "1740004",
month = mar,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417400047",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:30 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Griebler:2017:SDH,
author = "Dalvan Griebler and Marco Danelutto and Massimo
Torquati and Luiz Gustavo Fernandes",
title = "{SPar}: A {DSL} for High-Level and Productive Stream
Parallelism",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "1",
pages = "1740005",
month = mar,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417400059",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:30 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akl:2017:ENb,
author = "Selim G. Akl",
title = "Editorial Note",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "2",
pages = "1701002",
month = jun,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417010022",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Fatourou:2017:LWF,
author = "Panagiota Fatourou and Yiannis Nikolakopoulos and
Marina Papatriantafilou",
title = "Linearizable Wait-Free Iteration Operations in Shared
Double-Ended Queues",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "2",
pages = "1750001",
month = jun,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500013",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Datta:2017:SSW,
author = "Ajoy K. Datta and Stephane Devismes and Lawrence L.
Larmore and Vincent Villain",
title = "Self-Stabilizing Weak Leader Election in Anonymous
Trees Using Constant Memory per Edge",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "2",
pages = "1750002",
month = jun,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500025",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Mancini:2017:PCB,
author = "Toni Mancini and Annalisa Massini and Enrico Tronci",
title = "Parallelization of Cycle-Based Logic Simulation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "2",
pages = "1750003",
month = jun,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500037",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Neggazi:2017:MSS,
author = "Brahim Neggazi and Volker Turau and Mohammed Haddad
and Hamamache Kheddouci",
title = "A {$ O(m) $} Self-Stabilizing Algorithm for Maximal
Triangle Partition of General Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "2",
pages = "1750004",
month = jun,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500049",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hung:2017:SFH,
author = "Chun-Nan Hung and Cheng-Kuan Lin and Lih-Hsing Hsu and
Eddie Cheng and L{\'a}szl{\'o} Lipt{\'a}k",
title = "Strong Fault-{Hamiltonicity} for the Crossed Cube and
Its Extensions",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "2",
pages = "1750005",
month = jun,
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500050",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@Article{Merchant:2017:ABL,
author = "Farhad Merchant and Anupam Chattopadhyay and Soumyendu
Raha and S. K. Nandy and Ranjani Narayan",
title = "Accelerating {BLAS} and {LAPACK} via Efficient
Floating Point Architecture Design",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "3--4",
pages = "1750006",
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500062",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/fparith.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Coccimiglio:2017:PLS,
author = "Gaetano Coccimiglio and Salimur Choudhury",
title = "A Parallel Local Search Algorithm for Clustering Large
Biological Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "3--4",
pages = "1750007",
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500074",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ghose:2017:FOT,
author = "Anirban Ghose and Lokesh Dokara and Soumyajit Dey and
Pabitra Mitra",
title = "A Framework for {OpenCL} Task Scheduling on
Heterogeneous Multicores",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "3--4",
pages = "1750008",
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500086",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
http://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Datta:2017:FPA,
author = "Amit Datta and Mallika De and Bhabani P. Sinha",
title = "Fast Parallel Algorithm for Prefix Computation in
Multi-Mesh Architecture",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "3--4",
pages = "1750009",
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500098",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Sapio:2017:PCA,
author = "Amedeo Sapio and Mario Baldi and Fulvio Risso and
Narendra Anand and Antonio Nucci",
title = "Packet Capture and Analysis on {MEDINA}, A Massively
Distributed Network Data Caching Platform",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "3--4",
pages = "1750010",
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417500104",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2017:AIV,
author = "Anonymous",
title = "Author Index Volume 27",
journal = j-PARALLEL-PROCESS-LETT,
volume = "27",
number = "3--4",
pages = "1799001",
year = "2017",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626417990018",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:31 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Jain:2018:HCL,
author = "Tripti Jain and Klaus Schneider",
title = "The Half Cleaner Lemma: Constructing Efficient
Interconnection Networks from Sorting Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "1",
pages = "1850001",
month = mar,
year = "2018",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626418500019",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:32 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Sudo:2018:CSS,
author = "Yuichi Sudo and Ajoy K. Datta and Lawrence L. Larmore
and Toshimitsu Masuzawa",
title = "Constant Space Self-stabilizing Center Finding
Algorithms in Chains and Trees",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "1",
pages = "1850002",
month = mar,
year = "2018",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626418500020",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:32 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hofinger:2018:FAE,
author = "Siegfried H{\"o}finger and Thomas Ruh and Ernst
Haunschmid",
title = "Fast Approximate Evaluation of Parallel Overhead from
a Minimal Set of Measured Execution Times",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "1",
pages = "1850003",
month = mar,
year = "2018",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626418500032",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:32 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zheng:2018:SPC,
author = "Weijian Zheng and Fengguang Song and Lan Lin and
Zizhong Chen",
title = "Scaling Up Parallel Computation of Tiled {QR}
Factorizations by a Distributed Scheduling Runtime
System and Analytical Modeling",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "1",
pages = "1850004",
month = mar,
year = "2018",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626418500044",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:32 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zenil:2018:ACR,
author = "Hector Zenil and Narsis A. Kiani and Ming-mei Shang
and Jesper Tegn{\'e}r",
title = "Algorithmic Complexity and Reprogrammability of
Chemical Structure Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "1",
pages = "1850005",
month = mar,
year = "2018",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626418500056",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:32 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Mostefaoui:2018:SOS,
author = "Achour Mostefaoui and Matthieu Perrin and Michel
Raynal",
title = "A Simple Object that Spans the Whole Consensus
Hierarchy",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "02",
pages = "??--??",
month = jun,
year = "2018",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626418500068",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:02 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500068",
abstract = "This paper presents a simple generalization of the
basic atomic read/write register object, whose
genericity parameter spans the whole set of integers
and is such that its $k$-parameterized instance has
exactly consensus number $k$. This object, whose
definition is natural, is a sliding window register of
size $k$. Its interest lies in its simplicity and its
genericity dimension which provides a global view
capturing the whole consensus hierarchy. Hence, this
short article should be seen as a simple pedagogical
introduction to Herlihy's consensus hierarchy. The
paper also shows that the consensus number of a ledger
object is $ + \infty",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hao:2018:RRC,
author = "Chen Hao and Weihua Yang",
title = "A Remark on Rainbow $6$-Cycles in Hypercubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "02",
pages = "??--??",
month = jun,
year = "2018",
DOI = "https://doi.org/10.1142/S012962641850007X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:02 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012962641850007X",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Barriere:2018:OMR,
author = "Lali Barri{\`e}re and Xavier Mu{\~n}oz and Janosch
Fuchs and Walter Unger",
title = "Online Matching in Regular Bipartite Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "02",
pages = "??--??",
month = jun,
year = "2018",
DOI = "https://doi.org/10.1142/S0129626418500081",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:02 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500081",
abstract = "In an online problem, the input is revealed one piece
at a time. In every time step, the online algorithm has
to produce a part of the output, based on the partial
knowledge of the input. Such decisions are irrevocable,
and thus online algorithms usually lead to nonoptimal
solutions. The impact of the partial knowledge depends
strongly on the problem. If the algorithm is allowed to
read binary information about the future, the amount of
bits read that allow the algorithm to solve the problem
optimally is the so-called advice complexity. The
quality of an online algorithm is measured by its
competitive ratio, which compares its performance to
that of an optimal offline algorithm. In this paper we
study online bipartite matchings focusing on the
particular case of bipartite matchings in regular
graphs. We give tight upper and lower bounds on the
competitive ratio of the online deterministic bipartite
matching problem. The competitive ratio turns out to be
asymptotically equal to the known randomized
competitive ratio. Afterwards, we present an upper and
lower bound for the advice complexity of the online
deterministic bipartite matching problem.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kronawitter:2018:ADL,
author = "Stefan Kronawitter and Sebastian Kuckuk and Harald
K{\"o}stler and Christian Lengauer",
title = "Automatic Data Layout Transformations in the
{ExaStencils} Code Generator",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "03",
pages = "??--??",
month = sep,
year = "2018",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626418500093",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:04 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500093",
abstract = "Performance optimizations should focus not only on the
computations of an application, but also on the
internal data layout. A well-known problem is whether a
struct of arrays or an array of structs results in a
higher performance for a particular application. Even
though the switch from the one to the other is fairly
simple to implement, testing both transformations can
become laborious and error-prone. Additionally, there
are more complex data layout transformations, such as a
color splitting for multi-color kernels in the domain
of stencil codes, that are manually difficult. As a
remedy, we propose new flexible layout transformation
statements for our domain-specific language ExaSlang
that support arbitrary affine transformations. Since
our code generator applies them automatically to the
generated code, these statements enable the simple
adaptation of the data layout without the need for any
other modifications of the application code. This
constitutes a big advance in the ease of testing and
evaluating different memory layout schemes in order to
identify the best.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Tassone:2018:IAS,
author = "Joseph Tassone and Mike Biocchi",
title = "The Importance of Applying Security Practices in
Wireless Communication: {Bluetooth} Low Energy and
{RFID}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "03",
pages = "??--??",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S012962641850010X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:04 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012962641850010X",
abstract = "Security is a concept which people recognize as
important, yet regularly ignore for reasons such as
cost or design constraints. The world is quickly
shifting towards the wireless with phenomena akin to
the Internet of Thing (IoT) accelerating this
progression. Technologies like Bluetooth Low Energy and
Radio Frequency Identification are greatly entwined
with this trend, and research has been made into
reinforcing protection methods. However, security is a
choice made by the designer and more often than not is
given decreased priority. With the improved creativity
and sophistication of malicious exploits this is
becoming far less acceptable. Theft of data is trivial
for a user with the correct skillset and will be
successful without proper defences. Further research
needs to be done in the field, and encouraging
consistent security practices is an appropriate
start.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Yan:2018:UCD,
author = "Peizhi Yan and Yi Feng",
title = "Using Convolution and Deep Learning in {Gomoku} Game
Artificial Intelligence",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "03",
pages = "??--??",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S0129626418500111",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:04 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500111",
abstract = "Gomoku is an ancient board game. The traditional
approach to solving the Gomoku game is to apply tree
search on a Gomoku game tree. Although the rules of
Gomoku are straightforward, the game tree complexity is
enormous. Unlike many other board games such as chess
and Shogun, the Gomoku board state is more intuitive.
That is to say, analyzing the visual patterns on a
Gomoku game board is fundamental to play this game. In
this paper, we designed a deep convolutional neural
network model to help the machine learn from the
training data (collected from human players). Based on
this original neural network model, we made some
changes and get two variant neural networks. We
compared the performance of the original neural network
with its variants in our experiments. Our original
neural network model got 69\% accuracy on the training
data and 38\% accuracy on the testing data. Because the
decision made by the neural network is intuitive, we
also designed a hard-coded convolution-based Gomoku
evaluation function to assist the neural network in
making decisions. This hybrid Gomoku artificial
intelligence (AI) further improved the performance of a
pure neural network-based Gomoku AI.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anantapantula:2018:MPS,
author = "Sai Anantapantula and Christopher Melekian and Eddie
Cheng",
title = "Matching Preclusion for the Shuffle-Cubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "03",
pages = "??--??",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S0129626418500123",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:04 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500123",
abstract = "The {\em matching preclusion number\/} of a graph is
the minimum number of edges whose deletion results in a
graph that has neither perfect matchings nor almost
perfect matchings. A graph is {\em maximally matched\/}
if its matching preclusion number is equal to its
minimum degree, and is {\em super matched\/} if the
matching preclusion number can only be achieved by
deleting all edges incident to a single vertex. In this
paper, we determine the matching preclusion number and
classify the optimal matching preclusion sets for the
shuffle-cube graphs, a variant of the well-known
hypercubes.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lu:2018:RCB,
author = "Miao Lu and Shurong Zhang and Weihua Yang",
title = "Regular Connected Bipancyclic Spanning Subgraphs of
Torus Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "04",
pages = "??--??",
month = dec,
year = "2018",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626418500135",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:05 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500135",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gerbessiotis:2018:SIS,
author = "Alexandros V. Gerbessiotis",
title = "A Study of Integer Sorting on Multicores",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "04",
pages = "??--??",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129626418500147",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:05 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500147",
abstract = "Integer sorting on multicores and GPUs can be realized
by a variety of approaches that include variants of
distribution-based methods such as radix-sort,
comparison-oriented algorithms such as deterministic
regular sampling and random sampling parallel sorting,
and network-based algorithms such as Batcher's bitonic
sorting algorithm. In this work we present an
experimental study of integer sorting on multicore
processors. We have implemented serial and parallel
radix-sort for various radixes, deterministic regular
oversampling, and random oversampling parallel sorting,
including new variants of ours, and also some
previously little explored or unexplored variants of
bitonic-sort and odd-even transposition sort. The study
uses multithreading and multiprocessing parallel
programming libraries with the same C language code
working under Open MPI, MulticoreBSP, and BSPlib. We
first provide some general high-level observations on
the performance of these implementations. If we can
conclude anything is that accurate prediction of
performance by taking into consideration architecture
dependent features such as the structure and
characteristics of multiple memory hierarchies is
difficult and more often than not untenable. To some
degree this is affected by the overhead imposed by the
high-level library used in the programming effort.
Another objective is to model the performance of these
algorithms and their implementations under the MBSP
(Multi-memory BSP) model. Despite the limitations
mentioned above, we can still draw some reliable
conclusions and reason about the performance of these
implementations using the MBSP model, thus making MBSP
useful and usable.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Lv:2018:RED,
author = "Mengjie Lv and Shuming Zhou and Xueli Sun and Guanqin
Lian and Jiafei Liu",
title = "Reliability Evaluation of Data Center Network
{DCell}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "04",
pages = "??--??",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129626418500159",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:05 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500159",
abstract = "With the rapid development of cloud computing, many
large-scale data centers are being built to provide
increasingly popular online application services, such
as search, e-mails, WeChat, and microblog, etc. The
reliability of a massive data center network is the
likelihood that it performs its expected functions
consistently well under the given conditions within a
specified time interval. A typical approach to measure
the reliability of the system is to count the mean time
to failure (MTTF), which shows the time that the
appearance of a certain number of faulty subsystem
costs. The higher the MTTF, the more reliable the
system is. In this paper, we explore the reliability of
data center network DCell when it is decomposed into
smaller ones along the last dimension under server
(node) failure model and link failure model,
respectively.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Schmitt:2018:RHG,
author = "Christian Schmitt and Moritz Schmid and Sebastian
Kuckuk and Harald K{\"o}stler and J{\"u}rgen Teich and
Frank Hannig",
title = "Reconfigurable Hardware Generation of Multigrid
Solvers with Conjugate Gradient Coarse-Grid Solution",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "04",
pages = "??--??",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129626418500160",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:05 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500160",
abstract = "Not only in the field of high-performance computing
(HPC), field programmable gate arrays (FPGAs) are a
soaringly popular accelerator technology. However, they
use a completely different programming paradigm and
tool set compared to central processing units (CPUs) or
even graphics processing units (GPUs), adding extra
development steps and requiring special knowledge,
hindering widespread use in scientific computing. To
bridge this programmability gap, domain-specific
languages (DSLs) are a popular choice to generate
low-level implementations from an abstract algorithm
description. In this work, we demonstrate our approach
for the generation of numerical solver implementations
based on the multigrid method for FPGAs from the same
code base that is also used to generate code for CPUs
using a hybrid parallelization of MPI and OpenMP. Our
approach yields in a hardware design that can compute
up to 11 V-cycles per second with an input grid size of
4096 {\texttimes} \{\texttimes} {\texttimes} 4096 and
solution on the coarsest using the conjugate gradient
(CG) method on a mid-range FPGA, beating vectorized,
multi-threaded execution on an Intel Xeon processor.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ma:2018:FMP,
author = "Tianlong Ma and Yaping Mao and Eddie Cheng and Jinling
Wang",
title = "Fractional Matching Preclusion for $ (n, k)$-Star
Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "04",
pages = "??--??",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129626418500172",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:05 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418500172",
abstract = "The {\em matching preclusion number\/} of a graph is
the minimum number of edges whose deletion results in a
graph that has neither perfect matchings nor almost
perfect matchings. As a generalization, Liu and Liu
introduced the concept of fractional matching
preclusion number in 2017. The Fractional Matching
Preclusion Number (FMP number) of {\em G\/} is the
minimum number of edges whose deletion leaves the
resulting graph without a fractional perfect matching.
The Fractional Strong Matching Preclusion Number (FSMP
number) of {\em G\/} is the minimum number of vertices
and/or edges whose deletion leaves the resulting graph
without a fractional perfect matching. In this paper,
we obtain the FMP number and the FSMP number for ( {\em
n\}, {\em k\/} )-star graphs. In addition, all the
optimal fractional strong matching preclusion sets of
these graphs are categorized.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2018:AIV,
author = "Anonymous",
title = "Author Index Volume 28",
journal = j-PARALLEL-PROCESS-LETT,
volume = "28",
number = "04",
pages = "??--??",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129626418990013",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:05 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626418990013",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hassan:2019:EAM,
author = "Ambra Abdullahi Hassan and Valeria Cardellini and
Pasqua D'ambra and Daniela {Di Serafino} and Salvatore
Filippone",
title = "Efficient Algebraic Multigrid Preconditioners on
Clusters of {GPUs}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "01",
pages = "??--??",
month = mar,
year = "2019",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626419500014",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:06 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500014",
abstract = "Many scientific applications require the solution of
large and sparse linear systems of equations using
Krylov subspace methods; in this case, the choice of an
effective preconditioner may be crucial for the
convergence of the Krylov solver. Algebraic MultiGrid
(AMG) methods are widely used as preconditioners,
because of their optimal computational cost and their
algorithmic scalability. The wide availability of GPUs,
now found in many of the fastest supercomputers, poses
the problem of implementing efficiently these methods
on high-throughput processors. In this work we focus on
the application phase of AMG preconditioners, and in
particular on the choice and implementation of
smoothers and coarsest-level solvers capable of
exploiting the computational power of clusters of GPUs.
We consider block-Jacobi smoothers using sparse
approximate inverses in the solve phase associated with
the local blocks. The choice of approximate inverses
instead of sparse matrix factorizations is driven by
the large amount of parallelism exposed by the
matrix-vector product as compared to the solution of
large triangular systems on GPUs. The selected
smoothers and solvers are implemented within the AMG
preconditioning framework provided by the MLD2P4
library, using suitable sparse matrix data structures
from the PSBLAS library. Their behaviour is illustrated
in terms of execution speed and scalability, on a test
case concerning groundwater modelling, provided by the
J{\"u}lich Supercomputing Center within the Horizon
2020 Project EoCoE.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kumar:2019:IBM,
author = "Saptaparni Kumar and Jennifer L. Welch",
title = "Implementing {$ \diamond P $} with Bounded Messages on
a Network of {ADD} Channels",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "01",
pages = "??--??",
month = mar,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500026",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:06 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500026",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Carroll:2019:RRT,
author = "Shane Carroll and Wei-ming Lin",
title = "Round Robin Thread Selection Optimization in
Multithreaded Processors",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "01",
pages = "??--??",
month = mar,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500038",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:06 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/multithreading.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500038",
abstract = "We propose a variation of round-robin ordering in an
multi-threaded pipeline to increase system throughput
and resource distribution fairness. We show that using
round robin with a typical arbitrary ordering results
in inefficient use of shared resources and subsequent
thread starvation. To address this but still use a
simple round-robin approach, we optimally and
dynamically sort the order of the round robin
periodically at runtime. We show that with 4-threaded
workloads, throughput can be improved by over 9\% and
harmonic throughput by over 3\% by sorting thread order
at run time. We experiment with multiple stages of the
pipeline and show consistent results throughout several
experiments using the SPEC CPU 2006 benchmarks.
Furthermore, since the technique is still a simple
round robin, the increased performance requires little
overhead to implement.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ahn:2019:ECI,
author = "Jinho Ahn",
title = "Efficient Communication Induced Checkpointing Protocol
for Broadcast Network-based Distributed Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "01",
pages = "??--??",
month = mar,
year = "2019",
DOI = "https://doi.org/10.1142/S012962641950004X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:06 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012962641950004X",
abstract = "This paper proposes an enhanced Fully Informed
Communication-Induced Checkpointing (FI-CIC) protocol
to highly improve the possibility of detecting Z-cycle
free patterns with no extra control message by
utilizing the advantageous feature of the broadcast
network in an effective way compared with the original
FI-CIC protocol. Experimental results show that our
protocol outperforms the previous one in terms of the
number of forced checkpoints per process.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ahn:2019:SSB,
author = "Jinho Ahn",
title = "Scalable Sender-Based Message Logging Protocol with
Little Communication Overhead for Distributed Systems",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "02",
pages = "??--??",
month = jun,
year = "2019",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626419500051",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:07 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500051",
abstract = "The inherent shortcoming of the conventional
Sender-Based Message Logging (SBML) protocols is to
require additional control message interactions per
application message to satisfy the always-no-orphans
condition in case of sequential failures. In this
paper, a scalable SBML protocol is introduced to lower
the communication overhead by handling a sequence of
messages consecutively received by each process before
sending as a party. The protocol enables the process to
delay the update of their receive sequence numbers to
their senders until there comes out the first message
it is willing to send, and then perform the collective
filling out task with each sender requiring only one
control message exchange. Experimental results show
that our protocol outperforms the previous one in terms
of the number of control messages generated.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kehrer:2019:EPS,
author = "Stefan Kehrer and Wolfgang Blochinger",
title = "Elastic Parallel Systems for High Performance Cloud
Computing: State-of-the-Art and Future Directions",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "02",
pages = "??--??",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500063",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:07 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500063",
abstract = "With on-demand access to compute resources,
pay-per-use, and elasticity, the cloud evolved into an
attractive execution environment for High Performance
Computing (HPC). Whereas elasticity, which is often
referred to as the most beneficial cloud-specific
property, has been heavily used in the context of
interactive (multi-tier) applications,
elasticity-related research in the HPC domain is still
in its infancy. Existing parallel computing theory as
well as traditional metrics to analytically evaluate
parallel systems do not comprehensively consider
elasticity, i.e., the ability to control the number of
processing units at runtime. To address these issues,
we introduce a conceptual framework to understand
elasticity in the context of parallel systems, define
the term elastic parallel system, and discuss novel
metrics for both elasticity control at runtime as well
as the ex-post performance evaluation of elastic
parallel systems. Based on the conceptual framework, we
provide an in-depth analysis of existing research in
the field to describe the state-of-the-art and compile
our findings into a research agenda for future research
on elastic parallel systems.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hao:2019:GCD,
author = "Chen Hao and Weihua Yang",
title = "The Generalized Connectivity of Data Center Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "02",
pages = "??--??",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500075",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:07 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500075",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Arunandhi:2019:NSK,
author = "Pranav Arunandhi and Eddie Cheng and Christopher
Melekian",
title = "A Note on the {Steiner} $k$-Diameter of Tensor Product
Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "02",
pages = "??--??",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500087",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:07 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500087",
abstract = "Given a graph G(V,E) G \( V \, E \) G(V,E) and S{\^a}
V S \{\^a} V S {\^a} V , the Steiner distance dG(S)
d_{G} \( S \) dG(S) is the minimum size among all
connected subgraphs of G G G whose vertex sets contain
S S S . The Steiner k k k -diameter sdiamk(G) sdiam_{k}
\( G \) sdiamk(G) is the maximum value of dG(S) d_{G}
\( S \) dG(S) among all sets of k k k vertices. In this
short note, we study the Steiner k k k -diameters of
the tensor product of complete graphs.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Akrida:2019:VMC,
author = "Eleni C. Akrida and Paul G. Spirakis",
title = "On Verifying and Maintaining Connectivity of Interval
Temporal Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "02",
pages = "??--??",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500099",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:07 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500099",
abstract = "An interval temporal network is, informally speaking,
a network whose links change with time. The term
interval means that a link may exist for one or more
time intervals, called availability intervals of the
link, after which it does not exist (until, maybe, a
further moment in time when it starts being available
again). In this model, we consider continuous time and
high-speed (instantaneous) information dissemination.
An interval temporal network is connected during a
period of time [x,y] \[ x \, y \] [x,y] , if it is
connected for all time instances t{\textelement}[x,y] t
\{\textelement} \[ x \, y \] t {\textelement} [x,y]
(instantaneous connectivity). In this work, we study
instantaneous connectivity issues of interval temporal
networks. We provide a polynomial-time algorithm that
answers if a given interval temporal network is
connected during a time period. If the network is not
connected throughout the given time period, then we
also give a polynomial-time algorithm that returns
large components of the network that remain connected
and remain large during [x,y] \[ x \, y \] [x,y] ; the
algorithm also considers the components of the network
that start as large at time t=x t {\= }x t = x but
dis-connect into small components within the time
interval [x,y] \[ x \, y \] [x,y] , and answers how
long after time t=x t {\= }x t = x these components
stay connected and large. Finally, we examine a case of
interval temporal networks on tree graphs where the
lifetimes of links and, thus, the failures in the
connectivity of the network are not controlled by us;
however, we can ``feed'' the network with extra edges
that may re-connect it into a tree when a failure
happens, so that its connectivity is maintained during
a time period. We show that we can with high
probability maintain the connectivity of the network
for a long time period by making these extra edges
available for re-connection using a randomized
approach. Our approach also saves some cost in the
design of availabilities of the edges; here, the cost
is the sum, over all extra edges, of the length of
their availability-to-reconnect interval.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Alonso-sanz:2019:QFG,
author = "Ram{\'o}n Alonso-sanz and Haozhen Situ",
title = "Quantum Fuzzy Game Simulation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "03",
pages = "??--??",
month = sep,
year = "2019",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626419500105",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:09 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500105",
abstract = "This article studies quantum games with imprecise
payoffs simulated by means of fuzzy numbers. Three
two-person game-types are scrutinized via the iterated
confronting of a large number of players laying in a
two-dimensional lattice. In every iteration, every
player interacts with his nearest neighbours and adopts
the strategy of his best paid mate. Variable degree of
quantum entanglement and of optimism in the fuzzy
payoffs are taken into consideration in the study.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Liu:2019:NIN,
author = "Jiafei Liu and Shuming Zhou and Zhendong Gu and Yihong
Wang and Qianru Zhou",
title = "A Note of Independent Number and Domination Number of
{$ Q_{n, k, m} $} -Graph",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "03",
pages = "??--??",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500117",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:09 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500117",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ma:2019:REC,
author = "Tianlong Ma and Jinling Wang and Mingzu Zhang",
title = "The Restricted Edge-Connectivity of {Kronecker}
Product Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "03",
pages = "??--??",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500129",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:09 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500129",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Carroll:2019:ACM,
author = "Shane Carroll and Wei-ming Lin",
title = "Applied On-Chip Machine Learning for Dynamic Resource
Control in Multithreaded Processors",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "03",
pages = "??--??",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500130",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:09 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500130",
abstract = "In this paper, we propose a machine learning algorithm
to control instruction fetch bandwidth in a
simultaneous multithreaded CPU. In a simultaneous
multithreaded CPU, multiple threads occupy pools of
hardware resources in the same clock cycle. Under some
conditions, one or more threads may undergo a period of
inefficiency, e.g., a cache miss, thereby inefficiently
using shared resources and degrading the performance of
other threads. If these inefficiencies can be
identified at runtime, the offending thread can be
temporarily blocked from fetching new instructions into
the pipeline and given time to recover from its
inefficiency, and prevent the shared system resources
from being wasted on a stalled thread. In this paper,
we propose a machine learning approach to determine
when a thread should be blocked from fetching new
instructions. The model is trained offline and the
parameters embedded in a CPU, which can be queried with
runtime statistics to determine if a thread is running
inefficiently and should be temporarily blocked from
fetching. We propose two models: a simple linear model
and a higher-capacity neural network. We test each
model in a simulation environment and show that system
performance can increase by up to 19\% on average with a
feasible implementation of the proposed algorithm.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Mendez:2019:PAR,
author = "Diego Mendez and David Arevalo and Diego Patino and
Eduardo Gerlein and Ricardo Quintana",
title = "Parallel Architecture of Reconfigurable Hardware for
Massive Output Active Noise Control",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "03",
pages = "??--??",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500142",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:09 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500142",
abstract = "Filtered-x Least Mean Squares (FxLMS) is an algorithm
commonly used for Active Noise Control (ANC) systems in
order to cancel undesired acoustic waves from a sound
source. There is a small number of hardware designs
reported in the literature, that in turn only use one
reference signal, one error signal and one output
control signal. In this paper, it is proposed a
3-dimensional hardware-based version of the widely used
FxLMS algorithm, using one reference microphone, 18
error microphones, one output and a FIR filter of 400
th ^{th} th order. The FxLMS algorithm was implemented
in a Xilinx Artix 7 FPGA running at 25 {\em MHz\},
which allowed to update the filter coefficients in
32.44 {\textmu} {\textmu} {\textmu} s. The main idea
behind this work is to propose a pipelined parallelized
architecture to achieve processing times faster than
real time for the filter coefficients update. The main
contribution of this work is not the ANC technique
itself, but rather the proposed hardware implementation
that utilizes integer arithmetic, which provided an
acceptable error when benchmarked with a software
implementation. This parallel system allows a scalable
implementation as an advantage of using FPGA without
compromising the computational cost and, consequently,
the latency.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Banerjee:2019:SNT,
author = "Avah Banerjee and Dana Richards",
title = "A Sorting Network on Trees",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "04",
pages = "??--??",
month = dec,
year = "2019",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626419500154",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:10 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500154",
abstract = "Sorting networks are a class of parallel oblivious
sorting algorithms. Not only do they have interesting
theoretical properties but they can be fabricated. A
sorting network is a sequence of parallel
compare-exchange operations using comparators which are
grouped into stages. This underlying graph defines the
topology of the network. The majority of results on
sorting networks concern the unrestricted case where
the underlying graph is the complete graph. Prior
results are also known for paths, hypercubes, and
meshes. In this paper we introduce a sorting network
whose underlying topology is a tree and formalize the
concept of sorting networks on a restricted graph
topology by introducing a new parameter for graphs
called its {\em sorting number\}. The main result of
the paper is a description of an
O(min(n{\textDelta}2,n2)) O \( \min \(
n{\textDelta}^{2} \, n^{2} \) \)
O(min(n{\textDelta}2,n2)) depth sorting network on a
tree with maximum degree {\textDelta} {\textDelta}
{\textDelta} .",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Arora:2019:PCD,
author = "Ajay Arora and Eddie Cheng and Colton Magnant",
title = "Proper Coloring Distance in Edge-Colored {Cartesian}
Products of Complete Graphs and Cycles",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "04",
pages = "??--??",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500166",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:10 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500166",
abstract = "An path that is edge-colored is called proper if no
two consecutive edges receive the same color. A general
graph that is edge-colored is called properly connected
if, for every pair of vertices in the graph, there
exists a properly colored path from one to the other.
Given two vertices {\em u\/} and {\em v\/} in a
properly connected graph {\em G\}, the proper distance
is the length of the shortest properly colored path
from {\em u\/} to {\em v\}. By considering a specific
class of colorings that are properly connected for
Cartesian products of complete and cyclic graphs, we
present results on the proper distance between all
pairs of vertices in the graph.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Wang:2019:NCA,
author = "Shiying Wang and Mujiangshan Wang",
title = "A Note on the Connectivity of $m$-Ary $n$-Dimensional
Hypercubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "04",
pages = "??--??",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419500178",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:10 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419500178",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2019:AIV,
author = "Anonymous",
title = "Author Index Volume 29",
journal = j-PARALLEL-PROCESS-LETT,
volume = "29",
number = "04",
pages = "??--??",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129626419990019",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:10 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626419990019",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhang:2020:SNS,
author = "Shuangshuang Zhang and Yuzhi Xiao and Xia Liu and Jun
Yin",
title = "A Short Note of Strong Matching Preclusion for a Class
of Arrangement Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "01",
pages = "??--??",
month = mar,
year = "2020",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626420500012",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:12 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500012",
abstract = "The strong matching preclusion number of a graph is
the minimum number of vertices and edges whose deletion
results in a graph that has neither perfect matchings
nor almost perfect matchings. The strong matching
preclusion is a well-studied measure for the network
invulnerability in the event of edge failure. In this
paper, we obtain the strong matching preclusion number
for a class of arrangement graphs and categorize their
the strong matching preclusion set, which are a
supplement of known results.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Fernandez:2020:SPC,
author = "Carlos Fernandez and Ioannis Vourkas and Antonio
Rubio",
title = "Shortest Path Computing in Directed Graphs with
Weighted Edges Mapped on Random Networks of
Memristors",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "01",
pages = "??--??",
month = mar,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500024",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:12 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500024",
abstract = "To accelerate the execution of advanced computing
tasks, in-memory computing with resistive memory
provides a promising solution. In this context,
networks of memristors could be used as parallel
computing medium for the solution of complex
optimization problems. Lately, the solution of the
shortest-path problem (SPP) in a two-dimensional
memristive grid has been given wide consideration. Some
still open problems in such computing approach concern
the time required for the grid to reach to a steady
state, and the time required to read the result, stored
in the state of a subset of memristors that represent
the solution. This paper presents a circuit
simulation-based performance assessment of memristor
networks as SPP solvers. A previous methodology was
extended to support weighted directed graphs. We tried
memristor device models with fundamentally different
switching behavior to check their suitability for such
applications and the impact on the timely detection of
the solution. Furthermore, the requirement of binary
vs. analog operation of memristors was evaluated.
Finally, the memristor network-based computing approach
was compared to known algorithmic solutions to the SPP
over a large set of random graphs of different sizes
and topologies. Our results contribute to the proper
development of bio-inspired memristor network-based SPP
solvers.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ning:2020:CEF,
author = "Wantao Ning",
title = "The Connectivity of Exchanged Folded Hypercube",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "01",
pages = "??--??",
month = mar,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500036",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:12 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500036",
abstract = "Based on exchanged hypercube, a new interconnection
network, exchanged folded hypercube, was proposed
recently. It has better properties than other
variations of hypercube in some areas. In this work we
will show that its connectivity and edge-connectivity
are equal to its minimum degree.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Okoubi:2020:PND,
author = "Firmin Andzembe Okoubi and Jonas Koko",
title = "Parallel {Nesterov} Domain Decomposition Method for
Elliptic Partial Differential Equations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "01",
pages = "??--??",
month = mar,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500048",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:12 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500048",
abstract = "We study a parallel non-overlapping domain
decomposition method, based on the Nesterov accelerated
gradient descent, for the numerical approximation of
elliptic partial differential equations. The problem is
reformulated as a constrained (convex) minimization
problem with the interface continuity conditions as
constraints. The resulting domain decomposition method
is an accelerated projected gradient descent with
convergence rate O(1/k2) O \( 1 \/ k^{2} \) O(1/k2) .
At each iteration, the proposed method needs only one
matrix/vector multiplication. Numerical experiments
show that significant (standard and scaled) speed-ups
can be obtained.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Sudo:2020:LER,
author = "Yuichi Sudo and Toshimitsu Masuzawa",
title = "Leader Election Requires Logarithmic Time in
Population Protocols",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "01",
pages = "??--??",
month = mar,
year = "2020",
DOI = "https://doi.org/10.1142/S012962642050005X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:12 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012962642050005X",
abstract = "This paper shows that every leader election protocol
requires logarithmic stabilization time both in
expectation and with high probability in the population
protocol model. This lower bound holds even if each
agent has knowledge of the exact size of a population
and is allowed to use an arbitrarily large number of
agent states. This lower bound concludes that the
protocol given in [Sudo et al., SSS 2019] is
time-optimal in expectation.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Vargas:2020:EPF,
author = "Karla Vargas and Sergio Rajsbaum and Michel Raynal",
title = "An Eventually Perfect Failure Detector for Networks of
Arbitrary Topology Connected with {ADD} Channels Using
Time-To-Live Values",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "02",
pages = "??--??",
month = jun,
year = "2020",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626420500061",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:13 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500061",
abstract = "We present an implementation of an eventually perfect
failure detector in an arbitrarily connected,
partitionable network. We assume ADD channels: for each
one there exist constants K K K , D D D , not known to
the processes, such that for every K K K consecutive
messages sent in one direction, at least one is
delivered within time D D D . The best previous
implementation used messages of bounded size, but
exponential in n n n , the number of nodes. The main
contribution of this paper is a novel use of {\em
time-to-live\/} values in the design of failure
detectors, obtaining a flexible implementation that
uses messages of size O(nlogn) O \( n \log n \) O(nlog
n) .",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Algosaibi:2020:PBT,
author = "Abdulelah Algosaibi and Khaled Ragab and Saleh
Albahli",
title = "Parallel-Based Techniques for Managing and Analyzing
the Performance on Semantic Graph",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "02",
pages = "??--??",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500073",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:13 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500073",
abstract = "In recent years, data are generated rapidly that
advanced the evolving of the linked data. Modern data
are globally distributed over the semantically linked
graphs. The nature of the distributed data over the
semantic graph raised new demands on further
investigation on improving performance on the semantic
graphs. In this work, we analyzed the time latency as
an important factor to be further investigated and
improved. We evaluated the parallel computing on these
distributed data in order to better utilize the
parallelism approaches. A federation framework based on
a multi-threaded environment supporting federated
SPARQL query was introduced. In our experiments, we
show the achievability and effectiveness of our model
on a set of real-world quires through real-world Linked
Open Data cloud. Significant performance improvement
has noticed. Further, we highlight short-comings that
could open an avenue in the research of federated
queries. Keywords: Semantic web; distributed query
processing; query federation; linked data; join
methods.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Saxena:2020:ANS,
author = "Sanjeev Saxena",
title = "All Nearest Smallers Made Simple",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "02",
pages = "??--??",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500085",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:13 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500085",
abstract = "In this paper, a parallel algorithm for all nearest
smallers problem without using doubly logarithmic tree
is described. It is shown that using only O(loglogn) O
\( \log \log n \) O(loglog n) time routines for merging
and prefix minima, we can easily get an O(loglogn) O \(
\log \log n \) O(loglog n) time parallel algorithm for
the all Nearest Smallers problem.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhang:2020:RAG,
author = "Qifan Zhang and Liqiong Xu and Weihua Yang and
Shanshan Yin",
title = "Reliability Analysis of the Generalized Exchanged
Hypercube",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "02",
pages = "??--??",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500097",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:13 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500097",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhu:2020:FMP,
author = "Bo Zhu and Tianlong Ma and Shuangshuang Zhang and He
Zhang",
title = "Fractional Matching Preclusion for Data Center
Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "02",
pages = "??--??",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500103",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:13 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500103",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cheng:2020:P,
author = "Eddie Cheng and Ke Qiu and Zhizhang Shen and Weihua
Yang",
title = "Preface",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626420020016",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420020016",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Cheng:2020:BAD,
author = "Eddie Cheng and Ke Qiu and Zhizhang Shen and Weihua
Yang",
title = "A Brief Account on the Development and Future Research
Directions of Connectivity Properties of
Interconnection Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420400095",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420400095",
abstract = "Connectivity type measures form an important topic in
graph theory. Such measures provide an important part
of analyzing the vulnerability and resilience of
interconnection networks. In this short commentary, we
outline our perspective on the development of this
topic with respect to interconnection networks.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Lin:2020:SEC,
author = "Shangwei Lin and Jianfeng Pei and Chunfang Li",
title = "Super Edge-Connected Linear Hypergraphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420400034",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420400034",
abstract = "A connected graph G G G is super edge-connected, if
every minimum edge-cut of G G G is the set of edges
incident with a vertex. In this paper, the concept of
super edge-connectivity of graphs is generalized to
hypergraphs and a necessary and sufficient condition
for an r r r -uniform and linear hypergraph with
diameter at most 2 to be super edge-connected is
given.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Tian:2020:CBG,
author = "Yingzhi Tian and Huaping Ma and Liyun Wu",
title = "The Connectivity of a Bipartite Graph and Its
Bipartite Complementary Graph",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420400058",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420400058",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Lin:2020:SSC,
author = "Cheng-kuan Lin and Eddie Cheng and L{\'a}szl{\'o}
Lipt{\'a}k",
title = "Structure and Substructure Connectivity of
Hypercube-Like Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420400071",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420400071",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Zhai:2020:FTM,
author = "Liyang Zhai and Liqiong Xu and Weihua Yang",
title = "Fault-Tolerant Maximal Local-Edge-Connectivity of
Augmented Cubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420400010",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420400010",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Wang:2020:CDL,
author = "Mujiangshan Wang and Dong Xiang and Shiying Wang",
title = "Connectivity and Diagnosability of Leaf-Sort Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420400046",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420400046",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Liu:2020:ECD,
author = "Aixia Liu and Jun Yuan and Shiying Wang",
title = "The $g$-Extra Conditional Diagnosability of Graphs in
Terms of $g$-Extra Connectivity",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S012962642040006X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012962642040006X",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Qin:2020:SCC,
author = "Chengfu Qin and Weihua Yang",
title = "$5$-Shredders of Contraction-Critical $5$-Connected
Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420400083",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420400083",
abstract = "Yoshimi Egawa [8] showed that a 5-connected graph {\em
G\/} admits at most 2|V(G)|{\textminus}103 2 \| V \( G
\) \| \{\textminus} 103 2|V (G)|{\textminus}10 3
5-shredders. In this paper we shown that a
contraction-critical 5-connected graph {\em G\/} admits
at most |G|{\textminus}62 \| G \| \{\textminus} 62
|G|{\textminus}6 2 5-shredders. Further we show that,
for every contraction-critical 5-connected graph {\em
G\}, there is a contraction critical 5-connected graph
G{\textsmalltilde} G \{\~} G{\~} such that {\em G\/} is
a spanning subgraph of G{\textsmalltilde} G \{\~} G{\~}
and G{\textsmalltilde} G \{\~} G{\~} admits at most
|G|{\textminus}14 \| G \| \{\textminus} 14
|G|{\textminus}1 4 5-shredders.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Chartrand:2020:UCG,
author = "Gary Chartrand and Ping Zhang",
title = "Uniformly Connected Graphs --- A Survey",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "03",
pages = "??--??",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420400022",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:14 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420400022",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
remark = "Special Issue on Generalized Connectivities of
Networks Guest Editors: Eddie Cheng, Ke Qiu, Zhizhang
Shen and Weihua Yang",
}
@Article{Zha:2020:RTL,
author = "Daolu Zha and Xi Jin and Rui Shang and Pengfei Yang",
title = "A Real-Time Learning-Based Super-Resolution System on
{FPGA}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "04",
pages = "??--??",
month = dec,
year = "2020",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626420500115",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:17 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500115",
abstract = "This paper proposes a real-time super-resolution (SR)
system. The proposed system performs a fast SR
algorithm that generates a high-resolution image from a
low-resolution image using direct regression functions
with an up-scaling factor of 2. This algorithm
contained two processes: feature learning and SR image
prediction. The feature learning stage is performed
offline, in which several regression functions were
trained. The SR image prediction stage is implemented
on the proposed system to generate high-resolution
image patches. The system implemented on a Xilinx
Virtex 7 field-programmable gate array achieves output
resolution of 3840{\texttimes}2160 3840 \{\texttimes}
2160 3840 {\texttimes} 2160 (UHD) at 85 fps and
700Mpixels/s throughput. Structure similarity (SSIM) is
measured for image quality. Experimental results show
that the proposed system provides high image quality
for real-time applications. And the proposed system
possesses high scalability for resolution.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Gu:2020:SDS,
author = "Zhendong Gu and Shuming Zhou and Jiafei Liu and Qianru
Zhou and Dajin Wang",
title = "{Shapley} Distance and {Shapley} Index for Some
Special Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "04",
pages = "??--??",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500127",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:17 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500127",
abstract = "The {\em Shapley distance\/} in a graph is defined
based on {\em Shapley value\/} in cooperative game
theory. It is used to measure the cost for a vertex in
a graph to access another vertex. In this paper, we
establish the Shapley distance between two arbitrary
vertices for some special graphs, i.e., path, tree,
cycle, complete graph, complete bipartite, and complete
multipartite graph. Moreover, based on the Shapley
distance, we propose a new index, namely Shapley index,
and then compare Shapley index with Wiener index and
Kirchhoff index for these special graphs. We also
characterize the extremal graphs in which these three
indices are equal.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Novakovic:2020:BCS,
author = "Vedran Novakovi{\'c}",
title = "Batched Computation of the Singular Value
Decompositions of Order Two by the {AVX-512}
Vectorization",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "04",
pages = "??--??",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500152",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:17 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500152",
abstract = "In this paper a vectorized algorithm for
simultaneously computing up to eight singular value
decompositions (SVDs, each of the form
A=U{\textSigma}V{\^a} A {\= }U{\textSigma}V^{\{\^a} } A
= U{\textSigma}V{\^a} ) of real or complex matrices of
order two is proposed. The algorithm extends to a batch
of matrices of an arbitrary length n n n , that arises,
for example, in the annihilation part of the parallel
Kogbetliantz algorithm for the SVD of matrices of order
2n 2n 2n . The SVD method for a single matrix of order
two is derived first. It scales, in most instances
error-free, the input matrix A A A such that the scaled
singular values cannot overflow whenever the elements
of A A A are finite, and then computes the URV
factorization of the scaled matrix, followed by the SVD
of the non-negative upper-triangular middle factor. A
vector-friendly data layout for the batch is then
introduced, where the same-indexed elements of each of
the input and the output matrices form vectors, and the
algorithm's steps over such vectors are described. The
vectorized approach is shown to be about three times
faster than processing each matrix in the batch
separately, while slightly improving accuracy over the
straightforward method for the 2{\texttimes}2 2
\{\texttimes} 2 2 {\texttimes} 2 SVD.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hernandez-orozco:2020:SPL,
author = "Santiago Hern{\'a}ndez-orozco and Francisco
Hern{\'a}ndez-quiroz and Hector Zenil and Wilfried
Sieg",
title = "Shortening of Proof Length is Elusive for Theorem
Provers",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "04",
pages = "??--??",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500139",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:17 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500139",
abstract = "There are many examples of failed strategies whose
intention is to optimize a process but instead they
produce worse results than no strategy at all. Many
fall under the loose umbrella of the ``no free lunch
theorem''. In this paper we present an example in which
a simple (but assumedly naive) strategy intended to
shorten proof lengths in the propositional calculus
produces results that are significantly worse than
those achieved without any method to try to shorten
proofs.This contrast with what was to be expected
intuitively, namely no improvement in the length of the
proofs. Another surprising result is how early the
naive strategy failed. We set up a experiment in which
we sample random classical propositional theorems and
then feed them to two very popular automatic theorem
provers (AProS and Prover9). We then compared the
length of the proofs obtained under two methods: (1)
the application of the theorem provers with no
additional information; (2) the addition of new
(redundant) axioms to the provers. The second method
produced even longer proofs than the first one.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Xu:2020:PQA,
author = "Guanlei Xu and Xiaogang Xu",
title = "The Parallel Quantum Algorithm for the Class of
Optimization",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "04",
pages = "??--??",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420500140",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:17 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420500140",
abstract = "For the given {\em n\/} numbers without any other
prior information, how to obtain the minimum norm of
them only by assigning their signs before them?
Moreover, how to know one number is the multiplication
of which ones in the given n numbers? In classical
solutions, enumeration is the only way via trying one
by one, whose complexity is about O(n2n{\textminus}1) O
\( n2^{n \{\textminus} 1} \) O(n2n{\textminus}1) and
this is a NP problem. In this paper, the parallel
quantum algorithm is proposed to solve the two
questions shown in above. Through the quantum design of
linear expressions of angles in parallel circuits, only
O(n2) O \( n^{2} \) O(n2) time's quantum operations and
about O(n2) O \( n^{2} \) O(n2) times' quantum
measurements in the average will give the correct
answer in the successful probability of 0.97 instead of
the traditional O(2n) O \( 2^{n} \) O(2n) times. The
example and theoretical analysis demonstrate the
efficiency of the proposed method.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2020:AIV,
author = "Anonymous",
title = "Author Index Volume 30",
journal = j-PARALLEL-PROCESS-LETT,
volume = "30",
number = "04",
pages = "??--??",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129626420990017",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:17 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626420990017",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhang:2021:FSM,
author = "He Zhang and Jinyu Zou and Shuangshuang Zhang and
Chengfu Ye",
title = "Fractional Strong Matching Preclusion for {DHcube}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "01",
pages = "??--??",
month = mar,
year = "2021",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626421500018",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:18 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500018",
abstract = "Let F F F be a set edges and F{\prime} F^{{\prime}}
F{\prime} be a set of edges and/or vertices of a graph
G G G , then F F F (resp. F{\prime} F^{{\prime}}
F{\prime} ) is a fractional matching preclusion set
(resp. fractional strong matching preclusion set) if
G{\textminus}F G \{\textminus} F G {\textminus} F
(resp. G{\textminus}F{\prime} G \{\textminus}
F^{{\prime}} G {\textminus} F{\prime} ) contains no
fractional perfect matching. The fractional matching
preclusion number (resp. fractional strong matching
preclusion number) of G G G is the minimum size of
fractional matching preclusion set (resp. fractional
strong matching preclusion set) of G G G . In this
paper, we obtain the fractional matching preclusion
number and fractional strong matching preclusion number
of the DHcube DH(m,d,n) DH \( m \, d \, n \) DH(m,d,n)
for n{\textgreaterequal}3 n \{\textgreaterequal} 3 n
{\textgreaterequal} 3 . In addition, all the optimal
fractional matching preclusion sets and fractional
strong matching preclusion sets of these graphs are
categorized.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Heriban:2021:MRU,
author = "Adam Heriban and S{\'e}bastien Tixeuil",
title = "Mobile Robots with Uncertain Visibility Sensors:
Possibility Results and Lower Bounds",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "01",
pages = "??--??",
month = mar,
year = "2021",
DOI = "https://doi.org/10.1142/S012962642150002X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:18 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012962642150002X",
abstract = "We consider mobile robotic entities that have to
cooperate to solve assigned tasks. In the literature,
two models have been used to model their visibility
sensors: the full visibility model, where all robots
can see all other robots, and the limited visibility
model, where there exists a limit {\textlambda}{$>$}0
{\textlambda} \{$>$} 0 {\textlambda} {$>$} 0 such that
all robots closer than {\textlambda} {\textlambda}
{\textlambda} are seen and all robots further than
{\textlambda} {\textlambda} {\textlambda} are not seen.
We introduce the uncertain visibility model, which
generalizes both models by considering that a subset of
the robots further than {\textlambda} {\textlambda}
{\textlambda} cannot be seen. An empty subset
corresponds to the full visibility model, and a subset
containing every such robot corresponds to the limited
visibility model. Then, we explore the impact of this
new visibility model on the feasibility of benchmarking
tasks in mobile robots computing: gathering, uniform
circle formation, luminous rendezvous, and leader
election. For each task, we determine the weakest
visibility adversary that prevents task solvability,
and the strongest adversary that allows task
solvability. Our work sheds new light on the impact of
visibility sensors in the context of mobile robot
computing, and paves the way for more realistic
algorithms that can cope with uncertain visibility
sensors.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Boxer:2021:CGP,
author = "Laurence Boxer",
title = "Coarse Grained Parallel Selection",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "01",
pages = "??--??",
month = mar,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500031",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:18 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500031",
abstract = "Several efficient, but non-optimal, solutions to the
Selection Problem on coarse grained parallel computers
have appeared in the literature. We consider the
example of the Saukas-Song algorithm; we analyze it
without expressing the running time in terms of
communication rounds. This shows that while in the best
case the Saukas-Song algorithm runs in asymptotically
optimal time, in general it does not. We propose
another algorithm for coarse grained selection that has
optimal expected running time.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Abraham:2021:MLA,
author = "Jessie Abraham and Micheal Arockiaraj",
title = "Minimum Linear Arrangement of the {Cartesian} Product
of Optimal Order Graph and Path",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "01",
pages = "??--??",
month = mar,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500043",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:18 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500043",
abstract = "The minimum linear arrangement of an arbitrary graph
is the embedding of the vertices of the graph onto the
line topology in such a way that the sum of the
distances between adjacent vertices in the graph is
minimized. This minimization can be attained by finding
an optimal ordering of the vertex set of the graph and
labeling the vertices of the line in that order. In
this paper, we compute the minimum linear arrangement
of the Cartesian product of certain sequentially
optimal order graphs which include interconnection
networks such as hypercube, folded hypercube, complete
Josephus cube and locally twisted cube with path and
the edge faulty counterpart of sequentially optimal
order graphs.",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhuang:2021:REG,
author = "Hongbin Zhuang and Sunjian Zheng and Ximeng Liu and
Cheng-kuan Lin and Xiaoyan Li",
title = "Reliability Evaluation of Generalized Exchanged
Hypercubes Based on Imprecise Diagnosis Strategies",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "01",
pages = "??--??",
month = mar,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500055",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Mon Mar 29 12:30:18 MDT 2021",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500055",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Perepu:2021:OIP,
author = "Pavan Kumar Perepu",
title = "{OpenMP} Implementation of Parallel Longest Common
Subsequence Algorithm for Mathematical Expression
Retrieval",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "02",
pages = "??--??",
month = jun,
year = "2021",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626421500079",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:36 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
http://www.math.utah.edu/pub/tex/bib/pvm.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500079",
abstract = "Given a mathematical expression in LaTeX or MathML
format, retrieval algorithm extracts similar
expressions from a database. In our previous work, we
have used Longest Common Subsequence (LCS) algorithm to
match two expressions of lengths, m and n , which takes
O \( mn \) time complexity. If there are T database
expressions, total complexity is O \( Tmn \) , and an
increase in T also increases this complexity. In the
present work, we propose to use parallel LCS algorithm
in our retrieval process. Parallel LCS has O \( \max \(
m \, n \) \) time complexity with \max \( m \, n \)
processors and total complexity can be reduced to O \(
T \max \( m \, n \) \) . For our experimentation,
OpenMP based implementation has been used on Intel i3
processor with 4 cores. However, for smaller
expressions, parallel version takes more time as the
implementation overhead dominates the algorithmic
improvement. As such, we have proposed to use parallel
version, selectively, only on larger expressions, in
our retrieval algorithm to achieve better performance.
We have compared the sequential and parallel versions
of our ME retrieval algorithm, and the performance
results have been reported on a database of 829
mathematical expressions.",
acknowledgement = ack-nhfb,
articleno = "2150007",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Cao:2021:IAL,
author = "Yang Cao and Fei Wu and Thomas Robertazzi",
title = "Integrating {Amdahl}-like Laws and Divisible Load
Theory",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "02",
pages = "??--??",
month = jun,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500080",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:36 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500080",
abstract = "A simple means of integrating the characteristics of
networked processors under divisible loads into
Amdahl's Law is presented. Amdahl's Law serves as an
upper bound to these speedup results. Amdahl's Law with
divisible load processing characteristics included
serves as an upper bound to speedup for any model
taking into consideration more detailed peculiarities
of real systems such as the overhead of task creation,
synchronization, resource contention and memory
issues.",
acknowledgement = ack-nhfb,
articleno = "2150008",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Ramroach:2021:ADP,
author = "Sterling Ramroach and Ajay Joshi",
title = "Accelerating Data-Parallel Neural Network Training
with Weighted-Averaging Reparameterisation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "02",
pages = "??--??",
month = jun,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500092",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:36 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500092",
abstract = "Recent advances in artificial intelligence has shown a
direct correlation between the performance of a network
and the number of hidden layers within the network. The
Compute Unified Device Architecture (CUDA) framework
facilitates the movement of heavy computation from the
CPU to the graphics processing unit (GPU) and is used
to accelerate the training of neural networks. In this
paper, we consider the problem of data-parallel neural
network training. We compare the performance of
training the same neural network on the GPU with and
without data parallelism. When data parallelism is
used, we compare with both the conventional averaging
of coefficients and our proposed method. We set out to
show that not all sub-networks are equal and thus,
should not be treated as equals when normalising weight
vectors. The proposed method achieved state of the art
accuracy faster than conventional training along with
better classification performance in some cases.",
acknowledgement = ack-nhfb,
articleno = "2150009",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Carroll:2021:ELT,
author = "Shane Carroll and Wei-ming Lin",
title = "Exploiting Long-Term Temporal Cache Access Patterns
for {LRU} Insertion Prioritization",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "02",
pages = "??--??",
month = jun,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500109",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:36 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500109",
abstract = "In a CPU cache utilizing least recently used (LRU)
replacement, cache sets manage a buffer which orders
all cache lines in the set from LRU to most recently
used (MRU). When a cache line is brought into cache, it
is placed at the MRU and the LRU line is evicted. When
re-accessed, a line is promoted to the MRU position.
LRU replacement provides a simple heuristic to predict
the optimal cache line to evict. However, LRU utilizes
only simple, short-term access patterns. In this paper,
we propose a method that uses a buffer called the
history queue to record longer-term access-eviction
patterns than the LRU buffer can capture. Using this
information, we make a simple modification to LRU
insertion policy such that recently-recalled blocks
have priority over others. As lines are evicted, their
addresses are recorded in a FIFO history queue.
Incoming lines that have recently been evicted and now
recalled (those in the history queue at recall time)
remain in the MRU for an extended period of time as
non-recalled lines entering the cache thereafter are
placed below the MRU. We show that the proposed LRU
insertion prioritization increases performance in
single-threaded and multi-threaded workloads in
simulations with simple adjustments to baseline LRU.",
acknowledgement = ack-nhfb,
articleno = "2150010",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Dec:2021:LCI,
author = "Grzegorz Rafa{\l} Dec",
title = "{LSTM} Cell Implementation on {FPGAs}",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "02",
pages = "??--??",
month = jun,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500110",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:36 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500110",
abstract = "This paper presents and discusses the implementation
of an LSTM cell on an FPGA with an activation function
inspired by the CORDIC algorithm. The realization is
performed using both IEEE754 standard and 32-bit
integer numbers. The case with floating-point
arithmetic is analyzed with and without DSP blocks
provided by the Xilinx design suite. The alternative
implementation including the integer arithmetic was
optimized for a minimal number of clock cycles.
Presented implementation uses xc6slx150t-2fgg900 and
achieves high calculations accuracy for both cases.",
acknowledgement = ack-nhfb,
articleno = "2150011",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhu:2021:FMP,
author = "Bo Zhu and Tianlong Ma and Shuangshuang Zhang and He
Zhang",
title = "Fractional Matching Preclusion for Data Center
Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "03",
pages = "??--??",
month = sep,
year = "2021",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626421500122",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:37 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500122",
abstract = "An edge subset F of G is a fractional matching
preclusion set (FMP set for short) if G \{\textminus} F
has no fractional perfect matchings. The fractional
matching preclusion number (FMP number for short) of G
, denoted by fmp \( G \) , is the minimum size of FMP
sets of G . A set F of edges and vertices of G is a
fractional strong matching preclusion set (FSMP set for
short) if G \{\textminus} F has no fractional perfect
matchings. The fractional strong matching preclusion
number (FSMP number for short) of G , denoted by fsmp
\( G \) , is the minimum size of FSMP sets of G . Data
center networks have been proposed for data centers as
a server-centric interconnection network structure,
which can support millions of servers with high network
capacity by only using commodity switches. In this
paper, we obtain the FMP number and the FSMP number for
data center networks D_{n \, k} , and show that fmp \(
D_{n \, k} \) {\= }n \+ k \{\textminus} 1 for n
\{\textgreaterequal} 2 , k \{\textgreaterequal} 0 and
fsmp \( D_{n \, k} \) {\= }n \+ k \{\textminus} 1 for n
\{\textgreaterequal} 6 , k \{\textgreaterequal} 1 . In
addition, all the optimal fractional strong matching
preclusion sets of these graphs are categorized.",
acknowledgement = ack-nhfb,
articleno = "2150012",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhang:2021:ODI,
author = "Junwei Zhang and Li Shi and Yang Liu and Thomas G.
Robertazzi",
title = "Optimizing Data Intensive Flows for Networks on
Chips",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "03",
pages = "??--??",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500134",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:37 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500134",
abstract = "A novel framework is proposed to find efficient data
intensive flow distributions on Networks on Chip (NoC).
Voronoi diagram techniques are used to divide a NoC
array of homogeneous processors and links into
clusters. A new mathematical tool, named the flow
matrix, is proposed to find the optimal flow
distribution for individual clusters. Individual flow
distributions on clusters are reconciled to be more
evenly distributed. This leads to an efficient makespan
and a significant savings in the number of cores
actually used. The approach here is described in terms
of a mesh interconnection but is suitable for other
interconnection topologies.",
acknowledgement = ack-nhfb,
articleno = "2150013",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Raynal:2021:VBB,
author = "Michel Raynal",
title = "On the Versatility of {Bracha}'s {Byzantine} Reliable
Broadcast Algorithm",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "03",
pages = "??--??",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500067",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:37 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500067",
abstract = "G. Bracha presented in 1987 a simple and efficient
reliable broadcast algorithm for n -process
asynchronous message-passing systems, which tolerates
up to t \{$<$} n \/ 3 Byzantine processes. Following an
idea recently introduced by Hirt, Kastrato and
Liu-Zhang (OPODIS 2020), instead of considering the
upper bound on the number of Byzantine processes \( t
\) , the present short article considers two types of
Byzantine behavior: the ones that can prevent the
safety property from being satisfied, and the ones that
can prevent the liveness property from being satisfied
(a Byzantine process can exhibit only one or both types
of failures). This Byzantine differentiated failure
model is captured by two associated upper bounds
denoted t_{s} (for safety) and t_{{\ell}} for
liveness). The article shows that only the threshold
values used in the predicates of Bracha's algorithm
must be modified to obtain an algorithm that works with
this differentiated Byzantine failure model.",
acknowledgement = ack-nhfb,
articleno = "2150006",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Kou:2021:CEC,
author = "Shuai Kou and Chengfu Qin and Weihua Yang",
title = "Contractible Edges in 3-Connected Cubic Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "03",
pages = "??--??",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500146",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:37 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500146",
acknowledgement = ack-nhfb,
articleno = "2150014",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Liu:2021:ADH,
author = "Wenjun Liu and Wenjun Li",
title = "Adaptive Diagnosis of {Hamiltonian} Networks under the
Comparison Model",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "03",
pages = "??--??",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500158",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:37 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500158",
abstract = "Adaptive diagnosis is an approach in which tests can
be scheduled dynamically during the diagnosis process
based on the previous test outcomes. Naturally,
reducing the number of test rounds as well as the total
number of tests is a major goal of an efficient
adaptive diagnosis algorithm. The adaptive diagnosis of
multiprocessor systems under the PMC model has been
widely investigated, while adaptive diagnosis using
comparison model has been independently discussed only
for three networks, including hypercube, torus, and
completely connected networks. In addition, adaptive
diagnosis of general Hamiltonian networks is more
meaningful than that of special graph. In this paper,
the problem of adaptive fault diagnosis in Hamiltonian
networks under the comparison model is explored. First,
we propose an adaptive diagnostic scheme which takes
five to six test rounds. Second, we derive a dynamic
upper bound of the number of fault nodes instead of
setting a value like normal. Finally, we present an
algorithm such that at least one sequence obtained from
cycle partition can be picked out and all nodes in this
sequence can be identified based on the previous upper
bound.",
acknowledgement = ack-nhfb,
articleno = "2150015",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Zhai:2021:ECE,
author = "Liyang Zhai and Liqiong Xu and Shanshan Yin",
title = "On the 3-Extra Connectivity of Enhanced Hypercubes",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "04",
pages = "??--??",
month = dec,
year = "2021",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962642150016X",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:38 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012962642150016X",
abstract = "Reliability evaluation of interconnection networks is
of significant importance to the design and maintenance
of interconnection networks. The extra connectivity is
an important parameter for the reliability evaluation
of interconnection networks. Given a graph G and a
positive integer g , the g -extra connectivity, denoted
by {\textkappa}_{g} \( G \) , is the minimum
cardinality of a set of vertices in G , if exists,
whose deletion disconnects G and leaves each remaining
component with at least \( g \+ 1 \) vertices. In this
paper, we show that the 3-extra connectivity of the \(
n \, k \) -enhanced hypercube is \( 4n \{\textminus} 5
\) for n \{\textgreaterequal} 7 and 1 \{\textlessequal}
k \{\textlessequal} n \{\textminus} 6 . Some previous
results in [ {\em IEEE Trans. Comput.\/} 63 (2014)
1594--1600] and [ {\em Theor. Comput. Sci.\/} 799
(2019) 22--31] are extended.",
acknowledgement = ack-nhfb,
articleno = "2150016",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Liu:2021:REB,
author = "Jiafei Liu and Shuming Zhou and Eddie Cheng and Gaolin
Chen and Min Li",
title = "Reliability Evaluation of Bicube-Based Multiprocessor
System under the $g$-Good-Neighbor Restriction",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "04",
pages = "??--??",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500183",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:38 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500183",
abstract = "Multiprocessor systems are commonly deployed for big
data analysis because of evolution in technologies such
as cloud computing, IoT, social network and so on.
Reliability evaluation is of significant importance for
maintenance and improvement of fault tolerance for
multiprocessor systems, and system-level diagnosis is a
primary strategy to identify the faulty processors in
the systems. In this paper, we first determine the g
-good-neighbor connectivity of the n -dimensional
Bicube-based multiprocessor system BQ_{n} , a novel
variant of hypercube. Besides, we establish the g
-good-neighbor diagnosability of the Bicube-based
multiprocessor system BQ_{n} under the PMC and MM*
models.",
acknowledgement = ack-nhfb,
articleno = "2150018",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Hamdi-larbi:2021:MLD,
author = "Olfa Hamdi-larbi and Ichrak Mehrez and Thomas Dufaud",
title = "Machine Learning to Design an Auto-tuning System for
the Best Compressed Format Detection for Parallel
Sparse Computations",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "04",
pages = "??--??",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500195",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:38 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500195",
abstract = "Many applications in scientific computing process very
large sparse matrices on parallel architectures. The
presented work in this paper is a part of a project
where our general aim is to develop an auto-tuner
system for the selection of the best matrix compression
format in the context of high-performance computing.
The target smart system can automatically select the
best compression format for a given sparse matrix, a
numerical method processing this matrix, a parallel
programming model and a target architecture. Hence,
this paper describes the design and implementation of
the proposed concept. We consider a case study
consisting of a numerical method reduced to the sparse
matrix vector product (SpMV), some compression formats,
the data parallel as a programming model and, a
distributed multi-core platform as a target
architecture. This study allows extracting a set of
important novel metrics and parameters which are
relative to the considered programming model. Our
metrics are used as input to a machine-learning
algorithm to predict the best matrix compression
format. An experimental study targeting a distributed
multi-core platform and processing random and
real-world matrices shows that our system can improve
in average up to 7\% the accuracy of the machine
learning.",
acknowledgement = ack-nhfb,
articleno = "2150019",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Michail:2021:BRG,
author = "Othon Michail and Paul G. Spirakis and Michail
Theofilatos",
title = "Beyond Rings: Gathering in 1-Interval Connected
Graphs",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "04",
pages = "??--??",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500201",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:38 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500201",
abstract = "We examine the problem of gathering k
\{\textgreaterequal} 2 agents (or multi-agent
rendezvous) in dynamic graphs which may change in every
round. We consider a variant of the 1 -interval
connectivity model [9] in which all instances
(snapshots) are always connected spanning subgraphs of
an underlying graph, not necessarily a clique. The
agents are identical and not equipped with explicit
communication capabilities, and are initially
arbitrarily positioned on the graph. The problem is for
the agents to gather at the same node, not fixed in
advance. We first show that the problem becomes
impossible to solve if the underlying graph has a
cycle. In light of this, we study a relaxed version of
this problem, called {\em weak gathering\}, where the
agents are allowed to gather either at the same node,
or at two adjacent nodes. Our goal is to characterize
the class of 1-interval connected graphs and initial
configurations in which the problem is solvable, both
with and without {\em homebases\}. On the negative side
we show that when the underlying graph contains a
spanning bicyclic subgraph and satisfies an additional
connectivity property, {\em weak gathering\/} is
unsolvable, thus we concentrate mainly on unicyclic
graphs. As we show, in most instances of initial agent
configurations, the agents must meet on the cycle. This
adds an additional difficulty to the problem, as they
need to explore the graph and recognize the nodes that
form the cycle. We provide a deterministic algorithm
for the solvable cases of this problem that runs in O
\( n^{2} \+ nk \) number of rounds.",
acknowledgement = ack-nhfb,
articleno = "2150020",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Burkhardt:2021:GCL,
author = "Paul Burkhardt",
title = "Graph Connectivity in Log Steps Using Label
Propagation",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "04",
pages = "??--??",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421500213",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:38 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421500213",
abstract = "The fastest deterministic algorithms for connected
components take logarithmic time and perform
superlinear work on a Parallel Random Access Machine
(PRAM). These algorithms maintain a spanning forest by
merging and compressing trees, which requires
pointer-chasing operations that increase memory access
latency and are limited to shared-memory systems. Many
of these PRAM algorithms are also very complicated to
implement. Another popular method is
``leader-contraction'' where the challenge is to select
a constant fraction of leaders that are adjacent to a
constant fraction of non-leaders with high probability,
but this can require adding more edges than were in the
original graph. Instead we investigate label
propagation because it is deterministic, easy to
implement, and does not rely on pointer-chasing. Label
propagation exchanges representative labels within a
component using simple graph traversal, but it is
inherently difficult to complete in a sublinear number
of steps. We are able to overcome the problems with
label propagation for graph connectivity. We introduce
a surprisingly simple framework for deterministic,
undirected graph connectivity using label propagation
that is easily adaptable to many computational models.
It achieves logarithmic convergence independently of
the number of processors and without increasing the
edge count. We employ a novel method of propagating
directed edges in alternating direction while
performing minimum reduction on vertex labels. We
present new algorithms in PRAM, Stream, and MapReduce.
Given a simple, undirected graph G {\= }\( V \, E \)
with n {\= }\| V \| vertices, m {\= }\| E \| edges, our
approach takes O(m) work each step, but we can only
prove logarithmic convergence on a path graph. It was
conjectured by Liu and Tarjan (2019) to take O \( \log
n \) steps or possibly O \( \log^{2}n \) steps. Our
experiments on a range of difficult graphs also suggest
logarithmic convergence. We leave the proof of
convergence as an open problem.",
acknowledgement = ack-nhfb,
articleno = "2150021",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Anonymous:2021:AIV,
author = "Anonymous",
title = "Author Index Volume 31",
journal = j-PARALLEL-PROCESS-LETT,
volume = "31",
number = "04",
pages = "??--??",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S0129626421990012",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Thu Feb 17 06:50:38 MST 2022",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129626421990012",
acknowledgement = ack-nhfb,
articleno = "2199001",
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
