Last update:
Mon Jun 12 12:47:40 MDT 2023
E. A. Albacea Determining the mode in parallel . . . . 3--10
A. Arora and
S. Dolev and
M. Gouda Maintaining digital clocks in step . . . 11--18
T. Risset and
Y. Robert Synthesis of processor arrays for the
algebraic path problem: unifying old
results and deriving new architectures 19--28
S. Olariu and
J. L. Schwing and
Jingyuan Zhang On the power of two-dimensional
processor arrays with reconfigurable bus
systems . . . . . . . . . . . . . . . . 29--34
A. L. Liestman and
T. C. Shermer Additive spanners for hypercubes . . . . 35--42
S. Latifi Subcube embeddability of folded
hypercubes . . . . . . . . . . . . . . . 43--50
K. T. Sun and
H. C. Fu An O(n) parallel algorithm for solving
the traffic control problem on crossbar
switch networks . . . . . . . . . . . . 51--58
A. Datta and
S. V. Joshi and
R. N. Mahapatra Modelling a morphological thinning
algorithm for shared memory SIMD
computers . . . . . . . . . . . . . . . 59--65
D. Krizanc A note on off-line permutation routing
on a mesh-connected processor array . . 67--70
A. Darte and
L. Khachiyan and
Y. Robert Linear scheduling is nearly optimal . . 73--81
Jingling Xue Specifying control signals for systolic
arrays by uniform recurrence equations 83--93
M. Valero and
T. Lang and
J. M. Llaberia and
M. Peiron and
Navarro and
J. J. and
E. Ayguade Conflict-free strides for vectors in
matched memories . . . . . . . . . . . . 95--102
M. Cosnard and
A. Ferreira On the real power of loosely coupled
parallel architectures . . . . . . . . . 103--111
G. Manzini Large sorting and routing problems on
the Hypercube and related networks . . . 113--124
U. A. Ranawake and
P. M. Lenders and
S. M. Goodnick On lower bounds for the communication
volume in distributed systems . . . . . 125--133
S. B. Yang and
S. K. Dhall and
S. Lakshmivarahan An improved maximal matching algorithm 135--142
S. G. Akl and
T. Duboux and
I. Stojmenovic Constant delay parallel counters . . . . 143--148
Y. Ben-Asher Ranking on reconfigurable networks . . . 149--156
Kian-Lee Tan and
Hongjun Lu On processing multi-joins in parallel
systems . . . . . . . . . . . . . . . . 157--164
J.-C. Bermond and
P. Hell and
J.-J. Quisquater Construction of large packet radio
networks . . . . . . . . . . . . . . . . 3--12
R. Feldmann and
W. Unger The cube-connected cycles network is a
subgraph of the Butterfly network . . . 13--19
M. Flatebo and
A. K. Datta Distributed deadlock detection
algorithms . . . . . . . . . . . . . . . 21--30
P. de la Torre and
R. Greenlaw and
T. M. Przytycka Optimal tree ranking is in NC . . . . . 31--41
L. F. Lindon Discriminating analysis and its
application to matrix by vector
multiplication on the PRAM . . . . . . . 43--50
B. V. Purushotham and
A. Basu and
P. S. Kumar and
L. M. Patnaik Performance estimation of LU
factorisation on message passing
multiprocessors . . . . . . . . . . . . 51--60
M. Griebel The combination technique for the sparse
grid solution of PDEs on multiprocessor
machines . . . . . . . . . . . . . . . . 61--70
Do-Hyung Kim and
Kwang-Moo Choe and
Taisook Han Refined mark(s)-set-based backtrack
literal selection for AND parallelism in
logic programs . . . . . . . . . . . . . 71--79
S. Ullman and
B. Narahari Mapping binary precedence trees to
hypercubes . . . . . . . . . . . . . . . 81--87
R. Krishnamurti and
B. Narahari Optimal subcube assignment for
partitionable hypercubes . . . . . . . . 89--95
J. F. Myoupo Synthesizing linear systolic arrays for
dynamic programming problems . . . . . . 97--110
K. A. Aly and
P. W. Dowd Reconfigurable parallel computer
architecture based on
wavelength-division multiplexed optical
interconnection network . . . . . . . . 117--127
S. Rai and
J. L. Trahan A reconfiguration technique for fault
tolerance in a hypercube . . . . . . . . 129--138
A. Corradi and
L. Leonardi and
F. Zambonelli Load balancing strategies for massively
parallel architectures . . . . . . . . . 139--148
Wen-Jing Hsu and
C. V. Page Embedding mesh in a large family of
graphs . . . . . . . . . . . . . . . . . 149--155
S. Olariu and
Z. Wen A parallel algorithm for forest
reconstruction . . . . . . . . . . . . . 157--160
C. S. Yang and
Y. M. Tsai and
C. Y. Liu Performance evaluation of multicast
wormhole routing in 2D-Torus
multicomputers . . . . . . . . . . . . . 161--170
S. Sur and
P. K. Srimani A self-stabilizing distributed algorithm
to construct BFS spanning trees of a
symmetric graph . . . . . . . . . . . . 171--179
D. J. Haglin Approximating maximum 2-CNF
satisfiability . . . . . . . . . . . . . 181--187
R. Sarnath DTML is logspace hard under NC$^1$
reductions . . . . . . . . . . . . . . . 189--193
M. Gastaldo and
M. Morvan and
J. M. Robson Transitive closure in parallel on a
linear network of processors . . . . . . 195--203
I. Parberry The pairwise sorting network . . . . . . 205--211
M. Kutylowski and
R. Wanka Periodic sorting on two-dimensional
meshes . . . . . . . . . . . . . . . . . 213--220
P. Berthome Efficient K-selection in hypercube
multiprocessors . . . . . . . . . . . . 221--230
S. G. Akl and
I. Stojmenovic A simple optimal systolic algorithm for
generating permutations . . . . . . . . 231--239
H. Elhage and
I. Stojmenovic Systolic generation of combinations from
arbitrary elements . . . . . . . . . . . 241--248
D. Bhagavathi and
S. Olariu and
J. L. Schwing and
J. Zhang Convex polygon problems on meshes with
multiple broadcasting . . . . . . . . . 249--256
A. T. Ali and
E. L. Dagless A parallel processing model for
real-time computer vision-aided road
traffic monitoring . . . . . . . . . . . 257--264
W. F. Wong and
C. K. Yuen A model of speculative parallelism . . . 265--272
M. Barnett and
C. Lengauer Unimodularity and the parallelization of
loops . . . . . . . . . . . . . . . . . 273--281
A. Bouabdallah and
J.-C. Konig An improvement of Maekawa's mutual
exclusion algorithm to make it
fault-tolerant . . . . . . . . . . . . . 283--290
A. E. Doroshenko On asynchronous avoidance of deadlocks
in parallel programs . . . . . . . . . . 291--297
G. Galbiati and
F. Maffioli Constructing an exact parity base is in
RCN$^2$ . . . . . . . . . . . . . . . . 301--309
S. Carlsson and
J. Chen Parallel constructions of heaps and
min-max heaps . . . . . . . . . . . . . 311--320
E. A. Albacea Computation list evaluation and its
applications . . . . . . . . . . . . . . 321--329
T. Bossomaier and
N. Isidoro and
A. Loeff Data parallel computation of Euclidean
distance transforms . . . . . . . . . . 331--339
B. Chlebus Two selection algorithms on a
mesh-connected computer . . . . . . . . 341--346
J. Duato Channel classes: a new concept for
deadlock avoidance in wormhole networks 347--354
A. Pelc Broadcasting time in sparse networks
with faulty transmissions . . . . . . . 355--361
E. Bampis and
J.-C. Konig and
D. Trystram A low overhead schedule for a 3D-grid
graph . . . . . . . . . . . . . . . . . 363--372
P. M. Lenders Multi-rate arrays and affine recurrence
equations . . . . . . . . . . . . . . . 373--380
I. De Falco and
R. Del Balio and
E. Tarantino and
R. Vaccaro Simulation of genetic algorithms on MIMD
multicomputers . . . . . . . . . . . . . 381--389
T. Johnson and
T. A. Davis Parallel buddy memory management . . . . 391--398
D. Sieling and
I. Wegener NC-algorithms for operations on binary
decision diagrams . . . . . . . . . . . 3--12
Lih-Hsing Hsu Matching polynomials of series-parallel
graphs . . . . . . . . . . . . . . . . . 13--18
A. Bar-Noy and
S. Kipnis and
B. Schieber An optimal algorithm for computing
census functions in message-passing
systems . . . . . . . . . . . . . . . . 19--23
J. Tromp On update-last schemes . . . . . . . . . 25--28
H.-P. Charles and
P. Fraigniaud Scheduling a scattering-gathering
sequence on hypercubes . . . . . . . . . 29--42
J. Glasa Bit-level systolic arrays for digital
contour smoothing by Abel-Poisson kernel 43--51
H. H. Ali and
H. El-Rewini The time complexity of scheduling
interval orders with communication is
polynomial . . . . . . . . . . . . . . . 53--58
R. Lin and
S. Olariu and
J. L. Schwing and
J. Zhang Simulating enhanced meshes, with
applications . . . . . . . . . . . . . . 59--70
P. Fragopoulou On the efficient summation of N numbers
on an N-processor reconfigurable mesh 71--78
S. Olariu and
W. Shen and
L. Wilson Sub-logarithmic algorithms for the
largest empty rectangle problem . . . . 79--85
P. Gastin and
V. Villain An efficient crash-tolerant sequential
traversal . . . . . . . . . . . . . . . 87--97
I. B. Virbitskaite Some characteristics of nondeterministic
processes . . . . . . . . . . . . . . . 99--106
M. Cosnard Editorial Note . . . . . . . . . . . . . ??
D. Krizanc and
S. Rajasekaran and
S. S. Shende A comparison of meshes with static buses
and half-duplex wrap-arounds . . . . . . 109--114
D. Barth Embedding meshes of $d$-ary trees into
de Bruijn graphs . . . . . . . . . . . . 115--127
S. Cheung and
F. C. M. Lau Time lower bounds for permutation
routing on multi-dimensional bused
meshes . . . . . . . . . . . . . . . . . 129--138
P. J. Looges and
S. Olariu A practical platform for CREW emulation 139--145
H. Schmeck and
H. Schroder and
J. Staunstrup and
M. Middendorf Problem heaps and their evaluation . . . 147--155
P. Thangavel and
V. P. Muthuswamy A parallel algorithm to generate N-ary
reflected Gray codes in a linear array
with reconfigurable bus system . . . . . 157--164
N. Chandrasekharan and
V. S. Lakshmanan and
M. Medidi Efficient parallel algorithms for
finding chordless cycles in graphs . . . 165--170
B. Pradeep and
C. Siva Ram Murthy A constant time algorithm for redundancy
elimination in task graphs on processor
arrays with reconfigurable bus systems 171--177
O. Plata and
T. F. Pena and
F. F. Rivera and
E. L. Zapata An efficient processor allocation for
nested parallel loops on distributed
memory hypercubes . . . . . . . . . . . 179--187
Kuo-Liang Chung and
Hsun-Wen Chang Novel pipelining and processor
allocation strategy for monoid
computations on unshuffle-exchange
networks . . . . . . . . . . . . . . . . 189--193
A. Das and
K. Thulasiraman and
K. B. Lakshmanan and
V. K. Agarwal Distributed fault diagnosis of a ring of
processors . . . . . . . . . . . . . . . 195--204
R. Greenlaw Breadth-depth search is P-complete . . . 209--222
E. N. Caceres and
N. Deo and
S. Sastry and
J. L. Szwarcfiter On finding Euler Tours in parallel . . . 223--231
A. Raman and
C. Pandu Rangan A unified approach to parallel
algorithms for the domatic partition
problem on special classes of perfect
graphs . . . . . . . . . . . . . . . . . 233--241
R. Kulkarni and
S. Date and
B. Kulkarni and
U. Kulkarni and
A. S. Kolaskar PRAS: parallel alignment of sequences
algorithm . . . . . . . . . . . . . . . 243--252
D. Fon-Der-Flaass and
I. Rival Collecting information in graded ordered
sets . . . . . . . . . . . . . . . . . . 253--260
E. J. Schwabe Optimality of a VLSI decomposition
scheme for the deBruijn graph . . . . . 261--265
P. C. Xirouchakis and
P. Y. Wang and
O. Frieder Data parallel visual reconstruction and
partitioning algorithms . . . . . . . . 267--277
P. S. P. Wang Parallel object representation and
recognition . . . . . . . . . . . . . . 279--290
L. Higham and
E. Schenk PRAM memory allocation and
initialization . . . . . . . . . . . . . 291--299
P. Fragopoulou On the comparative powers of the
2D-PARBS and the CRCW-PRAM models . . . 301--304
P. D. Mackenzie A lower bound for order-preserving
broadcast in the postal model . . . . . 313--320
J. Duato On the design of deadlock-free adaptive
multicast routing algorithms . . . . . . 321--333
J. Bruck and
Ching-Tien Ho Efficient global combine operations in
multi-port message-passing systems . . . 335--346
A. L. Liestman and
D. Richards Perpetual gossiping . . . . . . . . . . 347--355
S. Fujita and
M. Yamashita Optimal gossiping in mesh-bus computers 357--361
F. Daniel and
G. Authie Shortest paths multiplicity in
generalized de Bruijn and Kautz networks 363--374
R. Rowley and
B. Bose On the number of arc-disjoint
Hamiltonian circuits in the de Bruijn
graph . . . . . . . . . . . . . . . . . 375--380
A. M. Farley and
A. Proskurowski Self-repairing networks . . . . . . . . 381--391
V. Auletta and
A. A. Rescigno and
V. Scarano Fault tolerant routing in the Supercube 393--405
R. Subramonian and
N. Venkatasubramanyan Efficient multiple-item broadcast in the
logP model . . . . . . . . . . . . . . . 407--417
J. Malard and
C. C. Paige Data replication in dense matrix
factorization . . . . . . . . . . . . . 419--430
F. Pellegrini Bounds for the bandwidth of the $d$-ary
de Bruijn graph . . . . . . . . . . . . 431--443
M. A. Fiol and
J. Fabrega and
O. Serra and
J. L. A. Yebra A unified approach to the design and
control of dynamic memory networks . . . 445--456
Leizhen Cai and
J. M. Keil Degree-bounded spanners . . . . . . . . 457--468
A. Arruabarrena and
R. Beivide and
C. Izu and
J. Miguel A performance evaluation of adaptive
routing in bidimensional cut-through
networks . . . . . . . . . . . . . . . . 469--484
C. Jesshope Latency reduction in VLSI routers . . . 485--494
P. Fiorini The XOmega and the Omega pyramids, a new
family of competitive interconnection
networks . . . . . . . . . . . . . . . . 495--506
Jens Clausen and
Jesper Larsson Traeff Do inherently sequential
branch-and-bound algorithms exist? . . . 3--13
Sajal K. Das and
Ranette H. Halverson Simple deterministic and randomized
algorithms for linked list ranking on
the EREW PRAM model . . . . . . . . . . 15--27
S. B. Yang and
S. K. Dhall and
S. Lakshmivarahan A processor efficient connectivity
algorithm on random graphs . . . . . . . 29--36
Christos Levcopoulos and
Teresa M. Przytycka A work-time trade-off in parallel
computation of Huffman trees and concave
least weight subsequence problem . . . . 37--43
Yi Pan A more efficient constant time algorithm
for computing the Hough transform . . . 45--52
E. I. Milovanovic and
M. D. Mihajlovic and
I. Z. Milovanovic and
M. K. Stojcev Solving tridiagonal linear systems on
MIMD computers . . . . . . . . . . . . . 53--64
Ming-Shin Tsai and
Shing-Tsaan Huang A self-stabilizing algorithm for the
shortest paths problem with a fully
distributed demon . . . . . . . . . . . 65--72
D. Bhagavathi and
S. Olariu and
W. Shen and
L. Wilson A unifying look at semigroup
computations on meshes with multiple
broadcasting . . . . . . . . . . . . . . 73--82
Laxmi P. Gewali and
Ivan Stojmenovic Computing external watchman routes on
PRAM, BSR, and interconnection network
models of parallel computation . . . . . 83--93
Fotios Barlos and
Ophir Frieder Join workload partitioning under uniform
and skewed input relations . . . . . . . 95--104
Hussein M. Alnuweiri A fast reconfigurable network for graph
connectivity and transitive closure . . 105--115
Jerry L. Trahan and
Hosangadi Bhanukumar Parallel Random Access Machines without
Boolean operations . . . . . . . . . . . 117--124
Jose Duato A theory to increase the effective
redundancy in wormhole networks . . . . 125--138
Cheng-Zhong Xu and
Francis C. M. Lau Optimal parameters for load balancing
with the diffusion method in mesh
networks . . . . . . . . . . . . . . . . 139--147
Hesham H. Ali and
Hesham El-Rewini On the intractability of task allocation
in distributed systems . . . . . . . . . 149--157
Paul Beame and
Miroslaw Kutylowski and
Marcin Kik Information broadcasting by
Exclusive-Read PRAMs . . . . . . . . . . 159--169
R. Ramesh R${}^2$-M: A reconfigurable rewrite
machine . . . . . . . . . . . . . . . . 171--180
Giuseppe Persiano An optimal algorithm for the dining
philosophers problem . . . . . . . . . . 181--187
Christian Heckler and
Lothar Thiele Computing linear data dependencies in
nested loop programs . . . . . . . . . . 193--204
Wayne Kelly and
William Pugh Selecting affine mappings based on
performance estimation . . . . . . . . . 205--219
Martin Griebl and
Christian Lengauer On the space-time mapping of WHILE-loops 221--232
Paul Feautrier Toward automatic distribution . . . . . 233--244
Catherine Mongenet Data compiling for systems of uniform
recurrence equations . . . . . . . . . . 245--257
Alain Darte and
Yves Robert On the alignment problem . . . . . . . . 259--270
Florin Balasa and
Frank H. M. Franssen and
Francky V. M. Catthoor and
Hugo J. De Man Transformation of nested loops with
modulo indexing to affine recurrences 271--280
Richard J. Anderson and
Barbara B. Simons A fast heuristic for loop
parallelization . . . . . . . . . . . . 281--299
Vincent van Dongen Compiling distributed loops onto SPMD
code . . . . . . . . . . . . . . . . . . 301--312
Eric Violard A mathematical theory and its
environment for parallel programming . . 313--328
John T. O'Donnell A correctness proof of parallel scan . . 329--338
Kumar Ganapathy and
Benjamin W. Wah Optimal synthesis of processor arrays
with pipelined arithmetic units . . . . 339--350
Maher Rahmouni and
Kevin O'Brien and
Ahmed A. Jerraya A loop-based scheduling algorithm for
hardware description languages . . . . . 351--364
Anonymous Parallelization Techniques for Uniform
Algorithms Workshop . . . . . . . . . . ??
C. Germain and
F. Delaplace and
R. Carlier A static execution model for data
parallelism . . . . . . . . . . . . . . 367--378
F. Comellas and
M. A. Fiol and
J. Gomez On large vertex symmetric $2$-reachable
digraphs . . . . . . . . . . . . . . . . 379--384
Ray-Shyng Chou and
Lih-Hsing Hsu 1-edge fault-tolerant designs for meshes 385--389
Franco Gasperoni and
Uwe Schwiegelshohn Generating close to optimum loop
schedules on parallel processors . . . . 391--403
Mateo Valero and
Eduard Ayguade and
Montse Peiron Network synchronization and out-of-order
access to vectors . . . . . . . . . . . 405--415
Krzysztof Diks and
Adam Malinowski and
Andrzej Pelc Reliable token dispersal with random
faults . . . . . . . . . . . . . . . . . 417--427
Sanjeev Saxena and
P. C. P. Bhatt and
V. C. Prasad On parallel prefix computation . . . . . 429--436
Clive N. Galley and
Costas S. Iliopoulos A simple parallel algorithm for the
single function coarsest partition
problem . . . . . . . . . . . . . . . . 437--445
L. K. Swift and
T. Johnson and
P. E. Livadas Parallel creation of linear octrees from
quadtree slices . . . . . . . . . . . . 447--453
M. Nivat and
G. D. S. Ramkumar and
C. Pandu Rangan and
A. Saoudi and
R. Sundaram Efficient parallel shuffle recognition 455--463
Rong Lin and
Stephan Olariu and
James L. Schwing and
Jingyuan Zhang Computing on reconfigurable buses --- a
new computational paradigm . . . . . . . 465--476
S. K. S. Gupta and
C.-H. Huang and
P. Sadayappan and
R. W. Johnson Implementing fast Fourier transforms on
distributed-memory multiprocessors using
data redistributions . . . . . . . . . . 477--488
S. Sahni Data manipulation on the distributed
memory bus computer . . . . . . . . . . 3--14
P. D. MacKenzie A separation between reconfigurable mesh
models . . . . . . . . . . . . . . . . . 15--22
K. Nakano Prefix-sums algorithms on reconfigurable
meshes . . . . . . . . . . . . . . . . . 23--35
A. L. Rosenberg and
V. Scarano and
R. K. Sitaraman The Reconfigurable Ring of Processors:
efficient algorithms via hypercube
simulation . . . . . . . . . . . . . . . 37--48
Y. Ben-Asher The Cartesian product problem and
implementing production systems on
reconfigurable meshes . . . . . . . . . 49--61
T. Suel Permutation routing and sorting on
meshes with row and column buses . . . . 63--80
M. Kaufmann and
H. Schroder and
J. F. Sibeyn Routing and sorting on reconfigurable
meshes . . . . . . . . . . . . . . . . . 81--95
C. Germain and
F. Cappello The static network: a high performance
reconfigurable communication network . . 97--109
K. Nakano A bibliography of published papers on
dynamically reconfigurable architectures 111--124
M. Cosnard Editorial Note . . . . . . . . . . . . . 125
Louis Ibarra and
Dana Richards Tree open ear decomposition in parallel
graph algorithms . . . . . . . . . . . . 129--138
Torben Hagerup and
Jörg Keller Fast parallel permutation algorithms . . 139--148
Danny Krizanc and
Lata Narayanan Zero-one sorting on the mesh . . . . . . 149--155
F. Desprez and
J. J. Dongarra and
B. Tourancheau Performance study of LU factorization
with low communication overhead on
multiprocessors . . . . . . . . . . . . 157--169
Mohan Ahuja and
Michel Raynal An implementation of global flush
primitives using counters . . . . . . . 171--178
Wentong Cai and
David B. Skillicorn Calculating recurrences using the
Bird-Meertens formalism . . . . . . . . 179--190
Murray I. Cole Parallel programming with list
homomorphisms . . . . . . . . . . . . . 191--203
Sandy Pavel and
Selim G. Akl Efficient algorithms for the Euclidean
distance transform . . . . . . . . . . . 205--212
Ching-Tien Ho and
Ming-Yang Kao Efficient broadcast on hypercubes with
wormhole and $e$-cube routings . . . . . 213--222
Omer Berkman and
Yossi Matias Fast parallel algorithms for minimum and
related problems with small integer
inputs . . . . . . . . . . . . . . . . . 223--230
S. Bhattacharya and
S. Kirani and
W. T. Tsai Quadtree layouts and I/O bandwidth . . . 231--240
Sotirios G. Ziavras Scalable multifolded hypercubes for
versatile parallel computers . . . . . . 241--250
R. Andonov and
P. Quinton and
S. Rajopadhye and
D. Wilde A shift register-based systolic array
for the unbounded knapsack problem . . . 251--262
Mark A. Stalzer A parallel fast multipole method for the
Helmholtz equation . . . . . . . . . . . 263--274
Beate Bollig and
Martin Huhne and
Stefan Polt and
Petr Savicky On the average case circuit delay of
disjunction . . . . . . . . . . . . . . 275--280
Jerrell Watts and
Robert Van De Geijn A pipelined broadcast for
multidimensional meshes . . . . . . . . 281--292
Giancarlo Bongiovanni and
Pierluigi Crescenzi and
Sergio De Agostino MAX SAT and MIN SET cover approximation
algorithms are P-complete . . . . . . . 293--298
Rolf Niedermeier and
Peter Rossmanith On optimal OROW-PRAM algorithms for
computing recursively defined functions 299--309
David R. Lutz and
D. N. Jayasimha Do fixed-processor communication-time
tradeoffs exist? . . . . . . . . . . . . 311--320
Jie Wu Tight bounds on the number of
$\ell$-nodes in a faulty hypercube . . . 321--328
M. G. Norman and
S. Pelagatti and
P. Thanisch On the complexity of scheduling with
communication delay and contention . . . 331--341
S. Mahesh and
C. Siva Ram Murthy and
C. Pandu Rangan Performance bounds for static
multiprocessor scheduling of multi-task
jobs . . . . . . . . . . . . . . . . . . 343--355
G. Tel Linear election in hypercubes . . . . . 357--366
K. Perumalla and
N. Deo Parallel algorithms for maximum
subsequence and maximum subarray . . . . 367--373
R. Correa and
A. Ferreira On the effectiveness of synchronous
parallel branch-and-bound algorithms . . 375--386
A. Chandra and
R. Melhem Reconfiguration in fault-tolerant 3D
meshes . . . . . . . . . . . . . . . . . 387--399
M. S. Merry and
J. Baker A constant time sorting algorithm for a
three dimensional reconfigurable mesh
and reconfigurable network . . . . . . . 401--412
D. J. Haglin Bipartite expander matching is in NC . . 413--420
J. Collard and
T. Risset and
P. Feautrier Construction of DO loops from systems of
affine constraints . . . . . . . . . . . 421--436
B. K. Szymanski and
W. Maniatty and
B. Sinharoy Simultaneous parallel reduction on SIMD
machines . . . . . . . . . . . . . . . . 437--449
I. W. Chan and
F. Choi An optimal systolic dictionary . . . . . 451--460
G. Oksa Time-minimal linear systolic arrays for
the Toeplitz system of linear equations 461--474
N. Drach and
A. Gefflaut and
P. Joubert and
A. Seznec About cache associativity in low-cost
shared memory multi-microprocessors . . 475--487
A. Pelc Almost-safe Byzantine agreement in
sparse networks with random faults . . . 489--497
C. Qiao On designing communication-intensive
algorithms for a spanning optical bus
based array . . . . . . . . . . . . . . 499--511
M. Picquendar and
A. L. Rosenberg and
V. Scarano A cost-effective streamlining of the
DIOGENES design methodology . . . . . . 513--524
M. Cosnard and
M. Loi Automatic task graph generation
techniques . . . . . . . . . . . . . . . 527--538
Qi Ning and
V. van Dongen and
G. R. Gao Automatic data and computation
decomposition for distributed-memory
machines . . . . . . . . . . . . . . . . 539--550
A. Darte and
F. Vivien Revisiting the decomposition of Karp,
Miller and Winograd . . . . . . . . . . 551--562
V. Gupta and
E. Schenfeld Task graph partitioning and mapping in a
reconfigurable parallel architecture . . 563--574
B. Lee and
A. R. Hurson A strategy for scheduling partially
ordered program graphs onto
multicomputers . . . . . . . . . . . . . 575--586
S. Ramaswamy and
P. Banerjee Simultaneous allocation and scheduling
using convex programming techniques . . 587--598
B. Shirazi and
Hee Yong Youn and
D. M. Lorts Evaluation of static scheduling
heuristics for real-time multiprocessing 599--610
R. Wolski Static scheduling of hierarchical
program graphs . . . . . . . . . . . . . 611--622
Yung-Kang Chu and
D. T. Rover An effective two-dimensional mesh
partitioning strategy . . . . . . . . . 623--634
M. A. Palis and
Jing-Chiou Liou and
S. Rajasekaran and
S. Shende and
D. S. L. Wei Online scheduling of dynamic trees . . . 635--646
Jhy-Chun Wang and
Tseng-Hui Lin and
S. Ranka Distributed scheduling of unstructured
collective communication on the CM-5 . . 647--658
Min-You Wu Parallel incremental scheduling . . . . 659--670
F. T. Chong and
S. D. Sharma and
E. A. Brewer and
J. Saltz Multiprocessor runtime support for
fine-grained, irregular DAGs . . . . . . 671--683
B. Kumar and
K. Eswar and
P. Sadayappan and
C.-H. Huang A clustering algorithm for parallel
sparse Cholesky factorization . . . . . 685--696
Brian Grayson and
Robert Van De Geijn A high performance parallel Strassen
implementation . . . . . . . . . . . . . 3--12
Clementin Tayou Djamegni and
Maurice Tchuente Scheduling of the DAG associated with
pipeline inversion of triangular
matrices . . . . . . . . . . . . . . . . 13--26
Ivan Stojmenovic Generating $n$-ary reflected Gray codes
on a linear array of processors . . . . 27--34
Dany Breslauer and
Ramesh Hariharan Optimal parallel construction of minimal
suffix and factor automata . . . . . . . 35--44
Min-You Wu A parallel scheduling algorithm for tree
structured interconnection networks . . 45--54
Marios D. Dikaiakos and
Anne Rogers and
Kenneth Steiglitz Functional algorithm simulation of the
fast multipole method: Architectural
implications . . . . . . . . . . . . . . 55--66
A. A. Veglis and
A. S. Pombortsis Memory bandwidth analysis of
shared-memory multiprocessors using
dynamic request rate . . . . . . . . . . 67--74
Geunmo Kim and
Hyunsoo Yoon Free submesh list strategy: a best fit
submesh allocation in mesh connected
multicomputers . . . . . . . . . . . . . 75--86
Yosi Ben-Asher and
Assaf Schuster Low crosstalk address encodings for
optical message switching systems . . . 87--100
Andre Hily and
Dominique Sotteau Gossiping in $d$-dimensional mesh-bus
networks . . . . . . . . . . . . . . . . 101--113
Krishnamurthi Ravishankar and
Suresh Singh Gossiping on a ring with radios . . . . 115--126
Qian-Ping Gu and
Shietung Peng Fault tolerant routing in hypercubes and
star graphs . . . . . . . . . . . . . . 127--136
David M. Koppelman A lower bound on the average physical
length of edges in the physical
realization of graphs . . . . . . . . . 137--143
Alain Darte and
Michele Dion and
Yves Robert A characterization of one-to-one modular
mappings . . . . . . . . . . . . . . . . 145--157
Jordi Garcia and
Eduard Ayguadé and
Jesus Labarta Using a $0$-$1$ integer programming
model for automatic static data
distribution . . . . . . . . . . . . . . 159--171
Wesley K. Kaplow and
Boleslaw K. Szymanski Program optimization based on
compile-time cache performance
prediction . . . . . . . . . . . . . . . 173--184
M. Cosnard Editorial Note . . . . . . . . . . . . . ??
J. JáJá and
Kwan Woo Ryu An optimal randomized parallel algorithm
for the single function coarsest
partition problem . . . . . . . . . . . 187--193
C. N. Galley An $\Omega(\log n - k \log k)$ time
linear cost lower bound for the $k$
functions coarsest partition problem . . 195--202
J.-L. Roch and
G. Villard Fast parallel computation of the Jordan
normal form of matrices . . . . . . . . 203--212
P. Ferragina and
F. Luccio Three techniques for parallel
maintenance of a minimum spanning tree
under batch of updates . . . . . . . . . 213--222
S. Chaudhuri and
Y. Dimopoulos and
C. D. Zaroliagis On the parallel complexity of acyclic
logic programs . . . . . . . . . . . . . 223--230
Y. Ben-Asher and
A. Schuster Time-size tradeoffs for reconfigurable
meshes . . . . . . . . . . . . . . . . . 231--245
C. Armen and
D. B. Johnson Deterministic leader election on the
asynchronous QRQW PRAM . . . . . . . . . 247--250
J. Allen Carruth and
J. Misra Proof of a real-time mutual-exclusion
algorithm . . . . . . . . . . . . . . . 251--257
A. K. Singh Bounded timestamps in process networks 259--264
M. Mizuno and
M. L. Neilsen and
M. Raynal An optimistic protocol for a
linearizable distributed shared memory
system . . . . . . . . . . . . . . . . . 265--278
Z. N. Grant-Duff and
P. G. Harrison Parallelism via homomorphisms . . . . . 279--295
M. Cosnard Editorial Note . . . . . . . . . . . . . ??
C. S. Iliopoulos and
M. Korda Optimal parallel superprimitivity
testing for square arrays . . . . . . . 299--308
G. Destri and
P. Marenzoni Benchmarking lattice-based applications
on parallel architectures . . . . . . . 309--320
M. Furer and
B. Raghavachari Parallel edge coloring approximation . . 321--329
Bung-Feng Wang A better analysis of Ben-Asher's
algorithm for the conditional Cartesian
product problem . . . . . . . . . . . . 331--344
Kuo-Liang Chung Image template matching on
reconfigurable meshes . . . . . . . . . 345--353
M. P. Bekakos and
O. B. Efremides A class of systolic tridiagonal linear
solvers . . . . . . . . . . . . . . . . 355--364
J. M. Claver and
V. Hernandez and
E. S. Quintana Solving discrete-time Lyapunov equations
for the Cholesky factor on a shared
memory multiprocessor . . . . . . . . . 365--376
R. Fernandes and
A. Kanevsky On recursive interconnection networks
and their extensions . . . . . . . . . . 377--388
D. M. Nicol and
Weizhan Mao On bottleneck partitioning of $k$-ary
$n$-cubes . . . . . . . . . . . . . . . 389--399
Jingling Xue Generalising the unimodular approach to
restructure imperfectly nested loops . . 401--414
Y. Le Guyadec and
B. Virot Sequential-like proofs of data-parallel
programs . . . . . . . . . . . . . . . . 415--426
C. Jard and
G.-V. Jourdan Incremental transitive dependency
tracking in distributed computations . . 427--435
M. Pal and
G. P. Bhattacharjee An optimal parallel algorithm to color
an interval graph . . . . . . . . . . . 439--449
D. Z. Chen and
Xiaobo Hu Fast and efficient operations on
parallel priority queues . . . . . . . . 451--467
Ding-Ming Kwai and
B. Parhami A generalization of hypercubic networks
based on their chordal ring structures 469--477
P. K. Srimani Super rotator: incrementally extensible
directed network graph of sublogarithmic
diameter . . . . . . . . . . . . . . . . 479--490
D. Cachera and
G. Utard Proving data-parallel programs: a
unifying approach . . . . . . . . . . . 491--505
L. Diaz De Cerio and
A. Gonzalez and
M. Valero-Garcia Communication pipelining in hypercubes 507--523
C. Herrmann and
C. Lengauer On the space-time mapping of a class of
divide-and-conquer recursions . . . . . 525--537
C. Scheiman and
P. Cappello A processor-time-minimal design for 3D
rectilinear mesh algorithms . . . . . . 539--550
A. K. Gupta and
G. W. Greenwood Applications of evolutionary strategies
to fine-grained task scheduling . . . . 551--561
Bu-Sung Lee and
A. Heng and
W. Cai and
Tai-Ann Tan Task scheduling facility for PVM . . . . 563--574
H. T. Siegelmann On NIL: the software constructor of
neural networks . . . . . . . . . . . . 575--582
D. Ambroise and
B. Rozoy Marrella: a tool to analyse the graph of
states . . . . . . . . . . . . . . . . . 583--594
Anonymous Editorial Note . . . . . . . . . . . . . 1
Andrzej Lingas and
Anil Maheshwari A simple optimal parallel algorithm for
reporting paths in a tree . . . . . . . 3--11
Mallika De and
Bhabani P. Sinha Fast parallel multiplication using
redundant quarternary number system . . 13--23
Christos D. Zaroliagis Simple and work-efficient parallel
algorithms for the minimum spanning tree
problem . . . . . . . . . . . . . . . . 25--37
Michele Flammini On the hardness of devising interval
routing schemes . . . . . . . . . . . . 39--47
Yaagoub A. Ashir and
Iain A. Stewart On Embedding Cycles in $k$-Ary $n$-Cubes 49--55
Adele Anna Rescigno Fault-Tolerant Parallel Communication in
the Star Network . . . . . . . . . . . . 57--68
Adam Malinowski Efficient Byzantine Agreement in
Networks with Random Faults . . . . . . 69--76
Shahram Latifi and
Ramesh Gajjala Reliability Evaluation of Braided
Networks Using a Recursive Method . . . 77--88
Timothy Brecht and
Xiaotie Deng and
Nian Gu Competitive Dynamic Multiprocessor
Allocation for Parallel Applications . . 89--100
J.-P. Bodeveix and
M. Filali Towards the Automatic Verification of
Atomic Memory Protocols . . . . . . . . 101--112
Anonymous Editorial Note . . . . . . . . . . . . . 113
Jean-Fançois Collard and
Martin Griebl Array Dataflow Analysis for Explicitly
Parallel Programs . . . . . . . . . . . 117--131
Alain Darte and
Frédéric Vivien Parallelizing nested loops with
approximation of distance vectors: a
survey . . . . . . . . . . . . . . . . . 133--144
Manish Gupta and
Edith Schonberg Static Analysis to Reduce
Synchronization Costs Data-Parallel
Programs with Remote Memory Copy . . . . 145--156
Chi-Chung Lam and
P. Sadayappan and
Rephael Wenger On Optimizing a Class of
Multi-Dimensional Loops with Reduction
for Parallel Execution . . . . . . . . . 157--168
Hyuk-Jae Lee and
José A. B. Fortes Modular Mappings and Data Distribution
Independent Computations . . . . . . . . 169--180
Patrice Quinton and
Sanjay Rajopadhye and
Tanguy Risset On Manipulating $Z$-Polyhedra Using a
Canonical Representation . . . . . . . . 181--194
A. Venkatachar and
J. Ramanujam and
A. Thirumalai Communication Generation for
Block-Cyclic Distributions . . . . . . . 195--202
D. Wilde and
S. Rajopadhye Memory Reuse Analysis in the Polyhedral
Model . . . . . . . . . . . . . . . . . 203--215
M. Cosnard Editorial Note . . . . . . . . . . . . . 217
Sanguthevar Rajasekaran and
Sartaj Sahni Deterministic Routing on the Array with
Reconfigurable Optical Buses . . . . . . 219
Petri\csor Panaite Routing Permutations on a $2$D Grid with
One-Way Edges . . . . . . . . . . . . . 225
Maurelio Boari and
Antonioo Corradi and
Letizia Leonardi A Routing Strategy for Object-Oriented
Applications in Massively Parallel
Architectures . . . . . . . . . . . . . 237
Paul Spirakis and
Vassilis Triantafillou Pure Greedy Hot-Potato Routing in the
$2$-D Mesh with Random Destinations . . 249
F. K. Hwang and
Tzai-Shunne Lin and
Rong-Hong Jan A Permutation Routing Algorithm for
Double Loop Networks . . . . . . . . . . 259
Ronald I. Greenberg and
Shih-Chuan Hung and
Jau-Der Shih Parallel Algorithms for Single-Layer
Channel Routing . . . . . . . . . . . . 267
Chihming Chang and
Rami Melhem Arbitrary Size Benes Networks . . . . . 279
Jin S. Kim and
Seung Ryoul Maeng and
H. Yoon Ring Embedding in Hypercubes with
Faculty Nodes . . . . . . . . . . . . . 285
Daniel S. Hirschberg and
Lynn M. Stauffer Dictionary Compression on the PRAM . . . 297
Nadjib Badache and
Aomar Maddi Gradual Design of a Causal Broadcast
Protocol . . . . . . . . . . . . . . . . 309
Marina Papatriantafilou and
Philippas Tsigas On Self-Stabilizing Wait-Free Clock
Synchronization . . . . . . . . . . . . 321
Maurad Debbabi A Model-Based Concurrent Specification
Language over CML: Semantic Foundations 329
Anonymous Editorial Note . . . . . . . . . . . . . 357
Xin Yuan and
Rajiv Gupta and
Rami Melhem Demand-Driven Data Flow Analysis for
Communication Optimization . . . . . . . 359
Ulrich Kremer Optimal and Near--Optimal Solutions for
Hard Compilation Problems . . . . . . . 371
Alain Darte and
Georges-André Silber and
Frédéric Vivien Combining Retiming and Scheduling
Techniques for Loop Parallelization and
Loop Tiling . . . . . . . . . . . . . . 379
Wesley K. Kaplow and
Boleslaw K. Szymanski Compile-Time Cache Performance
Prediction and Its Application to Tiling 393
Jingling Xue On Tiling as a Loop Transformation . . . 409
Yunheung Paek and
David A. Padua Compiling for Scalable Multiprocessors
with Polaris . . . . . . . . . . . . . . 425
Robert Schreiber High Performance Fortran, Version 2 . . 437
Anonymous Editorial Note . . . . . . . . . . . . . 1
E. G. Coffman, Jr. and
S. Even A Note on Limited Preemption . . . . . . 3
Shlomi Dolev Optimal Time Self-Stabilization in
Uniform Dynamic Systems . . . . . . . . 7
Vincent Vajnovszki and
Jean Pallo Parallel Algorithms for Listing
Well-Formed Parentheses Strings . . . . 19
Padma Raghavan Efficient Parallel Sparse Triangular
Solution Using Selective Inversion . . . 29
Yung-Syau Chen and
Jean-Luc Gaudiot Implementing Parallel Branch-and-Bound
with Extended Sisal 2.0 . . . . . . . . 41
Lionel Brunie and
Harald Kosch and
Wolfgang Wohner From the Modeling of Parallel Relational
Query Processing to Query Optimization
and Simulation . . . . . . . . . . . . . 51
J. Mattes and
D. Trystram and
J. Demongeot Parallel Image Processing Using Neural
Networks: Applications in Contrast
Enhancement of Medical Images . . . . . 63
Baback A. Izadi and
Füsun Özgüner Optimal Subcube Allocation in a
Circuit-Switched Faulty Hypercube . . . 77
Amir Michail Optimal Broadcast and Summation on
Hierarchical Ring Architectures . . . . 83
L. Prylli and
B. Tourancheau Execution-Driven Simulation of Parallel
Applications . . . . . . . . . . . . . . 95
S. Ramesh and
Chandrashekhar M. Shetty Impossibility of Synchronization in the
Presence of Preemption . . . . . . . . . 111
Ajoy K. Datta and
Teofilo F. Gonzalez and
Visalakshi Thiagarajan Self-Stabilizing Algorithms for Tree
Metrics . . . . . . . . . . . . . . . . 121
Anonymous Editorial Note . . . . . . . . . . . . . 135
Arthur L. Liestman and
Nata\vsa Pr\vzulj Minimum Average Time Broadcast Graphs 139--147
Hovhannes A. Harutyunyan and
Arthur L. Liestman Messy Broadcasting . . . . . . . . . . . 149--159
Joseph G. Peters and
Curtis C. Spencer Global Communication on Circuit-Switched
Toroidal Meshes . . . . . . . . . . . . 161--175
Krzysztof Diks and
Evangelos Kranakis and
Andrzej Pelc Broadcasting in Unlabeled Tori . . . . . 177--188
Satoshi Fujita and
Stephane Perennes and
Joseph G. Peters Neighbourhood Gossiping in Hypercubes 189--195
Juraj Hromkovi\vc and
Ralf Klasing and
Dana Pardubská and
Juraj Waczulík and
Hubert Wagener Effective Systolic Algorithms for
Gossiping in Cycles . . . . . . . . . . 197--205
Tamar Eilam and
Michele Flammini and
Shmuel Zaks A Complete Characterization of the Path
Layout Construction Problem for ATM
Networks with Given Hop Count and Load 207--220
A. A. Rescigno and
U. Vaccaro Highly Fault-Tolerant Routing in the
Star and Hypercube Interconnection
Networks . . . . . . . . . . . . . . . . 221--230
Markus Röttger and
Ulf-Peter Schroeder Embedding $2$-Dimensional Grids into
Optimal Hypercubes with Edge-Congestion
$1$ or $2$ . . . . . . . . . . . . . . . 231--242
John Ellis and
Minko Markov Embedding Grids into Grids: Dilation
Four Suffices . . . . . . . . . . . . . 243--250
David W. Krumme An Optimal Disjoint Pair of Additive
Spanners for the $3$D Grid . . . . . . . 251--258
Thomas Andreae and
Martin Hintz On Hypercubes in de Bruijn Graphs . . . 259--268
Anonymous Instructions for typesetting
camera-ready manuscripts using computer
software . . . . . . . . . . . . . . . . 269--273
F. Comellas and
G. Giménez Genetic Programming to Design
Communication Algorithms for Parallel
Architectures . . . . . . . . . . . . . 549
Micha Hofri and
David L. Thomson Matrix Transposition on a Mesh with
Blocking Transmissions . . . . . . . . . 561
Arthur M. Farley Optimally Routable Networks . . . . . . 567
Jong Hyuk Choi and
Kyu Ho Park Segment Directory: An Improvement to the
Pointer in Directory Cache Coherence
Schemes . . . . . . . . . . . . . . . . 577
Vicent Cholvi Specification of the Behavior of Memory
Operations in Distributed Systems . . . 589
Anonymous Author Index Volume 8 (1998) . . . . . . 599
Anonymous Editorial Note . . . . . . . . . . . . . 269
Anonymous Editorial Note . . . . . . . . . . . . . 270
Jerry L. Trahan and
Anu G. Bourgeois and
Ramachandran Vaidyanathan Tighter and Broader Complexity Results
for Reconfigurable Models . . . . . . . 271
Yueming Li and
Jianhui Tao and
S. Q. Zheng A Symmetric Processor Array with
Synchronous Optical Buses and Switches 283
Tzung-Pei Hong and
Jyh-Jong Lee A Nearly Optimal Back-Propagation
Learning Algorithm on a Bus-Based
Architecture . . . . . . . . . . . . . . 297
Jie Wu Fault-Tolerant Communications in
Cube-Based Multiple-Bus Systems . . . . 307
Chunming Qiao and
Yousong Mei An Improved Embedding of Binary Trees in
a Square Reconfigurable Array with
Spanning Optical Buses . . . . . . . . . 321
Sook-Yeon Kim and
Oh-Heum Kwon and
Kyung-Yong Chwa Embeddings of Butterflies into
Hypermeshes . . . . . . . . . . . . . . 337
M. Manzur Murshed and
Richard P. Brent Constant Time Algorithms for Computing
the Contour of Maximal Elements on a
Reconfigurable Mesh . . . . . . . . . . 351
Tarun Anand and
Phalguni Gupta A Selection Algorithm for $X + Y$ on
Mesh . . . . . . . . . . . . . . . . . . 363
J.-C. Bermond and
E. Darrot and
O. Delmas and
S. Perennes Hamilton Cycle Decomposition of the
Butterfly Network . . . . . . . . . . . 371
Marek Karpinski and
Wojciech Rytter On a Sublinear Time Parallel
Construction of Optimal Binary Search
Trees . . . . . . . . . . . . . . . . . 387
E. Bampis and
A. Giannakos and
A. Karzanov and
Y. Manoussakis and
I. Milis A Parallel Algorithm for Finding a
Perfect Matching in a Planar Graph . . . 399
Paraskevas Evripidou and
Robert Barry Mapping Fortran Programs to Single
Assignment Semantics for Efficient
Parallelization . . . . . . . . . . . . 407
Anonymous Editorial Note . . . . . . . . . . . . . 419
Michel Charpentier and
Gérard Padiou Specification and Verification of the
ATMR Protocol Using Unity Part 1:
Modeling and Specification of the
Protocal . . . . . . . . . . . . . . . . 421
Michel Charpentier and
Gérard Padiou Specification and Verification of the
ATMR Protocol Using Unity Part 2:
Correctness Proof . . . . . . . . . . . 433
Sergei Gorlatch and
Holger Bischof A Generic MPI Implementation for a
Data-Parallel Skeleton: Formal
Derivation and Application to FFT . . . 447
Teodor Rus and
Eric van Wyk Using Model Checking in a Parallelizing
Compiler . . . . . . . . . . . . . . . . 459
Beverly A. Sanders and
Berna L. Massingill and
Svetlana Kryukova Derivation of an Algorithm for Location
Management for Mobile Communication
Devices . . . . . . . . . . . . . . . . 473
Andy Marsh A Novel Algorithm and its Hardware
Support for the Run-Time Detection of
And-Parallelism . . . . . . . . . . . . 489
M. Hamdi and
C. Qiao and
Y. Pan On the Computing Power of Arrays of
Processors with Optical Pipelined Buses 503
Thierry Lecroq and
Jean-Frederic Myoupo and
David Seme A One-Phase Parallel Algorithm for the
Sequence Alignment Problem . . . . . . . 515
Luca Trevisan and
Fatos Xhafa The Parallel Complexity of Positive
Linear Programming . . . . . . . . . . . 527
Andy Marsh and
Dimitra I. Kaklamani and
Konstantinos Adam Using Parallel Processing as a
Computational Tool to Solve Multi-Plate
Electromagnetic Scattering Problems . . 535
Anonymous Editorial Note . . . . . . . . . . . . . 1
Vassilios V. Dimakopoulos and
Nikitas J. Dimopoulos On Broadcasting Time . . . . . . . . . . 3
Pierre Fraigniaud and
Sandrine Vial Comparison of Heuristics for One-To-All
and All-To-All Communications In Partial
Meshes . . . . . . . . . . . . . . . . . 9
Jyh-Jian Sheu and
Lih-Hsing Hsu Fault Diameter for Supercubes . . . . . 21
Anil Maheshwari and
Jörg-Rüdiger Sack Simple Optimal Algorithms for
Rectilinear Link Path and Polygon
Separation Problems . . . . . . . . . . 31
Sun-Yuan Hsieh and
Chin-Wen Ho and
Tsan-Sheng Hsu and
Ming-Tat Ko and
Gen-Huey Chen Efficient Parallel Algorithms on
Distance Hereditary Graphs . . . . . . . 43
Michael J. Dinneen and
Jose A. Ventura and
Mark C. Wilson and
Golbon Zakeri Construction of Time-Relaxed Minimal
Broadcast Networks . . . . . . . . . . . 53
Alexandros V. Gerbessiotis and
Constantinos J. Siniolakis Efficient Deterministic Sorting on the
BSP Model . . . . . . . . . . . . . . . 69
Emmanuel Delacourt and
Jean-Frederic Myoupo and
David Seme A Constant Time Parallel Detection of
Repetitions . . . . . . . . . . . . . . 81
Vincent Vajnovszki and
Chris Phillips Systolic Generation of $k$-ary Trees . . 93
Limin Xiang and
Kazuo Ushijima Decoding and Drawing on BSR for a Binary
Tree from its I-P Sequence . . . . . . . 103
Sajal K. Das and
Paolo Ferragina An EREW PARM Algorithm for Updating
Minimum Spanning Trees . . . . . . . . . 111
Vijay K. Garg and
Michel Raynal Normality: A Consistency Condition for
Concurrent Objects . . . . . . . . . . . 123
Gagan Agrawal Data Distribution Analysis for Irregular
and Adaptive Codes . . . . . . . . . . . 135
Peter Benner and
José M. Claver and
Enrique S. Quintana-Orti Parallel Distributed Solvers for Large
Stable Generalized Lyapunov Equations 147
Frederic T. Chong and
Anant Agarwal Shared Memory Versus Message Passing for
Iterative Solution of Sparse, Irregular
Problems . . . . . . . . . . . . . . . . 159
Anonymous Editorial Note . . . . . . . . . . . . . 171
Renato Ferreira and
Tahsin Kurc and
Michael Beynon and
Chialin Chang and
Alan Sussman and
Joel Saltz Object-Relational Queries into
Multidimensional Databases with the
Active Data Repository . . . . . . . . . 173
Pierre Boulet and
Jack Dongarra and
Fabrice Rastello and
Yves Robert and
Frédéric Vivien Algorithmic Issues on Heterogeneous
Computing Platforms . . . . . . . . . . 197
Jeffrey K. Hollingsworth and
Ethan L. Miller and
Kennedy Akala Binary Version Management for
Computational Grids . . . . . . . . . . 215
Rich Wolski Predicting CPU Availability on the
Computational Grid Using the Network
Weather Service . . . . . . . . . . . . 227
O. Larsson and
M. Feig and
L. Johnsson Some Metacomputing Experiences for
Scientific Applications . . . . . . . . 243
G. A. Geist II and
James Arthur Kohl and
Stephen Scott and
Philip M. Papadopoulos Harness: Adaptable Virtual Machine
Environment for Heterogeneous Cluster 253
Erwin Laure and
Piyush Mehrotra and
Hans Zima Opus: Heterogeneous Computing with Data
Parallel Tasks . . . . . . . . . . . . . 275
Anh Nguyen-Tuong and
Andrew S. Grimshaw Using Reflection for Incorporating
Fault-Tolerance Techniques into
Distributed Applications . . . . . . . . 291
Anne E. Trefethen and
Mishi Derakhshan and
Stefano Salvini Libraries and Infrastructure for
Clustered Computing . . . . . . . . . . 303
Anonymous Editorial Note . . . . . . . . . . . . . 311
Franck Petit and
Vincent Villain Optimality and Self-Stabilization In
Rooted Tree Networks . . . . . . . . . . 313
Kieran T. Herley and
Andrea Pietracaprina and
Geppino Pucci Fast Deterministic Parallel
Branch-And-Bound . . . . . . . . . . . . 325
Zhenjiang Hu and
Masato Takeichi Calculating An Optimal Homomorphic
Algorithm for Bracket Matching . . . . . 335
Basilio B. Fraguela and
Ramón Doallo and
Emilio L. Zapata Memory Hierarchy Performance Prediction
for Blocked Sparse Algorithms . . . . . 347
Susanne E. Hambrusch and
Hyeong-Seok Lim Minimizing the Diameter In Tree Networks
Under Edge Reductions . . . . . . . . . 361
Hossam Elgindy and
Sanguthevar Rajasekaran Sorting and Selection on a Linear Array
with Optical Bus System . . . . . . . . 373
Lin Chen and
Julius Y. Jiang and
Maung T. Nyeu Provably Fastest Parallel Algorithms for
Bipartite Permutation Graphs . . . . . . 385
Alain Azagury and
Elliot K. Kolodner and
Erez Petrank A Note on the Implementation of
Replication-Based Garbage Collection for
Multithreaded Applications and
Multiprocessor Environments . . . . . . 391
Bu-Sung Lee and
Yan Gu and
Wentong Cai and
Alfred Heng Performance Evaluation of JPVM . . . . . 401
Afonso Ferreira and
Nicolas Schabanel A Randomized BSP/CGM Algorithm for the
Maximal Independent Set Problem . . . . 411
V. Vaidehi and
C. N. Krishnan and
P. Swaminathan An Aided Genetic Algorithm for
Multiprocessor Scheduling . . . . . . . 423
Michel Charpentier and
Mamoun Filali and
Philippe Mauran and
GéRard Padiou and
Philippe QuéInnec The Observation: An Abstract
Communication Mechanism . . . . . . . . 437
M. Cosnard Editorial Note . . . . . . . . . . . . . 451
M. Feil and
A. Uhl and
M. Vajtersic Computation of the Continuous Wavelet
Transform on Massively Parallel SIMD
Arrays . . . . . . . . . . . . . . . . . 453
P. Gonzalez and
J. C. Cabaleiro and
T. F. Pena Parallel Incomplete LU Factorization as
a Preconditioner for Krylov Subspace
Methods . . . . . . . . . . . . . . . . 467
Y. Igarashi and
Y. Nishitani Speedup of the $n$-Process Mutual
Exclusion Algorithm . . . . . . . . . . 475
B. L. Massingill Experiments with Program Parallelization
Using Archetypes and Stepwise Refinement 487
S. G. Akl and
S. D. Bruda Parallel Real-Time Optimization: Beyond
Speedup . . . . . . . . . . . . . . . . 499
M. J. Atallah and
D. Z. Chen and
K. S. Klenk Parallel Algorithms for Longest
Increasing Chains in the Plane and
Related Problems . . . . . . . . . . . . 511
C. Pham and
C. Albrecht Tuning Message Aggregation on High
Performance Clusters for Efficient
Parallel Simulations . . . . . . . . . . 521
A. Chan and
F. Dehne A Note on Coarse Grained Parallel
Integer Sorting . . . . . . . . . . . . 533
J. Carle and
J.-F. Myoupo and
D. Seme All-to-All Broadcasting Algorithms on
Honeycomb Networks and Applications . . 539
G. M. Megson and
X. Liu and
X. Yang Fault-Tolerant Ring Embedding in a
Honeycomb Torus with Node Failures . . . 551
S. K. Das and
A. K. Datta and
S. Tixeuil Self-Stabilizing Algorithms in DAG
Structured Networks . . . . . . . . . . 563
A. Jain Parallel Search and Multisearch in
Matrices with Sorted Columns . . . . . . 575
Anonymous Author Index . . . . . . . . . . . . . . 587
M. Cosnard Editorial Note . . . . . . . . . . . . . 1
F. Petit and
V. Villain Optimality and Self-Stabilization in
Rooted Tree Networks . . . . . . . . . . 3
C. Tayou Djamegni and
M. Tchuente A New Algorithm for Dynamic Programming
on Regular Arrays . . . . . . . . . . . 15
B. W. Kim and
J. H. Choi and
K.-I. Park and
K. H. Park A Wormhole Router with Embedded
Broadcasting Virtual Bus for Mesh
Computers . . . . . . . . . . . . . . . 29
G. De Marco and
A. A. Rescigno Tighter Time Bounds on Broadcasting in
Torus Networks in Presence of Dynamic
Faults . . . . . . . . . . . . . . . . . 39
S. Venema and
H. Shen and
F. Suraweera NC Algorithms for the Single Most Vital
Edge Problem with Respect to All Pairs
Shortest Paths . . . . . . . . . . . . . 51
H. Guyennet and
M. Trehel Load Balancing Using Processor Groups 59
C.-M. Chung and
P.-S. Shin and
S.-D. Kim An Effective Configuration Method for
Java--Internet Computing Environment . . 73
J. Ahn and
T. Han An Analytical Method for Parallelization
of Recursive Functions . . . . . . . . . 87
M. Oskin and
L.-V. Lita and
F. T. Chong and
J. Hensley and
D. Keen Algorithmic Complexity with Page-Based
Intelligent Memory . . . . . . . . . . . 99
V.-Y. Vee and
W.-J. Hsu Locality-Preserving Load-Balancing
Mechanisms for Synchronous Simulations
on Shared-Memory Multiprocessors . . . . 111
E. Bampis and
R. Giroudeau and
J.-C. König Using Duplication for the Multiprocessor
Scheduling Problem with Hierarchical
Communications . . . . . . . . . . . . . 133
R. Tamassia and
I. G. Tollis and
J. S. Vitter A Parallel Algorithm for Planar
Orthogonal Grid Drawings . . . . . . . . 141
Anonymous Editorial Note . . . . . . . . . . . . . 151
P. V. Artigas and
M. Gupta and
S. P. Mikiff and
J. E. Moreira Automatic Loop Transformations and
Parallelization for Java . . . . . . . . 153
E. Rijpkema and
E. F. Deprettere and
B. Kienhuis Deriving Process Networks from Nested
Loop Algorithms . . . . . . . . . . . . 165
V. Loechner and
C. Mongenet Memory Cost Due to Anticipated Broadcast 177
T. Brandes HPF Library and Compiler Support for
Halos in Data Parallel Irregular
Computations . . . . . . . . . . . . . . 189
G. Antoniu and
L. Bougé and
R. Namyst and
C. Pérez Compiling Data-Parallel Programs to a
Distributed Runtime Environment with
Thread Isomigration . . . . . . . . . . 201
D. Quinlan ROSE: Compiler Support for
Object-Oriented Frameworks . . . . . . . 215
S. W. Kim and
R. Eigenmann Where Does the Speedup Go: Quantitative
Modeling of Performance Losses in
Shared-Memory Programs . . . . . . . . . 227
C. A. Herrmann and
C. Lengauer A Higher-Order Language for
Divide-and-Conquer . . . . . . . . . . . 239
Anonymous Editorial Note . . . . . . . . . . . . . 251
E. Boros and
K. Elbassioni and
V. Gurvich and
L. Khachiyan An Efficient Incremental Algorithm for
Generating All Maximal Independent Sets
in Hypergraphs of Bounded Dimension . . 253
J. Blazewicz and
F. Guinand and
B. Penz and
D. Trystram Scheduling Complete Trees on Two Uniform
Processors with Integer Speed Ratios and
Communication Delays . . . . . . . . . . 267
J. Wu On Finding a Hamiltonian Path in a
Tournament Using Semi-Heap . . . . . . . 279
M. Di Ianni Wormhole Deadlock Prediction . . . . . . 295
I. Caragiannis and
C. Kaklamanis and
P. Persiano Symmetric Communication in All-Optical
Tree Networks . . . . . . . . . . . . . 305
C. Kaklamanis and
C. Konstantopoulos and
A. Svolos A Hypercube Algorithm for Sliding Window
Compression . . . . . . . . . . . . . . 315
A. Sengupta and
S. Viswanathan Deadlock-Free Fault-Tolerant Multicast
Routing in Hypercubes . . . . . . . . . 327
J. Diaz and
J. Petit and
M. Serna Faulty Random Geometric Networks . . . . 343
J. Ahn and
T. Han An Analytical Method for Parallelization
of Recursive Functions . . . . . . . . . 359
S. Louca and
N. Neophytou and
A. Lachanas and
P. Evripidou MPI-FT: Portable Fault Tolerance Scheme
for MPI . . . . . . . . . . . . . . . . 371
F. Gruau and
J. Tromp Cellular Gravity . . . . . . . . . . . . 383
Anonymous Author Index . . . . . . . . . . . . . . 395
Anonymous Note from the Editor-in-Chief . . . . . 1
Anonymous Editorial Note . . . . . . . . . . . . . 3
M. Amamiya and
H. Taniguchi and
T. Matsuzaki An Architecture of Fusing Communication
and Execution for Global Distributed
Processing . . . . . . . . . . . . . . . 7
C. Cérin and
J.-L. Gaudiot Benchmarking Clusters of Workstations
Through Parallel Sorting and BSP
Libraries . . . . . . . . . . . . . . . 25
M. Danelutto Efficient Support for Skeletons on
Workstation Clusters . . . . . . . . . . 41
C. Siegelin and
L. Castillo and
U. Finger Smart Cards: Distributed Computing with
\$5 Devices . . . . . . . . . . . . . . 57
L. Arantes and
D. Poitrenaud and
P. Sens and
B. Folliot The Barrier-Lock Clock: A Scalable
Synchronization-Oriented Logical Clock 65
C. Phillips and
R. Perrott Problems with Data Parallelism . . . . . 77
A. Mostefaoui and
M. Raynal Leader-Based Consensus . . . . . . . . . 95
G. L. Reijns and
A. J. C. van Gemund and
H. Gautama Performance Analysis of Multi-Stage
Interconnection Networks with
Deterministic Service Times . . . . . . 109
H. Mongelli and
S. W. Song Parallel Pattern Matching with Scaling 125
P. Evripidou and
G. Samaras and
C. Spyrou and
A. Papagapiou Net-Console: Web-Based Development
Environment for Parallel Programs . . . 139
M. Cosnard and
E. Jeannot Automatic Parallelization Techniques
Based on Compact DAG Extraction and
Symbolic Scheduling . . . . . . . . . . 151
P. Kakulavarapu and
O. C. Maquelin and
J. N. Amaral and
G. R. Gao Dynamic Load Balancers for a
Multithreaded Multiprocessor System . . 169
J. Dongarra and
B. Tourancheau Preface: Clusters and Computational
Grids for Scientific Computing . . . . . 185
D. C. Arnold and
S. S. Vahdiyar and
J. J. Dongarra On the Convergence of Computational and
Data Grids . . . . . . . . . . . . . . . 187--202
M. Baker and
G. Smith Establishing a Reliable Jini
Infrastructure for Parallel Applications 203
G. Chiola and
G. Ciaccio and
C. Anglano On the Use of Coscheduling in Fast
Communication Systems . . . . . . . . . 223
P. Geoffray OPIOM: Off-Processor I/O with Myrinet 237
D. Kranzlmüller Nondeterminism Analysis on
Supercomputers and Clusters . . . . . . 251
B. P. Miller and
M. Christodorescu and
R. Iverson and
T. Kosar and
A. Mirgorodskii and
F. Popovici Playing Inside the Black Box: Using
Dynamic Instrumentation to Create
Security Holes . . . . . . . . . . . . . 267
M. Migliardi and
V. Sunderam Emulating Parallel Programming
Environments in the Harness
Metacomputing System . . . . . . . . . . 281
B. Tourancheau and
R. Westrelin Study of the Medium Message Performance
of BIP/Myrinet . . . . . . . . . . . . . 297
M. Cosnard Editorial Note . . . . . . . . . . . . . 311
V.-Y. Vee and
W.-J. Hsu A Scalable and Efficient Storage
Allocator on Shared-Memory
Multiprocessors . . . . . . . . . . . . 313
M. Diallo and
A. Ferreira and
A. Rau-Chaplin A Note on Communication-Efficient
Deterministic Parallel Algorithms for
Planar Point Location and $2$D
Vorono\"\i Diagram . . . . . . . . . . . 327
S. Lee and
C.-I. Park and
C.-M. Park An Improved Parallel Algorithm for
Delaunay Triangulation on Distributed
Memory Parallel Computers . . . . . . . 341
S. D. Bruda and
S. G. Akl On the Necessity of Formal Models for
Real-Time Parallel Computations . . . . 353
M. Guo Denotational Semantics of an HPF-Like
Data-Parallel Language Model . . . . . . 363
G. Hains and
Q. Miller Preface: High-Level Parallel Programming
and Applications . . . . . . . . . . . . 375
J. Serot Tagged-Token Data-Flow for Skeletons . . 377
A. Zavanella Skeletons, BSP and Performance
Portability . . . . . . . . . . . . . . 393
A. Tiskin A New Way to Divide and Conquer . . . . 409
F. Loulergue Distributed Evaluation of Functional BSP
Programs . . . . . . . . . . . . . . . . 423
Y. Chen and
J. W. Sanders Weakest Specifunctions for BSP . . . . . 439
P. H. J. Kelly and
O. Beckmann and
T. Field and
S. B. Baden THEMIS: Component Dependence Metadata in
Adaptive Parallel Applications . . . . . 455
H.-W. Loidl and
P. W. Trinder and
C. Butz Tuning Task Granularity and Data
Locality of Data Parallel G P H Programs 471
Z. Habbas and
M. Krajecki and
D. Singer Shared Memory Implementation of
Constraint Satisfaction Problem
Resolution . . . . . . . . . . . . . . . 487
Anonymous Author Index . . . . . . . . . . . . . . 503
Anonymous Editorial Note . . . . . . . . . . . . . 1
P. K. K. Loh and
W. J. Hsu Embedding of Fault-Tolerant Trees in the
Josephus Cube . . . . . . . . . . . . . 3
S. Dobrev and
I. Vrto Optimal Broadcasting in Tori with
Dynamic Faults . . . . . . . . . . . . . 17
M. S. Paterson and
H. Schröder and
O. Sýkora and
I. Vrto Permutation Communication in All-Optical
Rings . . . . . . . . . . . . . . . . . 23
D. Barth and
P. Fragopoulou Compact Multicast Algorithms on Grids
and Tori Without Intermediate Buffering 31
A. Afsahi and
N. J. Dimopoulos Analysis of a Latency Hiding
Broadcasting Algorithm on a
Reconfigurable Optical Interconnect . . 41
B. S. Panda and
V. Natarajan and
S. K. Das Parallel Algorithms for Hamiltonian
$2$-Separator Chordal Graphs . . . . . . 51
Y. Kee and
S. Ha An Efficient Implementation of the BSP
Programming Library for VIA . . . . . . 65
D. Irony and
S. Toledo Trading Replication for Communication in
Parallel Distributed-Memory Dense
Solvers . . . . . . . . . . . . . . . . 79
Y. Hayashi and
M. Cole Automated Cost Analysis of a Parallel
Maximum Segment Sum Program Derivation 95
J. Aguilar A Graph Theoretical Model for Scheduling
Simultaneous I/O Operations on Parallel
and Distributed Environments . . . . . . 113
M. Serna and
F. Xhafa The Parallel Approximability of the
False and True Gates Problems for
NOR-Circuits . . . . . . . . . . . . . . 127
S. Gorlatch and
C. Lengauer Foreword . . . . . . . . . . . . . . . . 137
H. Kuchen and
M. Cole Application Programming with Skeletons 141
M. Alt and
H. Bischof and
S. Gorlatch Program Development for Computational
Grids Using Skeletons and Performance
Prediction . . . . . . . . . . . . . . . 157
J. Gerlach Generic Programming of Parallel
Applications with Janus . . . . . . . . 175
C. A. Herrmann and
C. Lengauer Functional Formalisms and
Implementations . . . . . . . . . . . . 193
M. Hidalgo-Herrero and
Y. Ortega-Mallén An Operational Semantics for the
Parallel Language Eden . . . . . . . . . 211
J. Fischer and
S. Gorlatch Turing Universality of Recursive
Patterns for Parallel Programming . . . 229
R. Lechtchinsky and
M. M. T. Chakravarty and
G. Keller Parallel Functional Programming . . . . 249
T. Nitsche Lifting Sequential Functions to Parallel
Skeletons . . . . . . . . . . . . . . . 267
Anonymous Editorial Note . . . . . . . . . . . . . 285
B. Beauquier and
E. Darrot On Arbitrary Size Waksman Networks and
Their Vulnerability . . . . . . . . . . 287
Christian Lavault Embeddings Into the Pancake
Interconnection Network . . . . . . . . 297
Mark Oskin and
Diana Keen and
Justin Hensley and
Lucian-Vlad Lita and
Frederic T. Chong Operating Systems Techniques for
Parallel Computation in Intelligent
Memory . . . . . . . . . . . . . . . . . 311
Colette Johnen and
Luc O. Alima and
Ajoy K. Datta and
Sébastien Tixeuil Optimal Snap-Stabilizing Neighborhood
Synchronizer in Tree Networks . . . . . 327
Krishna M. Kavi and
Dinesh P. Mehta Mutual Exclusion on Optical Buses . . . 341
Sanguthevar Rajasekaran Efficient Parallel Algorithms for
Template Matching . . . . . . . . . . . 359
Limin Xiang and
Kazuo Ushijima and
Jianjun Zhao Time Optimal $n$-Size Matching
Parentheses and Binary Tree Decoding
Algorithms on a $p$-Processor BSR . . . 365
Jop F. Sibeyn Optimal List Ranking on One-Dimensional
Arrays . . . . . . . . . . . . . . . . . 375
Anonymous Author Index Volume 12 (2002) . . . . . 385
Anonymous Editorial Note . . . . . . . . . . . . . 1
Eric Gascard and
Laurence Pierre Formal Proof of Applications Distributed
in Symmetric Interconnection Networks 3
Bernadette Charron-Bost and
Robert Cori A Note on Linearizability and the Global
Time Axiom . . . . . . . . . . . . . . . 19
Yiwei Chiao A Self-Stabilizing Phase Synchronization
Protocol . . . . . . . . . . . . . . . . 25
Jop F. Sibeyn and
Michal \vSoch Optimal Gossiping on CCCs of Even
Dimension . . . . . . . . . . . . . . . 35
Jie Wu and
Fei Dai QoS Routing in Hypercube Multicomputers 43
Eric Gamess Execution of Sequential and Parallel
Java Bytecode in a Metacomputing System 53--64
Selim G. Akl Parallel Real-Time Computation of
Nonlinear Feedback Functions . . . . . . 65
Jordi Petit Combining Spectral Sequencing and
Parallel Simulated Annealing for the
Minla Problem . . . . . . . . . . . . . 77
Jack Dongarra and
Bernard Tourancheau Preface . . . . . . . . . . . . . . . . 93
Geoffroy Vallée and
Renaud Lottiaux and
Louis Rilling and
Jean-Yves Berthou and
Ivan Dutka Malhen and
Christine Morin A Case for Single System Image Cluster
Operating Systems: the Kerrighed
Approach . . . . . . . . . . . . . . . . 95
I-Hsin Chung and
Jeffrey K. Hollingsworth Runtime Selection Among Different API
Implementations . . . . . . . . . . . . 123
Paul Heinzlreiter and
Dieter Kranzlmüller Visualization Services on the Grid: the
Grid Visualization Kernel . . . . . . . 135
Jean-Patrick Gelas and
Saad El Hadri and
Laurent Lef\`evre Towards the Design of a High Performance
Active Node . . . . . . . . . . . . . . 149
Anna Morajko and
Oleg Morajko and
Josep Jorba and
Tom\`as Margalef and
Emilio Luque Automatic Performance Analysis and
Dynamic Tuning of Distributed
Applications . . . . . . . . . . . . . . 169
Cherri M. Pancake Usability Issues in Developing Tools for
the Grid --- and How Visual
Representations Can Help . . . . . . . . 189
James S. Plank and
Scott Atchley and
Ying Ding and
Micah Beck Algorithms for High Performance,
Wide-Area Distributed File Downloads . . 207
O. Beaumont and
A. Legrand and
L. Marchal and
Y. Robert Scheduling Strategies for Mixed Data and
Task Parallelism on Heterogeneous
Clusters . . . . . . . . . . . . . . . . 225
Sivaramakrishnan Narayanan and
Tahsin Kurc and
Umit Catalyurek and
Joel Saltz Database Support for Data-Driven
Scientific Applications in the Grid . . 245
Dawid Kurzyniec and
Tomasz Wrzosek and
Dominik Drzewiecki and
Vaidy Sunderam Towards Self-Organizing Distributed
Computing Frameworks: the H2O Approach 273
Sathish S. Vadhiyar and
Jack J. Dongarra SRS: a Framework for Developing
Malleable and Migratable Parallel
Applications for Distributed Systems . . 291
Gaétan Hains and
Frédéric Loulergue Preface: Special Issue on High-Level
Parallel Programming and Applications 313
M. Bamha and
M. Exbrayat Pipelining a Skew-Insensitive Parallel
Join Algorithm . . . . . . . . . . . . . 317
Vasil P. Vasilev BSPGRID: Variable Resources Parallel
Computation and Multiprogrammed
Parallelism . . . . . . . . . . . . . . 329
Ami Marowka Extending OpenMP for Task Parallelism 341
Xie Yong and
Hsu Wen-Jing Aligned Multithreaded Computations and
Their Scheduling with FAB Performance
Guarantees . . . . . . . . . . . . . . . 353
Frédéric Gava Formal Proofs of Functional BSP Programs 365
Roberto Di Cosmo and
Susanna Pelagatti A Calculus for Dense Array Distributions 377
Yifeng Chen and
J. W. Sanders Top-Down Design of Bulk-Synchronous
Parallel Programs . . . . . . . . . . . 389
Clemens Grelck and
Sven-Bodo Scholz SAC --- From High-Level Programming with
Arrays to Efficient Parallel Execution 401
Kevin Hammond and
Jost Berthold and
Rita Loogen Automatic Skeletons in Template Haskell 413
Emmanuel Chailloux and
Christian Foisy A Portable Implementation for Objective
Caml Flight . . . . . . . . . . . . . . 425
Antonio J. Dorta and
Jesús A. González and
Casiano Rodríguez and
Francisco De Sande LLC: a Parallel Skeletal Language . . . 437
Marco Aldinucci \sf eskimo: Experimenting with Skeletons
in the Shared Address Model . . . . . . 449
Holger Bischof and
Sergei Gorlatch and
Roman Leshchinskiy DatTeL: A Data-Parallel C++ Template
Library . . . . . . . . . . . . . . . . 461
Konrad Hinsen High-Level Parallel Software Development
with Python and BSP . . . . . . . . . . 473
Anders Dessmark and
Andrzej Lingas and
Andrzej Pelc Trade-Offs Between Load and Degree in
Virtual Path Layouts . . . . . . . . . . 485
Mitchell Thornton Performance Evaluation of a Parallel
Decoupled Data Driven Multiprocessor . . 497
Harald Kosch and
Laszlo Böszörményi and
Hermann Hellwagner Editorial Note: ``Part I: the Best
Papers from Euro-Par 2003'' . . . . . . 509
Michel Cosnard Editorial Note: ``Part II: Regular
Papers'' . . . . . . . . . . . . . . . . 511
H. Gautama and
A. J. C. Van Gemund Symbolic Performance Estimation of
Speculative Parallel Programs . . . . . 513
Bernhard Scholz and
Eduard Mehofer and
Nigel Horspool Predicated Partial Redundancy
Elimination Using a Cost Analysis . . . 525
Richard Lawley and
Michael Luck and
Keith Decker and
Terry Payne and
Luc Moreau Automated Negotiation Between Publishers
and Consumers of Grid Notifications . . 537
Thomas Pohl and
Markus Kowarschik and
Jens Wilke and
Klaus Iglberger and
Ulrich Rüde Optimization and Profiling of the Cache
Performance of Parallel Lattice
Boltzmann Codes . . . . . . . . . . . . 549
George Almási and
Ralph Bellofatto and
José Brunheroto and
C\ualin Ca\cscaval and
José G. Castaños and
Paul Crumley and
C. Christopher Erway and
Derek Lieber and
Xavier Martorell and
José E. Moreira and
Ramendra Sahoo and
Alda Sanomiya and
Luis Ceze and
Karin Strauss An Overview of the Bluegene/L System
Software Organization . . . . . . . . . 561
Holger Bischof and
Sergei Gorlatch and
Emanuel Kitzelmann Cost Optimality and Predictability of
Parallel Programming with Skeletons . . 575
F. Cores and
A. Ripoll and
X. Y. Yang and
B. Qazzaz and
R. Suppi and
P. Hernandez and
E. Luque Improving Bandwidth Efficiency in
Distributed Video-On-Demand
Architectures . . . . . . . . . . . . . 589
Pascal Gallard and
Christine Morin Dynamic Streams for Efficient
Communications Between Migrating
Processes in a Cluster . . . . . . . . . 601
Ioannis Chatzigiannakis and
Tassos Dimitriou and
Marios Mavronicolas and
Sotiris Nikoletseas and
Paul Spirakis A Comparative Study of Protocols for
Efficient Data Propagation in Smart Dust
Networks . . . . . . . . . . . . . . . . 615
Konstantin Popov and
Mahmoud Rafea and
Fredrik Holmgren and
Per Brand and
Vladimir Vlassov and
Seif Haridi Parallel Agent-Based Simulation on a
Cluster of Workstations . . . . . . . . 629
L. Garcés-Erice and
E. W. Biersack and
K. W. Ross and
P. A. Felber and
G. Urvoy-Keller Hierarchical Peer-To-Peer Systems . . . 643
Eunice E. Santos Tridiagonal Solvers with Multiple Right
Hand Sides on $k$-Dimensional Mesh and
Torus Interconnection Networks . . . . . 659
Arvind Gupta and
Ramesh Krishnamurti Parallel Algorithms for Vehicle Routing
Problems . . . . . . . . . . . . . . . . 673
Natsuhiko Futamura and
Srinivas Aluru and
Xiaoqiu Huang Parallel Syntenic Alignments . . . . . . 689
Jie Wu and
Li Sheng Deadlock-Free Routing in Irregular
Networks Using Prefix Routing . . . . . 705
Alex Gontmakher and
Sergey Polyakov and
Assaf Schuster Complexity of Verifying Java Shared
Memory Execution . . . . . . . . . . . . 721--734
Anonymous Author Index Volume 13 (2003) . . . . . 735
Jacek B\la\.zewicz and
Klaus Ecker and
Denis Trystram Editorial Note: ``Part I: the Best
Papers from CIRM Workshop (October
2001)'' . . . . . . . . . . . . . . . . 1
Michel Cosnard Editorial Note: ``Part II: Regular
Papers'' . . . . . . . . . . . . . . . . 2
Axel W. Krings and
William S. Harrison and
Azad Azadmanesh and
Miles Mcqueen Scheduling Issues in Survivability
Applications Using Hybrid Fault Models 5
Jacek B\la\.zewicz and
Adrian Moret-Salvador and
Rafa\l Walkowiak Parallel Tabu Search Approaches for
Two-Dimensional Cutting . . . . . . . . 23
F. Drews and
K. Ecker and
O. Kao and
S. Schomann Strategies for Workload Balancing in
Cluster-Based Image Databases . . . . . 33
Maira T. Medina and
Celso C. Ribeiro and
Luiz F. G. Soares Automatic Scheduling of Hypermedia
Documents With Elastic Times . . . . . . 45
Robert Elsässer and
Burkhard Monien and
Robert Preis and
Andreas Frommer Optimal Diffusion Schemes and Load
Balancing on Product Graphs . . . . . . 61
Martin Gairing and
Wayne Goddard and
Stephen T. Hedetniemi and
David P. Jacobs Self-Stabilizing Maximal $k$-Dependent
Sets in Linear Time . . . . . . . . . . 75
Jong-Chuang Tsay Designing a Systolic Algorithm for
Generating Well-Formed Parenthesis
Strings . . . . . . . . . . . . . . . . 83
Marek Karpinski and
Lawrence Larmore and
Yakov Nekrich Work-Efficient Algorithms for the
Construction of Length-Limited Huffman
Codes . . . . . . . . . . . . . . . . . 99
Xiaoli Zhi and
Rong Lu and
Xinda Lu Universal Parallel Solver for
Convection-Diffusion Equations . . . . . 107
Stavros D. Nikolopoulos and
Leonidas Palios Parallel Algorithms for Recognizing
$p_5$-Free and $\bar p_5$-Free Weakly
Chordal Graphs . . . . . . . . . . . . . 119
Anonymous Editorial Note: ``Part I: Editorial from
Alberto Apostolico'' . . . . . . . . . . 131
Anonymous Editorial Note: ``Part II: Regular
Papers'' . . . . . . . . . . . . . . . . 134
Johan Geijer and
Boris Lenhard and
Roxana Merino-Martinez and
Gunnar Norstedt and
Amilcar Flores-Morales Grid Computing for the Analysis of
Regulatory Elements in Co-Regulated Sets
of Genes . . . . . . . . . . . . . . . . 137
J. R. Bilbao-Castro and
R. Marabini and
J. M. Carazo and
I. Garcia and
J. J. Fernandez The Potential of Grid Computing in
Three-Dimensional Electron Microscopy 151
Matteo Comin and
Carlo Ferrari and
Concettina Guerra Grid Deployment of Bioinformatics
Applications: a Case Study in Protein
Similarity Determination . . . . . . . . 163
Lydia Maigne and
David Hill and
Pascal Calvat and
Vincent Breton and
Romain Reuillon and
Delphine Lazaro and
Yannick Legre and
Denise Donnarieix Parallelization of Monte Carlo
Simulations and Submission to a Grid
Environment . . . . . . . . . . . . . . 177
Radu Stefanescu and
Xavier Pennec and
Nicholas Ayache Grid-Enabled Non-Rigid Registration of
Medical Images . . . . . . . . . . . . . 197
Mario Cannataro and
Carmela Comito and
Antonio Congiusta and
Pierangelo Veltri PROTEUS: a Bioinformatics Problem
Solving Environment on Grids . . . . . . 217
Mark L. Green and
Russ Miller A Client-Server Prototype for
Grid-Enabling Application Template
Design . . . . . . . . . . . . . . . . . 241
Jemal H. Abawajy Preemptive Job Scheduling Policy for
Distributively-Owned Workstation
Clusters . . . . . . . . . . . . . . . . 255
Erez Petrank and
Elliot K. Kolodner Parallel Copying Garbage Collection
Using Delayed Allocation . . . . . . . . 271
Sid-Ahmed-Ali Touati and
Christine Eisenbeis Early Periodic Register Allocation on
ILP Processors . . . . . . . . . . . . . 287
Fabien Baille and
Evripidis Bampis and
Christian Laforest A Note on Bicriteria Schedules with
Optimal Approximations Ratios . . . . . 315
Anonymous Editorial Note . . . . . . . . . . . . . 325
Chulho Shin and
Seong-Won Lee and
Jean-Luc Gaudiot The Need for Adaptive Dynamic Thread
Scheduling in Simultaneous
Multithreading . . . . . . . . . . . . . 327
Mary M. Eshaghian-Wilner and
Russ Miller The Systolic Reconfigurable Mesh . . . . 337
Sergio De Agostino Almost Work-Optimal PRAM EREW Decoders
of LZ Compressed Text . . . . . . . . . 351
Burkhard Monien and
Imrich Vr\vto Improved Bounds on Cutwidths of
Shuffle-Exchange and de Bruijn Graphs 361
Doina Bein and
Wolfgang W. Bein and
Natasa Brajkovska and
Shahram Latifi Optimal Embedding of Honeycomb Networks
into Hypercubes . . . . . . . . . . . . 367
Ladislav Stacho and
Jozef \vSirá\vn and
Sanming Zhou Routing Balanced Communications on
Hamilton Decomposable Networks . . . . . 377
Martin Gairing and
Wayne Goddard and
Stephen T. Hedetniemi and
Petter Kristiansen and
Alice A. Mcrae Distance-Two Information in
Self-Stabilizing Algorithms . . . . . . 387
Xiaofan Yang and
Graham M. Megson and
Shaomln Zhang and
Xiaoping Liu A Solution to the Three Disjoint Path
Problem on Honeycomb Meshes . . . . . . 399
Xiaofan Yang and
Graham M. Mengson and
Shaomin Zhang and
Xiaoping Liu A Solution to the Three Disjoint Path
Problem on Honeycomb Tori . . . . . . . 411
Anonymous Author Index Volume 14 (2004) . . . . . 423
Anonymous Preface . . . . . . . . . . . . . . . . 1--2
Cédric Bastoul and
Paul Feautrier Adjusting a Program Transformation for
Legality . . . . . . . . . . . . . . . . 3--17
Allen D. Malony and
Sameer S. Shende Overhead Compensation in Performance
Profiling . . . . . . . . . . . . . . . 19--35
Jarmo Rantakokko A Dynamic MPI--OpenMP Model for
Structured Adaptive Mesh Refinement . . 37--47
Leon Arber and
Scott Pakin The Impact of Message-Buffer Alignment
on Communication Performance . . . . . . 49--65
Domenico Talia and
Paolo Trunfio Adapting a Pure Decentralized
Peer-To-Peer Protocol for Grid Services
Invocation . . . . . . . . . . . . . . . 67--84
Evangelos Floros and
Yiannis Cotronis Towards a Grid Services Based Framework
for the Virtualization, Execution and
Composition of MPI Applications . . . . 85--98
Yasemin Yalçinkaya and
Trond Steihaug Aggregating Variables for Asynchronous
Iterations . . . . . . . . . . . . . . . 99--114
Yasemin Yalçinkaya and
Trond Steihaug Editorial Note . . . . . . . . . . . . . 115--115
Clemente Galdi and
Christos Kaklamanis and
Manuela Montangero and
Giuseppe Persiano Station Placement in Networks . . . . . 117--129
Jose Aguilar and
Ernst Leiss Parallel Loop Scheduling Approaches for
Distributed and Shared Memory Systems 131--152
A. Khonsari and
H. Sarbazi-Azad and
M. Ould-Khaoua A Performance Model of Software-Based
Deadlock Recovery Routing Algorithm in
Hypercubes . . . . . . . . . . . . . . . 153--168
Roy Friedman and
Achour Mostefaoui and
Michel Raynal $\diamondsuit {\cal P}_{{\rm
mute}}$-based consensus for asynchronous
Byzantine systems . . . . . . . . . . . 169--182
Stéphane Devismes A Silent Self-Stabilizing Algorithm for
Finding Cut-Nodes and Bridges . . . . . 183--198
Éder Gusatto and
José C. M. Mombach and
Fernando P. Cercato and
Gerson H. Cavalheiro An Efficient Parallel Algorithm to
Evolve Simulations of the Cellular Potts
Model . . . . . . . . . . . . . . . . . 199--208
Dominique Barth and
Pascal Berthome and
Paraskevi Fragopoulou The Complexity of the Maximal Requests
Satisfaction Problem in Multipoint
Communication . . . . . . . . . . . . . 209--222
Massimo Bernaschi and
Giulio Iannello and
Saverio Crea Experimental Results About MPI
Collective Communication Operations . . 223--236
Anonymous Editorial Note . . . . . . . . . . . . . 237--237
Paul H. J. Kelly and
Olav Beckmann Generative and Adaptive Methods in
Performance Programming . . . . . . . . 239--255
Holger Bischof and
Sergei Gorlatch and
Roman Leshchinskiy and
Jens Müller Data Parallelism in C++ Template
Programs: a Barnes--Hut Case Study . . . 257--272
André Rauber Du Bois and
Phil Trinder and
Hans-Wolfgang Loidl Towards Mobility Skeletons . . . . . . . 273--288
Frédéric Gava and
Frédéric Loulergue A Functional Language for Departmental
Metacomputing . . . . . . . . . . . . . 289--304
Christoph A. Herrmann Generating Message-Passing Programs from
Abstract Specifications by Partial
Evaluation . . . . . . . . . . . . . . . 305--320
Kiminori Matsuzaki and
Zhenjiang Hu and
Kazuhiko Kakehi and
Masato Takeichi Systematic Derivation of Tree
Contraction Algorithms . . . . . . . . . 321--336
Thomas Nitsche Deriving and Scheduling Communication
Operations for Generic Skeleton
Implementations . . . . . . . . . . . . 337--352
Anonymous Editorial Note . . . . . . . . . . . . . 353--356
Surendra Byna and
Kirk W. Cameron and
Xian-He Sun Isolating Costs in Shared Memory
Communication Buffering . . . . . . . . 357--365
Raimi Rufai and
Muslim Bozyigit and
Jaralla Alghamdi and
Moataz Ahmed Multithreaded Parallelism with OpenMP 367--378
Erich Schikuta Towards an XML Based Datagrid
Description Language . . . . . . . . . . 379--386
Darren J. Kerbyson and
Adolfy Hoisie and
Harvey J. Wasserman Use of Predictive Performance Modeling
During Large-Scale System Installation 387--395
Murali K. Nethi and
James H. Aylor Advances in Modelling and Simulation of
Large Parallel/Distributed Systems . . . 397--405
Mostafa I. Soliman and
Stanislav G. Sedukhin Performance Evaluation of BLAS on the
Trident Processor . . . . . . . . . . . 407--414
Ricolindo L. Cariño and
Ioana Banicescu and
Ravi K. Vadapalli and
Charles A. Weatherford and
Jianping Zhu Parallel Adaptive Quantum Trajectory
Method for Wavepacket Simulations . . . 415--422
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 Improving Scheduling of Communication
Intensive Parallel Applications on
Heterogeneous Computing Environments . . 423--438
Man Lin and
Sai Man Ng A Genetic Algorithm for Energy Aware
Task Scheduling in Heterogeneous Systems 439--449
Kil Hong Joo and
Won Suk Lee Adaptive Selection of Materialized
Queries in a Mediator . . . . . . . . . 451--458
Laurence Tianruo Yang The Improved Parallel ICGS Method for
Large and Sparse Unsymmetric Linear
Systems . . . . . . . . . . . . . . . . 459--467
Weng-Long Chang and
Minyi Guo and
Jesse Wu Solving the Independent-set Problem in a
DNA-Based Supercomputer Model . . . . . 469--479
Ryoko Hayashi and
Kenji Tanaka and
Susumu Horiguchi and
Yasuaki Hiwatari A Parallelization Case-Study of MD
Simulation of a Low Density Physical
System . . . . . . . . . . . . . . . . . 481--489
Tatiana Tabirca and
Len Freeman and
Sabin Tabirca and
Laurence Tianruo Yang Applying the Feedback Guided Dynamic
Loop Scheduling Method for the Shortest
Path Problem . . . . . . . . . . . . . . 491--497
Anonymous Author Index Volume 15 (2005) . . . . . 499--502
Anonymous Editorial Note . . . . . . . . . . . . . 1--2
Daniel Grosu and
Anthony T. Chronopoulos A Truthful Load Balancing Mechanism with
Verification . . . . . . . . . . . . . . 3--17
Selim G. Akl Inherently Parallel Geometric
Computations . . . . . . . . . . . . . . 19--37
Takaaki Nakashima and
Akihiro Fujiwara A Cost Optimal Parallel Algorithm for
Patience Sorting . . . . . . . . . . . . 39--51
Jun Kiniwa and
Masafumi Yamashita A Randomized 1-Latent, Time-Adaptive and
Safe Self-Stabilizing Mutual Exclusion
Protocol . . . . . . . . . . . . . . . . 53--61
Mourad Elhadef and
Kaouther Abrougui and
Shantanu Das and
Amiya Nayak A Parallel Probabilistic System-Level
Fault Diagnosis Approach for Large
Multiprocessor Systems . . . . . . . . . 63--79
Marek Karpinski and
Yakov Nekrich Algorithms for Construction of Optimal
and Almost-Optimal Length-Restricted
Codes . . . . . . . . . . . . . . . . . 81--92
Andrzej Pelc Voting Mechanisms in Asynchronous
Byzantine Environments . . . . . . . . . 93--99
Serge Haddad and
Jean-François Pradat-Peyre New Efficient Petri Nets Reductions for
Parallel Programs Verification . . . . . 101--116
Martin Gairing and
Thomas Lücking and
Marios Mavronicolas and
Burkhard Monien The Price of Anarchy for Restricted
Parallel Links . . . . . . . . . . . . . 117--131
A. Mendiburu and
J. Miguel-Alonso and
J. A. Lozano Implementation and Performance
Evaluation of a Parallelization of
Estimation of Bayesian Network
Algorithms . . . . . . . . . . . . . . . 133--148
Anonymous Editorial Note . . . . . . . . . . . . . 149--149
Anonymous Guest Editor's Note . . . . . . . . . . 151--151
Rami Al Na'Mneh and
W. David Pan and
Seong-Moo Yoo Two Parallel $1$-D FFT Algorithms
Without All-To-All Communication . . . . 153--164
Jean-Claude Bermond and
Jerome Galtier and
Ralf Klasing and
Nelson Morales and
Stephane Perennes Hardness and Approximation of Gathering
in Static Radio Networks . . . . . . . . 165--183
Selim G. Akl Errata: \em Inherently Parallel
Geometric Computations . . . . . . . . . 185--188
Achour Mostefaoui and
Eric Mourgaya and
Michel Raynal and
Corentin Travers A Time-Free Assumption to Implement
Eventual Leadership . . . . . . . . . . 189--207
Chris Jesshope Microthreading a Model for Distributed
Instruction-Level Concurrency . . . . . 209--228
Costas Kyriacou and
Paraskevas Evripidou and
Pedro Trancoso CacheFlow: Cache Optimizations for Data
Driven Multithreading . . . . . . . . . 229--244
Christophe Cérin and
Jean-Luc Gaudiot and
Michel Koskas A Multithreaded SQL Service . . . . . . 245--259
Nathan Thomas and
Steven Saunders and
Tim Smith and
Gabriel Tanase and
Lawrence Rauchwerger ARMI: A High Level Communication Library
for STAPL . . . . . . . . . . . . . . . 261--280
Anonymous Editorial Note: September Special Issue
2006 . . . . . . . . . . . . . . . . . . 281--282
Anonymous Guest Editorial Note . . . . . . . . . . 283--284
Heinz Hofbauer and
Andreas Uhl and
Peter Zinterhof Quasi Monte Carlo Integration in Grid
Environments: Further Leaping Effects 285--311
Pavol Purcz Communication Complexity and Speed-Up in
the Explicit Difference Method . . . . . 313--321
Igor Rozman and
Marjan \vsterk and
Roman Trobec Communication Performance of LAM/MPI and
MPICH on a Linux Cluster . . . . . . . . 323--334
Rade Kutil and
Peter Eder Parallelization of Wavelet Filters Using
SIMD Extensions . . . . . . . . . . . . 335--349
Karl F. Doerner and
Richard F. Hartl and
Siegfried Benkner and
Maria Lucka Parallel Cooperative Savings Based Ant
Colony Optimization --- Multiple Search
And Decomposition Approaches . . . . . . 351--369
Gabriel Ok\vsa and
Marián Vajter\vsic Preconditioned Parallel Block-Jacobi SVD
Algorithm . . . . . . . . . . . . . . . 371--379
Selim G. Akl Three Counterexamples to Dispel the Myth
of the Universal Computer . . . . . . . 381--403
Anonymous Editorial Note . . . . . . . . . . . . . 405--406
Andreas Klimke and
Barbara Wohlmuth Constructing Dimension-Adaptive Sparse
Grid Interpolants Using Parallel
Function Evaluations . . . . . . . . . . 407--418
Hagit Attiya and
Amir Bar-Or Sharing Memory with Semi-Byzantine
Clients and Faulty Storage Servers . . . 419--428
Prasanta K. Jana and
Bhabani P. Sinha An Improved Parallel Prefix Algorithm on
OTIS-Mesh . . . . . . . . . . . . . . . 429--440
Kuo-Chan Huang Minimizing Waiting Ratio for Dynamic
Workload on Parallel Computers . . . . . 441--453
Kuo-Chan Huang and
Feng-Jian Wang Parallelizing an Application with
Time-Increasing Workload Using Adaptive
Processor Allocation . . . . . . . . . . 455--466
K. Vidyasankar A Highly Concurrent Group Mutual
${L}$-Exclusion Algorithm . . . . . . . 467--483
Catherine L. Ruby and
Mark L. Green and
Russ Miller The Operations Dashboard: a
Collaborative Environment for Monitoring
Virtual Organization-Specific Compute
Element Operational Status . . . . . . . 485--500
Yuhui Deng and
Frank Wang and
Na Helian and
Dan Feng and
Ke Zhou Optimal Clustering Size of Small File
Access in Network Attached Storage
Device . . . . . . . . . . . . . . . . . 501--512
Anonymous Author Index Volume 16 . . . . . . . . . 513--515
Anonymous Editorial Note . . . . . . . . . . . . . 1--1
Anonymous Guest Editorial Note . . . . . . . . . . 3--3
Andrew Lumsdaine and
Douglas Gregor and
Bruce Hendrickson and
Jonathan Berry Challenges in Parallel Graph Processing 5--20
John Brevik and
Daniel Nurmi and
Rich Wolski Using Model-based Clustering to Improve
Predictions for Queueing Delay on
Parallel Machines . . . . . . . . . . . 21--46
Emmanuel Jeannot and
Keith Seymour and
Asym Yarkhan and
Jack J. Dongarra Improved Runtime and Transfer Time
Prediction Mechanisms in a Network
Enabled Servers Middleware . . . . . . . 47--59
Loris Marchal and
Veronika Rehn and
Yves Robert and
Frédéric Vivien Scheduling Algorithms for Data
Redistribution and Load-Balancing on
Master-Slave Platforms . . . . . . . . . 61--77
Richard L. Graham and
Brian W. Barrett and
Galen M. Shipman and
Timothy S. Woodall and
George Bosilca Open MPI: A High Performance, Flexible
Implementation of MPI Point-to-Point
Communications . . . . . . . . . . . . . 79--88
Ewing Lusk and
Katherine Yelick Languages for High-Productivity
Computing: the DARPA HPCS Language
Project . . . . . . . . . . . . . . . . 89--102
James S. Plank and
Michael G. Thomason An Exploration of Non-Asymptotic
Low-Density, Parity Check Erasure Codes
for Wide-Area Storage Applications . . . 103--123
Anonymous Editorial Note . . . . . . . . . . . . . 125--125
A. Márquez and
C. Gil and
R. Baños and
J. Gómez Improving the Performance of
Multi-Objective Evolutionary Algorithms
Using the Island Parallel Model . . . . 127--139
Leonid Khachiyan and
Endre Boros and
Vladimir Gurvich and
Khaled Elbassioni Computing Many Maximal Independent Sets
for Hypergraphs in Parallel . . . . . . 141--152
Chryssis Georgiou and
Alexander Russell and
Alexander A. Shvartsman Failure-Sensitive Analysis of Parallel
Algorithms with Controlled Memory Access
Concurrency . . . . . . . . . . . . . . 153--168
D. Coudert and
P. Datta and
S. Perennes and
H. Rivano and
M.-E. Voge Shared Risk Resource Group Complexity
and Approximability Issues . . . . . . . 169--184
Naya Nagy and
Selim G. Akl Aspects of Biomolecular Computing . . . 185--211
A. Khonsari and
A. Shahrabi and
M. Ould-Khaoua A Performance Model of Disha Routing in
$k$-Ary $n$-Cube Networks . . . . . . . 213--228
Anonymous Editorial Note . . . . . . . . . . . . . 229--229
Anonymous Guest Editorial Note . . . . . . . . . . 231--232
Marius Nagy and
Selim G. Akl Parallelism in Quantum Information
Processing Defeats the Universal
Computer . . . . . . . . . . . . . . . . 233--262
Shafagh Jafer and
Gabriel A. Wainer Parallel Algorithms for Cellular Models
Simulation . . . . . . . . . . . . . . . 263--285
Heiko Hamann and
Heinz Wörn Embodied Computation . . . . . . . . . . 287--298
Grzegorz Drzadzewski and
Mark Wineberg Comparing Minimum Neighborhood
Evaluation Schemes for Finding Spatially
Robust Solutions . . . . . . . . . . . . 299--309
Grzegorz Drzadzewski and
Mark Wineberg How Solution Density Affects the Finding
of Spatially Robust Solutions . . . . . 311--321
Naya Nagy and
Selim G. Akl Authenticated Quantum Key Distribution
Without Classical Communication . . . . 323--335
Anonymous Editorial Note . . . . . . . . . . . . . 337--338
Tom Head Photocomputing: Explorations with
Transparency and Opacity . . . . . . . . 339--347
Santiago Garcia Carbajal Parallelizing Three Dimensional Cellular
Automata with OpenMP . . . . . . . . . . 349--361
Eric Gamess An Architectural Approach to Building
Grids Using Legacy Code . . . . . . . . 363--378
Sandeep S. Kulkarni Terminating Alternator . . . . . . . . . 379--390
Kyriakos Neocleous and
Marios D. Dikaiakos and
Paraskevi Fragopoulou and
Evangelos P. Markatos Failure Management in Grids: the Case of
the EGEE Infrastructure . . . . . . . . 391--410
Steve Heller and
Maurice Herlihy and
Victor Luchangco and
Mark Moir and
William N. Scherer III and
Nir Shavit A Lazy Concurrent List-Based Set
Algorithm . . . . . . . . . . . . . . . 411--424
Ke Qiu On a Unified Neighbourhood Broadcasting
Scheme for Interconnection Networks . . 425--437
Fangpeng Dong A Taxonomy of Task Scheduling Algorithms
in the Grid . . . . . . . . . . . . . . 439--454
Andrew Adamatzky Physarum Machine: Implementation of a
Kolmogorov--Uspensky Machine on a
Biological Substrate . . . . . . . . . . 455--467
Anonymous Author Index Volume 17 . . . . . . . . . 469--471
Anonymous Editorial Note . . . . . . . . . . . . . 1--1
Anonymous Guest Editorial Note . . . . . . . . . . 3--5
Peter Krusche Experimental Evaluation of BSP
Programming Libraries . . . . . . . . . 7--21
Clemens Grelck and
Steffen Kuthe and
Sven-Bodo Scholz A Hybrid Shared Memory Execution Model
for a Data Parallel Language with I/O 23--37
Frédéric Gava A Modular Implementation of Data
Structures in Bulk-Synchronous Parallel
ML . . . . . . . . . . . . . . . . . . . 39--53
Emmanuel Chailloux and
Vivien Ravet and
Julien Verlaguet HirondML: Fair Threads Migrations for
Objective Caml . . . . . . . . . . . . . 55--69
Noemi Rodriguez and
Silvana Rossetto Integrating Remote Invocations with
Asynchronism and Cooperative
Multitasking . . . . . . . . . . . . . . 71--85
Gagarine Yaikhom Message Passing Without Memory Copy . . 87--100
Jost Berthold and
Rita Loogen The Impact of Dynamic Channels on
Functional Topology Skeletons . . . . . 101--115
Michael Poldner and
Herbert Kuchen On Implementing the Farm Skeleton . . . 117--131
Ignacio Peláez and
Francisco Almeida and
Daniel González High Level Parallel Skeletons for
Dynamic Programming . . . . . . . . . . 133--147
Roberto Di Cosmo and
Zheng Li and
Susanna Pelagatti and
Pierre Weis Skeletal Parallel Programming with
OcamlP3L 2.0 . . . . . . . . . . . . . . 149--164
Sonia Campa Evaluating Computational Costs While
Handling Data and Control Parallelism 165--174
Marco Aldinucci and
Anne Benoit Automatic Mapping of Assist Applications
Using Process Algebra . . . . . . . . . 175--188
Wayne Goddard and
Stephen T. Hedetniemi and
David P. Jacobs and
Pradip K. Srimani and
Zhenyu Xu Self-Stabilizing Graph Protocols . . . . 189--199
Anonymous Editorial Note . . . . . . . . . . . . . 201--201
Anonymous Guest Editor's Introduction . . . . . . 203--204
Jan Lemeire and
Erik Dirkx and
Walter Colitti Modeling the Performance of
Communication Schemes on Network
Topologies . . . . . . . . . . . . . . . 205--220
Clemens Grelck and
Sven-Bodo Scholz and
Alex Shafarenko A Gentle Introduction to S-Net: Typed
Stream Processing and Declarative
Coordination of Asynchronous Components 221--237
Jun Ho Bahn and
Seung Eun Lee and
Yoon Seok Yang and
Jungsook Yang and
Nader Bagherzadeh On Design and Application Mapping of a
Network-On-Chip (NOC) Architecture . . . 239--255
Chris Jesshope Operating Systems in Silicon and the
Dynamic Management of Resources in
Many-Core Chips . . . . . . . . . . . . 257--274
Thilo Pionteck and
Carsten Albrecht and
Roman Koch and
Erik Maehle Adaptive Communication Architectures for
Runtime Reconfigurable System-On-Chips 275--289
Konstantinos Tatas and
Costas Kyriacou and
Paraskevas Evripidou and
Pedro Trancoso and
Stephan Wong Rapid Prototyping of the Data-Driven
Chip-Multiprocessor (D$^2$-CMP) using
FPGAs . . . . . . . . . . . . . . . . . 291--306
F. Furman Haddix An Order Degree Alternator for Arbitrary
Topologies . . . . . . . . . . . . . . . 307--322
Anonymous Editorial Note . . . . . . . . . . . . . 323--323
Anonymous Guest Editorial Note . . . . . . . . . . 325--327
Eugenio Zimeo and
Alberto Troisi and
Harris Papadakis and
Paraskevi Fragopoulou and
Agostino Forestiero and
Carlo Mastroianni Cooperative Self-Composition and
Discovery of Grid Services in P2P
Networks . . . . . . . . . . . . . . . . 329--346
Serafeim Zanikolas and
Rizos Sakellariou An Importance-Aware Architecture for
Large-Scale Grid Information Services 347--370
Demetrios Zeinalipour-Yazti and
Harris Papadakis and
Chryssis Georgiou and
Marios D. Dikaiakos Metadata Ranking and Pruning for Failure
Detection in Grids . . . . . . . . . . . 371--390
Fernando Costa and
Luis Silva and
Gilles Fedak and
Ian Kelley Optimizing Data Distribution in Desktop
Grid Platforms . . . . . . . . . . . . . 391--410
Boris Mejías and
Peter Van Roy The Relaxed-Ring: a Fault-Tolerant
Topology for Structured Overlay Networks 411--432
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 EDGeS: The Common Boundary Between
Service and Desktop Grids . . . . . . . 433--445
Anonymous Editorial Note . . . . . . . . . . . . . 447--447
Alex K. Jones and
Darren J. Kerbyson and
Ram Rajamony and
Charles Weems Guest Editor's Note: Large-Scale
Parallel Processing . . . . . . . . . . 449--451
Kevin J. Barker and
Kei Davis and
Adolfy Hoisie and
Darren J. Kerbyson and
Mike Lang and
Scott Pakin and
Jose Carlos Sancho A Performance Evaluation of the Nehalem
Quad-Core Processor for Scientific
Computing . . . . . . . . . . . . . . . 453--469
Georg Hager and
Thomas Zeiser and
Gerhard Wellein Data Access Characteristics and
Optimizations for Sun UltraSPARC T2 and
T2+ Systems . . . . . . . . . . . . . . 471--490
Kevin Schaffer and
Robert A. Walker Using Hardware Multithreading to
Overcome Broadcast/Reduction Latency in
an Associative SIMD Processor . . . . . 491--509
Noriyuki Fujimoto Dense Matrix-Vector Multiplication on
the CUDA Architecture . . . . . . . . . 511--530
John Michalakes and
Manish Vachharajani GPU Acceleration of Numerical Weather
Prediction . . . . . . . . . . . . . . . 531--548
Abhinav Bhatelé and
Laxmikant V. Kalé Benefits of Topology Aware Mapping for
Mesh Interconnects . . . . . . . . . . . 549--566
Alex K. Jones and
Shuyi Shao and
Yu Zhang and
Rami Melhem Symbolic Expression Analysis for
Compiled Communication . . . . . . . . . 567--587
Darren J. Kerbyson and
Mike Lang and
Gregory Johnson InfiniBand Routing Table Optimizations
for Scientific Applications . . . . . . 589--608
Anonymous Author Index -- Volume 18 . . . . . . . 609--612
Anonymous Editorial Note . . . . . . . . . . . . . 1--2
Rodrigo N. Calheiros and
Tiago Ferreto and
César A. F. De Rose Scheduling and Management of Virtual
Resources in Grid Sites: the Site
Resource Scheduler . . . . . . . . . . . 3--18
Eddie Cheng and
Ke Qiu and
Zhizhang Shen A short note on the surface area of star
graphs . . . . . . . . . . . . . . . . . 19--22
Ehab Y. Abdel Maksoud Efficient Combined Scheduling of Hard
and Soft Real-Time Tasks in
Multiprocessor Systems Under a
Processing Power-Share Strategy . . . . 23--38
Marius Nagy Locating the Median of a Tree in Real
Time . . . . . . . . . . . . . . . . . . 39--55
Harris Papadakis and
Paraskevi Fragopoulou and
Evangelos P. Markatos and
Marios D. Dikaiakos and
Alexandros Labrinidis Hash-Based Overlay Partitioning in
Unstructured Peer-To-Peer Systems . . . 57--71
Sami Torbey Towards a Framework for Intuitive
Programming of Cellular Automata . . . . 73--83
Jesper Larsson Träff Relationships Between Regular and
Irregular Collective Communication
Operations on Clustered Multiprocessors 85--96
Sherenaz W. Al-Haj Baddar and
Kenneth E. Batcher An 11-Step Sorting Network for 18
Elements . . . . . . . . . . . . . . . . 97--103
Andrew Adamatzky Developing Proximity Graphs by \em
Physarum Polycephalum: Does the
Plasmodium Follow the Toussaint
Hierarchy? . . . . . . . . . . . . . . . 105--127
Teofilo F. Gonzalez Improved Communication Schedules with
Buffers . . . . . . . . . . . . . . . . 129--139
Chryssis Georgiou and
Theophanis Pavlides and
Anna Philippou Selfish Routing in the Presence of
Network Uncertainty . . . . . . . . . . 141--157
Mostafa I. Soliman Performance Evaluation of Multi-Core
Intel Xeon Processors on Basic Linear
Algebra Subprograms . . . . . . . . . . 159--174
Yoann Dieudonné and
Franck Petit Scatter of Robots . . . . . . . . . . . 175--184
Anonymous Editorial Note . . . . . . . . . . . . . 185--185
Dominique Barth and
Johanne Cohen and
Olivier Bournez and
Octave Boussaton Distributed Learning of Equilibria in a
Routing Game . . . . . . . . . . . . . . 189--204
Michael Kirkedal Thomsen and
Holger Bock Axelsen Parallelization of Reversible
Ripple-Carry Adders . . . . . . . . . . 205--222
Michael Kirkedal Thomsen and
Holger Bock Axelsen Guest Editor's Note . . . . . . . . . . 225--225
Maurice Margenstern and
Yu Song A New Universal Cellular Automaton on
the Pentagrid . . . . . . . . . . . . . 227--246
Martin Kutrib and
Andreas Malcher Computations and Decidability of
Iterative Arrays with Restricted
Communication . . . . . . . . . . . . . 247--264
Matthias Schulz How Far Is It to the Next Recurrent
Configuration? An NP-Complete Problem in
the Sandpile Model . . . . . . . . . . . 265--281
Andrew Wuensche Cellular Automata Encryption: the
reverse algorithm, Z-parameter and
chain-rules . . . . . . . . . . . . . . 283--297
Hiroshi Umeo and
Naoki Kamikawa and
Jean-Baptiste Yun\`es A Family of Smallest Symmetrical
Four-State Firing Squad Synchronization
Protocols for Ring Arrays . . . . . . . 299--313
Luidnel Maignan and
Frédéric Gruau A $1$D Cellular Automaton That Moves
Particles Until Regular Spatial
Placement . . . . . . . . . . . . . . . 315--331
Brian Q. Rieksts and
Jose A. Ventura Time-Relaxed 1-Fault Tolerant Broadcast
Networks . . . . . . . . . . . . . . . . 335--353
Mostafa I. Soliman Exploiting ILP, TLP, and DLP to Improve
Multi-Core Performance of One-Sided
Jacobi SVD . . . . . . . . . . . . . . . 355--375
Anonymous Editorial Note . . . . . . . . . . . . . 377--377
Anonymous Guest Editor's Note . . . . . . . . . . 379--379
Anne Benoit and
Yves Robert and
Eric Thierry On the Complexity of Mapping Linear
Chain Applications Onto Heterogeneous
Platforms . . . . . . . . . . . . . . . 383--397
Jens Gustedt and
Emmanuel Jeannot and
Martin Quinson Experimental Methodologies for
Large-Scale Systems: a Survey . . . . . 399--418
Laurent Lef\`evre and
Anne-Cecile Orgerie Towards Energy Aware Reservation
Infrastructure for Large-Scale
Experimental Distributed Systems . . . . 419--433
Christine Morin and
Yvon Jégou and
Jérôme Gallard and
Pierre Riteau Clouds: a New Playground for the
XtreemOS Grid Operating System . . . . . 435--449
Kamer Kaya and
Bora Uçar Exact Algorithms for a Task Assignment
Problem . . . . . . . . . . . . . . . . 451--465
Joseph Tang A Simple Parallel Adaptive Mesh CFD
Method Suitable for Small Engineering
Workstations . . . . . . . . . . . . . . 469--476
Laurence Boxer Efficient Coarse Grained Permutation
Exchanges and Matrix Multiplication . . 477--484
Anonymous Editorial Note . . . . . . . . . . . . . 485--485
Alex K. Jones and
Darren J. Kerbyson and
Ram Rajamony and
Charles Weems Guest Editor's Note: Large Scale
Parallel Processing . . . . . . . . . . 487--490
Thomas Zeiser and
Georg Hager and
Gerhard Wellein Benchmark Analysis and Application
Results for Lattice Boltzmann
Simulations on NEC SX Vector and Intel
Nehalem Systems . . . . . . . . . . . . 491--511
Fumihiko Ino and
Yuki Kotani and
Yuma Munekawa and
Kenichi Hagihara Harnessing the Power of Idle GPUs for
Acceleration of Biological Sequence
Alignment . . . . . . . . . . . . . . . 513--533
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 An MPI Performance Monitoring Interface
for Cell Based Compute Nodes . . . . . . 535--552
Abhinav Bhatelé and
Laxmikant V. Kalé Quantifying Network Contention on Large
Parallel Machines . . . . . . . . . . . 553--572
Torsten Hoefler and
Timo Schneider and
Andrew Lumsdaine The Effect of Network Noise on
Large-Scale Collective Communications 573--593
Yu Zhang and
Alex K. Jones Non-uniform `Fat-Meshes' for Chip
Multiprocessors . . . . . . . . . . . . 595--617
Kei Davis and
Kevin J. Barker and
Darren J. Kerbyson Performance Prediction Via Modeling: a
Case Study of the ORNL Cray XT4 Upgrade 619--639
Anonymous Author Index Volume 19 . . . . . . . . . 641--644
Anonymous Editorial Note . . . . . . . . . . . . . 1--1
Andreas Klappenecker and
Hyunyoung Lee and
Jennifer L. Welch Scheduling Sensors by Tiling Lattices 3--13
Eddy Caron and
Frédéric Desprez and
Franck Petit and
Cédric Tedeschi Snap-Stabilizing Prefix Tree for
Peer-To-Peer Systems . . . . . . . . . . 15--30
Vincent Gramoli and
Derin Harmanci and
Pascal Felber On the Input Acceptance of Transactional
Memory . . . . . . . . . . . . . . . . . 31--50
Thomas A. M. Bernard and
Clemens Grelck and
Chris R. Jesshope On the Compilation of a Language for
General Concurrent Target Architectures 51--69
César L. B. Silveira and
Gerson Geraldo H. Cavalheiro and
Cláudio R. Jung and
Julio C. S. Jacques, Jr. and
Soraia R. Musse An Improved Background Subtraction
Algorithm and Concurrent Implementations 71--89
Shameema Yasim and
Shahram Latifi Optimal Subcube Embeddability in
Hypercubes with Additional Dimensions 91--99
Anonymous Editorial Note . . . . . . . . . . . . . 101--101
Mostafa I. Soliman and
Abdulmajid F. Al-Junaid SystemC Implementation and Performance
Evaluation of a Decoupled
General-Purpose Matrix Processor . . . . 103--121
Rodrigo Da Rosa Righi and
Laércio Lima Pilla and
Nicolas Maillard and
Alexandre Carissimi and
Philippe Olivier Alexandre Navaux Observing the Impact of Multiple Metrics
and Runtime Adaptations on BSP Process
Rescheduling . . . . . . . . . . . . . . 123--144
Keny T. Lucas and
Prasanta K. Jana Sorting and Routing on OTIS-Mesh of
Trees . . . . . . . . . . . . . . . . . 145--154
Dinesh Dash and
Arobinda Gupta and
Arijit Bishnu Dynamic Maintenance of Support Coverage
in Sensor Networks . . . . . . . . . . . 155--172
Volker Turau Self-Stabilizing Vertex Cover in
Anonymous Networks with Optimal
Approximation Ratio . . . . . . . . . . 173--186
Panagiotis E. Hadjidoukas and
Laurent Amsaleg Nested OpenMP Parallelization of a
Hierarchical Data Clustering Algorithm 187--208
Anonymous Editorial Note . . . . . . . . . . . . . 209--209
Ke Qiu Guest Editor's Note: Advances in Quantum
Computation . . . . . . . . . . . . . . 211--212
Marius Nagy and
Selim G. Akl Coping with Decoherence: Parallelizing
the Quantum Fourier Transform . . . . . 213--226
Marius Nagy and
Selim G. Akl Entanglement Verification with an
Application to Quantum Key Distribution
Protocols . . . . . . . . . . . . . . . 227--237
Naya Nagy and
Marius Nagy and
Selim G. Akl Key Distribution Versus Key Enhancement
in Quantum Cryptography . . . . . . . . 239--250
Naya Nagy and
Selim G. Akl A Quantum Cryptographic Solution to the
Problem of Access Control in a Hierarchy 251--261
Naya Nagy and
Selim G. Akl One-Time Pads Without Prior Encounter 263--273
Selim G. Akl On the Importance of Being Quantum . . . 275--286
Anonymous Editorial Note . . . . . . . . . . . . . 287--287
Charles C. Weems and
Darren J. Kerbyson and
Ram Rajamony and
Alex K. Jones Guest Editor's Note: Large-Scale
Parallel Processing . . . . . . . . . . 289--291
Niall Emmart and
Charles Weems High Precision Integer Addition,
Subtraction and Multiplication with a
Graphics Processing Unit . . . . . . . . 293--306
Thé Van Luong and
Nouredine Melab and
El-Ghazali Talbi Neighborhood Structures for GPU-Based
Local Search Algorithms . . . . . . . . 307--324
Jyothish Soman and
Kishore Kothapalli and
P. J. Narayanan Some GPU Algorithms for Graph Connected
Components and Spanning Tree . . . . . . 325--339
Jose Carlos Sancho and
Darren J. Kerbyson and
Michael Lang On the Performance and Technological
Impact of Adding Memory Controllers in
Multi-Core Processors . . . . . . . . . 341--357
Markus Wittmann and
Georg Hager and
Jan Treibig and
Gerhard Wellein Leveraging Shared Caches for Parallel
Temporal Blocking of Stencil Codes on
Multicore Processors and Clusters . . . 359--376
Ning Liu and
Jing Fu and
Christopher D. Carothers and
Onkar Sahni and
Kenneth E. Jansen and
Mark S. Shephard Massively Parallel I/O for Partitioned
Solver Systems . . . . . . . . . . . . . 377--395
Brian J. N. Wylie and
Markus Geimer and
Bernd Mohr and
David BöHme and
ZoltáN Szebenyi and
Felix Wolf Large-Scale Performance Analysis of
Sweep$3$D with the Scalasca Toolset . . 397--414
Anonymous Author Index Volume 20 . . . . . . . . . 415--417
Anonymous Editorial Note . . . . . . . . . . . . . 1--1
Pietro Ceres and
Raffaele Ceres On the Fault-Tolerance and Size of WDM
Optical Networks . . . . . . . . . . . . 3--12
Thomas G. Robertazzi A Product Form Solution for Tree
Networks with Divisible Loads . . . . . 13--20
Cheng-Chi Lee and
Chun-Ta Li and
Shun-Der Chen Two Attacks on a Two-Factor User
Authentication in Wireless Sensor
Networks . . . . . . . . . . . . . . . . 21--26
Tien-Tai Pan and
Shun-Shii Lin The Transitive Closure and Related
Algorithms of Digraph on the
Reconfigurable Architecture . . . . . . 27--43
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äff MPI on Millions of Cores . . . . . . . . 45--60
Eddie Cheng and
Ke Qiu and
Zhizhang Shen On the Surface Areas and Average
Distances of Meshes and Tori . . . . . . 61--75
Shiang-Feng Tzeng and
Cheng-Chi Lee and
Min-Shiang Hwang A Batch Verification for Multiple Proxy
Signature . . . . . . . . . . . . . . . 77--84
Marco A. Z. Alves and
Henrique C. Freitas and
Philippe O. A. Navaux High Latency and Contention on Shared
L2-Cache for Many-Core Architectures . . 85--106
Anonymous Editorial Note . . . . . . . . . . . . . 107--107
Jack Dongarra and
Bernard Tourancheau Guest Editors' Note . . . . . . . . . . 109--109
Franck Cappello and
Henri Casanova and
Yves Robert Preventive Migration vs. Preventive
Checkpointing for Extreme Scale
Supercomputers . . . . . . . . . . . . . 111--132
Anne-Cecile Orgerie and
Laurent Lefevre Eridis: Energy-Efficient Reservation
Infrastructure for Large-Scale
Distributed Systems . . . . . . . . . . 133--154
Coral Walker and
Dashan Lu and
David W. Walker Automatic Portal Generation Based on
Workflow Description . . . . . . . . . . 155--171
Alejandro Duran and
Eduard Ayguadé and
Rosa M. Badia and
Jesús Labarta and
Luis Martinell and
Xavier Martorell and
Judit Planas OmpSs: a proposal for programming
heterogeneous multi-core architectures 173--193
David Clarke and
Alexey Lastovetsky and
Vladimir Rychkov Dynamic Load Balancing of Parallel
Computational Iterative Routines on
Highly Heterogeneous HPC Platforms . . . 195--217
Ana-Maria Oprescu and
Thilo Kielmann and
Haralambie Leahu Budget Estimation and Control for
Bag-Of-Tasks Scheduling in Clouds . . . 219--243
Duane Merrill and
Andrew Grimshaw High Performance and Scalable Radix
Sorting: a Case Study of Implementing
Dynamic Parallelism for GPU Computing 245--272
Selim G. Akl Twentieth Anniversary Issue: Editorial
Note . . . . . . . . . . . . . . . . . . 273--273
Charles C. Weems and
Darren J. Kerbyson and
Ram Rajamony Guest Editor's Note: Large-Scale
Parallel Processing . . . . . . . . . . 275--277
I-Hsin Chung and
Che-Rung Lee and
Jiazheng Zhou and
Yeh-Ching Chung Hierarchical Mapping for HPC
Applications . . . . . . . . . . . . . . 279--299
Darren J. Kerbyson and
Kevin J. Barker Modeling the Performance of Direct
Numerical Simulation on Parallel Systems 301--318
Yanhua Sun and
Gengbin Zheng and
Pritish Jetley and
Laxmikant V. Kale Parssse: an Adaptive Parallel State
Space Search Engine . . . . . . . . . . 319--338
Gerald Schubert and
Holger Fehske and
Georg Hager and
Gerhard Wellein Hybrid-Parallel Sparse Matrix-Vector
Multiplication with Explicit
Communication Overlap on Current
Multicore-Based Systems . . . . . . . . 339--358
Niall Emmart and
Charles C. Weems High Precision Integer Multiplication
with a GPU Using Strassen's Algorithm
with Multiple FFT Sizes . . . . . . . . 359--375
Selim G. Akl Editorial Note . . . . . . . . . . . . . 377--377
Blesson Varghese and
Gerard Mckee and
Vassil Alexandrov Can Agent Intelligence Be Used to
Achieve Fault Tolerant Parallel
Computing Systems? . . . . . . . . . . . 379--396
Sékou Diakité and
Loris Marchal and
Jean-Marc Nicod and
Laurent Philippe Practical Steady-State Scheduling for
Tree-Shaped Task Graphs . . . . . . . . 397--412
M. Irfan Uddin and
Michiel W. Van Tol and
Chris R. Jesshope High Level Simulation of SVP Many-Core
Systems . . . . . . . . . . . . . . . . 413--438
Carlos Fernando Gamboa and
Thomas Robertazzi Simple Performance Bounds for Multicore
and Parallel Channel Systems . . . . . . 439--460
Nazreen Banu and
Taisuke Izumi and
Koichi Wada Adaptive and Doubly-Expedited One-Step
Consensus in Byzantine Asynchronous
Systems . . . . . . . . . . . . . . . . 461--477
Anonymous Author Index Volume 21 . . . . . . . . . 479--481
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1201001
Paraskevi Fragopoulou and
Artur Andrzejak and
Carlo Mastroianni and
Costas Panagiotakis Guest Editors' Note: Special Issue on
Community Structures in Networks:
Methods and Applications . . . . . . . . 1202001
Peter Pollner and
Gergely Palla and
Tamas Vicsek Parallel Clustering with CFinder . . . . 1240001
Abdelhamid Salah Brahim and
Bénédicte Le Grand and
Matthieu Latapy Diffusion Cascades: Spreading Phenomena
in Blog Network Communities . . . . . . 1240002
Harris Papadakis and
Costas Panagiotakis and
Paraskevi Fragopoulou Locating Communities on Real Dataset
Graphs Using Synthetic Coordinates . . . 1240003
Blaise Ngonmang and
Maurice Tchuente and
Emmanuel Viennet Local Community Identification in Social
Networks . . . . . . . . . . . . . . . . 1240004
Shashi Phoha and
Goutham Mallapragada and
Yicheng Wen and
Doina Bein and
Asok Ray Designing a Fusion-Driven Sensor Network
to Selectively Track Mobile Targets . . 1250001
Antonio Fernández Anta and
Chryssis Georgiou and
Luis López and
Agustín Santos Reliable Internet-Based Master-Worker
Computing in the Presence of Malicious
Workers . . . . . . . . . . . . . . . . 1250002
Iain A. Stewart On the Computational Complexity of
Routing in Faulty $K$-Ary $N$-Cubes and
Hypercubes . . . . . . . . . . . . . . . 1250003
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1201002
Gaétan Hains and
Frédéric Gava and
Kevin Hammond Guest Editors' Note: High-Level
Programming for Heterogeneous and
Hierarchical Parallel Systems . . . . . 1202002
Alexander Collins and
Christian Fensch and
Hugh Leather Auto-Tuning Parallel Skeletons . . . . . 1240005
M. Aldinucci and
M. Danelutto and
P. Kilpatrick and
M. Torquati Targeting Heterogeneous Architectures
Via Macro Data Flow . . . . . . . . . . 1240006
Mathias Bourgoin and
Emmanuel Chailloux and
Jean-Luc Lamotte SPOC: GPGPU Programming Through Stream
Processing with OCaml . . . . . . . . . 1240007
Michael T. Garba and
Horacio González-Vélez Asymptotic Peak Utilisation in
Heterogeneous Parallel CPU/GPU
Pipelines: a Decentralised Queue
Monitoring Strategy . . . . . . . . . . 1240008
Hermes Senger and
Fabrício Alves Barbosa Da Silva Bounds on the Scalability of
Bag-Of-Tasks Applications Running on
Master-Slave Platforms . . . . . . . . . 1250004
Eddie Cheng and
Sachin Padmanabhan Matching Preclusion and Conditional
Matching Preclusion for Crossed Cubes 1250005
Fukuhito Ooshita and
Tomoko Izumi and
Taisuke Izumi The Price of Multi-Organization
Constraint in Unrelated Parallel Machine
Scheduling . . . . . . . . . . . . . . . 1250006
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1201003
Mike Stannett Guest Editor's Note: Special Issue on
Hypercomputation, Physics and
Computation . . . . . . . . . . . . . . 1202003
László E. Szabó Mathematical Facts in a Physicalist
Ontology . . . . . . . . . . . . . . . . 1240009
Hajnal Andréka and
István Németi and
Gergely Székely Closed Timelike Curves in Relativistic
Computation . . . . . . . . . . . . . . 1240010
Hajnal Andréka and
Judit Madarász and
István Németi Decidability, Undecidability, and Gödel's
Incompleteness in Relativity Theories 1240011
Naveen Sundar Govindarajulu and
Selmer Bringsjord The Myth of `the Myth of
Hypercomputation' . . . . . . . . . . . 1240012
Bruce J. Maclennan Embodied Computation: Applying the
Physics of Computation to Artificial
Morphogenesis . . . . . . . . . . . . . 1240013
Pedro Rodríguez and
María Cecilia Rivara and
Isaac D. Scherson Exploiting the Memory Hierarchy of
Multicore Systems for Parallel
Triangulation Refinement . . . . . . . . 1250007
Frank Dehne and
Hamidreza Zaboli Deterministic Sample Sort for GPUs . . . 1250008
H. L. P. Arjuna Madanayake and
R. J. Cintra and
V. S. Dimitrov and
L. T. Bruton Block-Parallel Systolic-Array
Architecture for $2$-D NTT-Based Fragile
Watermark Embedding . . . . . . . . . . 1250009
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1201004
Tobias Grosser and
Armin Groesslinger and
Christian Lengauer Polly --- Performing Polyhedral
Optimizations on a Low-Level
Intermediate Representation . . . . . . 1250010
Fatima K. Abu Salem and
Lama B. Tamim Communication Balancing in the Parallel
Göttfert Algorithm . . . . . . . . . . . 1250011
Zheng Wei and
Joseph Jaja Optimization of Linked List Prefix
Computations on Multithreaded GPUs Using
CUDA . . . . . . . . . . . . . . . . . . 1250012
Wenjun Xiao and
Huomin Liang and
Behrooz Parhami A Class of Data-Center Network Models
Offering Symmetry, Scalability, and
Reliability . . . . . . . . . . . . . . 1250013
Dominic Dumrauf and
Burkhard Monien Computing Nash Equilibria for Two-Player
Restricted Network Congestion Games Is
$\cal PLS$-Complete . . . . . . . . . . 1250014
Pramod Kumar Mishra and
Kamal Sheel Mishra and
Abhishek Mishra and
Anil Kumar Tripathi A Randomized Scheduling Algorithm for
Multiprocessor Environments . . . . . . 1250015
Anonymous Author Index Volume 22 . . . . . . . . . 1299001
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1301001
Sandra M. Hedetniemi and
Stephen T. Hedetniemi and
K. E. Kennedy and
Alice A. Mcrae Self-Stabilizing Algorithms for
Unfriendly Partitions into Two Disjoint
Dominating Sets . . . . . . . . . . . . 1350001
Frank Dehne and
Hamidreza Zaboli Parallel Construction of Data Cubes on
Multi-Core Multi-Disk Platforms . . . . 1350002
Major Singh Goraya and
Lakhwinder Kaur Fault Tolerance Task Execution Through
Cooperative Computing in Grid . . . . . 1350003
Eddie Cheng and
László Lipták Conditional Matching Preclusion for $
(n, k) $-Star Graphs . . . . . . . . . . 1350004
Apostolos Syropoulos Hypercomputation: Fantasy Or Reality? a
Position Paper . . . . . . . . . . . . . 1350005
Sajjid Reza and
Gregory T. Byrd Reducing Migration-Induced Misses in an
Over-Subscribed Multiprocessor System 1350006
Cristian S. Calude and
Elena Calude and
Melissa S. Queen Inductive Complexity of the P Versus NP
Problem . . . . . . . . . . . . . . . . 1350007
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1301002
Jack Dongarra and
Bernard Tourancheau Guest Editors' Note: Special Issue on
Clusters, Clouds, and Data for
Scientific Computing . . . . . . . . . . 1302001
Manu Shantharam and
Youngtae Youn and
Padma Raghavan Speedup-Aware Co-Schedules for Efficient
Workload Management . . . . . . . . . . 1340001
Jaroslaw Slawinski and
Vaidy Sunderam Towards Computing As a Utility Via
Adaptive Middleware: an Experiment in
Cross-Paradigm Execution . . . . . . . . 1340002
Anne Benoit and
Rami Melhem and
Paul Renaud-Goud and
Yves Robert Assessing the Performance of
Energy-Aware Mappings . . . . . . . . . 1340003
Ewa Deelman and
Gideon Juve and
Maciej Malawski and
Jarek Nabrzyski Hosted Science: Managing Computational
Workflows in the Cloud . . . . . . . . . 1340004
Andrew Grimshaw and
Mark Morgan and
Avinash Kalyanaraman GFFS --- the XSEDE Global Federated File
System . . . . . . . . . . . . . . . . . 1340005
Geoffrey Fox Robust Scalable Visualized Clustering in
Vector and Non Vector Semi-Metric Spaces 1340006
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1301003
Di Zhao and
Shenghua Ni Parallel multi-proposal and multi-chain
MCMC for calculating $p$-value of
genome-wide association study . . . . . 1350008
Song-Kong Chong and
Cheng-Chi Lee and
Min-Shiang Hwang An Authentication Scheme for the Global
Mobility Network . . . . . . . . . . . . 1350009
Daniel R. Page Parallel Algorithm for Second-Order
Restricted Weak Integer Composition
Generation for Shared Memory Machines 1350010
Eddie Cheng and
Nart Shawash The $ Q_{n, k, m} $ Graph: a Common
Generalization of Various Popular
Interconnection Networks . . . . . . . . 1350011
Fadi Thabtah and
Suhel Hammoud MR-ARM: a Map-Reduce Association Rule
Mining Framework . . . . . . . . . . . . 1350012
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1301004
Charles C. Weems and
Darren J. Kerbyson and
Ram Rajamony Guest Editors' Note: Large-Scale
Parallel Processing . . . . . . . . . . 1302002
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 A Performance Analysis of Three
Generations of Blue Gene . . . . . . . . 1340007
Laura Carrington and
Michael Laurenzano and
Ananta Tiwari Characterizing Large-Scale HPC
Applications Through Trace Extrapolation 1340008
Niall Emmart and
Charles Weems Search-Based Automatic Code Generation
for Multiprecision Modular
Exponentiation on Multiple Generations
of GPU . . . . . . . . . . . . . . . . . 1340009
R. F. Barrett and
C. T. Vaughan and
S. D. Hammond and
D. Roweth Reducing the Bulk in the Bulk
Synchronous Parallel Model . . . . . . . 1340010
Faisal Shahzad and
Markus Wittmann and
Moritz Kreutzer and
Thomas Zeiser and
Georg Hager and
Gerhard Wellein A Survey of Checkpoint/Restart
Techniques on Distributed Memory Systems 1340011
Anonymous Author Index Volume 23 . . . . . . . . . 1399001
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1401001
Neda Abdelhamid and
Aladdin Ayesh and
Wael Hadi Multi-Label Rules Algorithm Based
Associative Classification . . . . . . . 1450001
Shinji Kawai and
Fukuhito Ooshita and
Hirotsugu Kakugawa and
Toshimitsu Masuzawa Analysis of Distributed Token
Circulation Algorithm with Faulty Random
Number Generator . . . . . . . . . . . . 1450002
Xavier Lapillonne and
Oliver Fuhrer Using Compiler Directives to Port Large
Scientific Applications to GPUs: An
Example from Atmospheric Science . . . . 1450003
Andrew Lucas and
Mark Stalzer and
John Feo Parallel Implementation of Fast
Randomized Algorithms for Low Rank
Matrix Decomposition . . . . . . . . . . 1450004
Christian Siebert and
Jesper Larsson Träff Perfectly Load-Balanced, Stable,
Synchronization-Free Parallel Merge . . 1450005
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1401002
Adrian-Horia Dediu and
Carlos Martín-Vide and
Bianca Truthe Guest Editors' Note --- Special Issue:
First International Conference on the
Theory and Practice of Natural
Computing, TPNC 2012 . . . . . . . . . . 1402001
Max H. Garzon DNA Codeword Design: Theory and
Applications . . . . . . . . . . . . . . 1440001
Tibor Kmet Neural Networks Solving Free and Fixed
Final Time Optimal Control Problems . . 1440002
Ilja Kucevalovs and
Oj\=ars Krasts and
R\=usi\cn\vs Freivalds and
Thomas Zeugmann On the Influence of Technology on
Learning Processes . . . . . . . . . . . 1440003
A. V. Spirov and
E. A. Zagriychuk and
D. M. Holloway Evolutionary Design of Gene Networks:
Forced Evolution by Genomic Parasites 1440004
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1401003
Armin Größlinger and
Harald Köstler Guest Editors' Note: Special Issue On
High-Performance Stencil Computations 1402002
Alexander Grebhahn and
Sebastian Kuckuk and
Christian Schmitt and
Harald Köstler and
Norbert Siegmund and
Sven Apel and
Frank Hannig and
Jürgen Teich Experiments on Optimizing the
Performance of Stencil Codes with SPL
Conqueror . . . . . . . . . . . . . . . 1441001
Tobias Grosser and
Sven Verdoolaege and
Albert Cohen and
P. Sadayappan The Relation Between Diamond Tiling and
Hexagonal Tiling . . . . . . . . . . . . 1441002
Marcel Köster and
Roland Leißa and
Sebastian Hack and
Richard Membarth and
Philipp Slusallek Code Refinement of Stencil Codes . . . . 1441003
Stefan Kronawitter and
Holger Stengel and
Georg Hager and
Christian Lengauer Domain-Specific Optimization of Two
Jacobi Smoother Kernels and Their
Evaluation in the ECM Performance Model 1441004
Michel Steuwer and
Michael Haidl and
Stefan Breuer and
Sergei Gorlatch High-Level Programming of Stencil
Computations on Multi-GPU Systems Using
the SkelCL Library . . . . . . . . . . . 1441005
Tobias Weinzierl and
Michael Bader and
Kristof Unterweger and
Roland Wittmann Block Fusion on Dynamically Adaptive
Spacetree Grids for Shallow Water Waves 1441006
Selim G. Akl December Issue 2014 Editorial Note . . . 1401004
Charles C. Weems and
Darren J. Kerbyson and
Ram Rajamony Guest Editors' Note: Special Issue on
Large-Scale Parallel Processing . . . . 1402003
Bo Li and
Hung-Ching Chang and
Shuaiwen Song and
Chun-Yi Su and
Timmy Meyer and
John Mooring and
Kirk Cameron Extending PowerPack for Profiling and
Analysis of High-Performance
Accelerator-Based Systems . . . . . . . 1442001
John D. Leidel and
Yong Chen HMC-SIM: A Simulation Framework for
Hybrid Memory Cube Devices . . . . . . . 1442002
Roberto Gioiosa and
Gokcen Kestor and
Darren J. Kerbyson Online Monitoring Systems for
Performance Fault Detection . . . . . . 1442003
Ichitaro Yamazaki and
Jakub Kurzak and
Piotr Luszczek and
Jack Dongarra Design and Implementation of a Large
Scale Tree-Based QR Decomposition Using
a $3$D Virtual Systolic Array and a
Lightweight Runtime . . . . . . . . . . 1442004
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 Towards Extreme-Scale Simulations for
Low Mach Fluids with Second-Generation
Trilinos . . . . . . . . . . . . . . . . 1442005
Wail Y. Alkowaileet and
David Carrillo-Cisneros and
Robert V. Lim and
Isaac D. Scherson NUMA-Aware Multicore Matrix
Multiplication . . . . . . . . . . . . . 1450006
Anonymous Author Index Volume 24 . . . . . . . . . 1499001
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1501001
Andrew Adamatzky Guest Editors' Note . . . . . . . . . . 1502001
Brian E. Fratto and
Nataliia Guz and
Evgeny Katz Biomolecular Computing Realized in
Parallel Flow Systems: Enzyme-Based
Double Feynman Logic Gate . . . . . . . 1540001
Josh Moles and
Peter Banda and
Christof Teuscher Delay Line as a Chemical Reaction
Network . . . . . . . . . . . . . . . . 1540002
Ben De Lacy Costello Calculating Voronoi Diagrams Using
Simple Chemical Reactions . . . . . . . 1540003
Jeff Jones Mechanisms Inducing Parallel Computation
in a Model of \em Physarum polycephalum
Transport Networks . . . . . . . . . . . 1540004
Xiaoge Zhang and
Sankaran Mahadevan and
Yong Deng Physarum-Inspired Applications in
Graph-Optimization Problems . . . . . . 1540005
Nikolaos Dourvas and
Michail-Antisthenis Tsompanas and
Georgios Ch. Sirakoulis and
Philippos Tsalides Hardware Acceleration of Cellular
Automata \em Physarum polycephalum Model 1540006
José Félix Costa Uncertainty in Time . . . . . . . . . . 1540007
Andrew Schumann Towards Context-Based Concurrent Formal
Theories . . . . . . . . . . . . . . . . 1540008
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1501002
Chadi Kari and
Alexander Russell and
Narasimha Shashidhar Work-Competitive Scheduling on Task
Dependency Graphs . . . . . . . . . . . 1550001
Fadi Thabtah and
Suhel Hammoud and
Hussein Abdel-Jaber Parallel Associative Classification Data
Mining Frameworks Based MapReduce . . . 1550002
Martin Be\vcka and
Gabriel Ok\vsa and
Marián Vajter\vsic New Dynamic Orderings for the Parallel
One--Sided Block-Jacobi SVD Algorithm 1550003
Roberto Ribeiro and
João Barbosa and
Luís Paulo Santos A Framework for Efficient Execution of
Data Parallel Irregular Applications on
Heterogeneous Systems . . . . . . . . . 1550004
Gokarna Sharma and
Costas Busch Distributed Queuing in Dynamic Networks 1550005
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1501003
Jack Dongarra and
Bernard Tourancheau Guest Editors' Note: Special Issue on
Clusters, Clouds and Data for Scientific
Computing . . . . . . . . . . . . . . . 1502002
Christian Obrecht and
Bernard Tourancheau and
Frédéric Kuznik Performance Evaluation of an OpenCL
Implementation of the Lattice Boltzmann
Method on the Intel Xeon Phi . . . . . . 1541001
Henri Casanova and
Anshul Gupta and
Frédéric Suter Toward More Scalable Off-Line
Simulations of MPI Applications . . . . 1541002
Rafael Ferreira da Silva and
Gideon Juve and
Mats Rynge and
Ewa Deelman and
Miron Livny Online Task Resource Consumption
Prediction for Scientific Workflows . . 1541003
Giorgis Georgakoudis and
Charles Gillan and
Ahmed Sayed and
Ivor Spence and
Richard Faloon and
Dimitrios S. Nikolopoulos Iso-Quality of Service: Fairly Ranking
Servers for Real-Time Data Analytics . . 1541004
Alexandra Vintila Filip and
Ana-Maria Oprescu and
Stefania Costache and
Thilo Kielmann E-BaTS: Energy-Aware Scheduling for
Bag-of-Task Applications in HPC Clusters 1541005
Violaine Villebonnet and
Georges Da Costa and
Laurent Lefevre and
Jean-Marc Pierson and
Patricia Stolf ``Big, Medium, Little'': Reaching Energy
Proportionality with Heterogeneous
Computing Scheduler . . . . . . . . . . 1541006
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1501004
Dhruv Medarametla and
Eddie Cheng and
Steven Cheng and
Lawrance Wu Linearly Many Edge-Faults in
$2$-Bijective Connection Networks . . . 1550006
Bruce Merry A Performance Comparison of Sort and
Scan Libraries for GPUs . . . . . . . . 1550007
Indra Rajasingh and
R. Sundara Rajan and
Paul Manuel A Linear Time Algorithm for Embedding
Christmas Trees into Certain Trees . . . 1550008
N. P. Gopalan and
S. Suresh Modified Delay Scheduling: A Heuristic
Approach for Hadoop Scheduling to
Improve Fairness and Response Time . . . 1550009
Surabhi Jain and
N. Sadagopan Simpler Sequential and Parallel
Biconnectivity Augmentation in Trees . . 1550010
Yihua Ding and
James Z. Wang and
Pradip K. Srimani Self-Stabilizing Algorithm for Minimal
Dominating Set with Safe Convergence in
an Arbitrary Graph . . . . . . . . . . . 1550011
Anonymous Author Index Volume 25 . . . . . . . . . 1599001
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1601001
Guillaume Aupy and
Anne Benoit Approximation Algorithms for Energy,
Reliability, and Makespan Optimization
Problems . . . . . . . . . . . . . . . . 1650001
Abhishek Mishra and
Pramod Kumar Mishra A Randomized Scheduling Algorithm for
Multiprocessor Environments Using Local
Search . . . . . . . . . . . . . . . . . 1650002
Alexandre Maurer and
Sebastien Tixeuil Tolerating Random Byzantine Failures in
an Unbounded Network . . . . . . . . . . 1650003
Benny Applebaum and
Dariusz R. Kowalski and
Boaz Patt-Shamir and
Adi Rosén Clique Here: On the Distributed
Complexity in Fully-Connected Networks 1650004
Eddie Cheng and
Ke Qiu and
Zhizhang Shen On the Conditional Diagnosability of
Hyper-Buttery Graphs and Related
Networks . . . . . . . . . . . . . . . . 1650005
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1601002
Christian Trefftz and
Hugh McGuire and
Zachary Kurmas and
Jerry Scripps Exhaustive Community Enumeration in
Parallel . . . . . . . . . . . . . . . . 1650006
Jing Wu and
Joseph Jaja Achieving Native GPU Performance for
Out-of-Card Large Dense Matrix
Multiplication . . . . . . . . . . . . . 1650007
Lisa Higham and
Jalal Kawash Pitfalls in Memory Consistency Modelling 1650008
Yang Wang and
Wei Shi and
Kenneth B. Kent On Optimal Scheduling Algorithms for
Well-Structured Workflows in the Cloud
with Budget and Deadline Constraints . . 1650009
Soumyadip Bandyopadhyay and
Dipankar Sarkar and
Chittaranjan Mandal and
Kunal Banerjee and
Krishnam Raju Duddu A Path Construction Algorithm for
Translation Validation Using PRES+
Models . . . . . . . . . . . . . . . . . 1650010
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1601003
Pavel Zaichenkov and
Olga Tveretina and
Alex Shafarenko and
Bert Gijsbers and
Clemens Grelck The Cost and Benefits of Coordination
Programming: Two Case Studies in
Concurrent Collections and S-NET . . . . 1650011
Stefan D. Bruda and
Mary Sarah Ruth Wilkin Limitations of Coverability Trees for
Context-Free Parallel Communicating
Grammar Systems and Why these Grammar
Systems are not Linear Space . . . . . . 1650012
Omar Abdelkafi and
Lhassane Idoumghar and
Julien Lepagnot A Survey on the Metaheuristics Applied
to QAP for the Graphics Processing Units 1650013
Markus Flatz and
Marián Vajter\vsic Parallel Nonnegative Matrix
Factorization via Newton Iteration . . . 1650014
Tyler Crain and
Vincent Gramoli and
Michel Raynal A Fast Contention-Friendly Binary Search
Tree . . . . . . . . . . . . . . . . . . 1650015
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1601004
Jiaquan Gao and
Yuanshen Zhou and
Kesong Wu A Novel Multi-GPU Parallel Optimization
Model for The Sparse Matrix-Vector
Multiplication . . . . . . . . . . . . . 1640001
Jianbin Fang and
Peng Zhang and
Zhaokui Li and
Tao Tang and
Xuhao Chen and
Cheng Chen and
Canqun Yang Evaluating Multiple Streams on
Heterogeneous Platforms . . . . . . . . 1640002
Johanne Cohen and
Jonas Lef\`evre and
Khaled Maâmra and
Laurence Pilard and
Devan Sohier A Self-Stabilizing Algorithm for Maximal
Matching in Anonymous Networks . . . . . 1650016
Damien Imbs and
Michel Raynal Trading off $t$-Resilience for
Efficiency in Asynchronous Byzantine
Reliable Broadcast . . . . . . . . . . . 1650017
Manoj Kumar Chande and
Cheng-Chi Lee and
Chun-Ta Li A New Self-Certified Convertible
Authenticated Encryption Scheme Based on
Discrete Logarithm Problem . . . . . . . 1650018
John Michalakes and
Michael J. Iacono and
Elizabeth R. Jessup Optimizing Weather Model Radiative
Transfer Physics for Intel's Many
Integrated Core (MIC) Architecture . . . 1650019
Anonymous Author Index: Volume 26 . . . . . . . . 1699001
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1701001
Sergei Gorlatch and
Herbert Kuchen Guest Editors' Note . . . . . . . . . . 1702001
Wijnand Suijlen Mock BSPlib for Testing and Debugging
Bulk Synchronous Parallel Software . . . 1740001
Thibaut Tachon and
Chong Li and
Gaétan Hains and
Frédéric Loulergue Automated Generation of BSP Automata . . 1740002
Claudia Misale and
Maurizio Drocco and
Marco Aldinucci and
Guy Tremblay A Comparison of Big Data Frameworks on a
Layered Dataflow Model . . . . . . . . . 1740003
Marco Danelutto and
Daniele De Sensi and
Massimo Torquati A Power-Aware, Self-Adaptive Macro Data
Flow Framework . . . . . . . . . . . . . 1740004
Dalvan Griebler and
Marco Danelutto and
Massimo Torquati and
Luiz Gustavo Fernandes SPar: A DSL for High-Level and
Productive Stream Parallelism . . . . . 1740005
Selim G. Akl Editorial Note . . . . . . . . . . . . . 1701002
Panagiota Fatourou and
Yiannis Nikolakopoulos and
Marina Papatriantafilou Linearizable Wait-Free Iteration
Operations in Shared Double-Ended Queues 1750001
Ajoy K. Datta and
Stephane Devismes and
Lawrence L. Larmore and
Vincent Villain Self-Stabilizing Weak Leader Election in
Anonymous Trees Using Constant Memory
per Edge . . . . . . . . . . . . . . . . 1750002
Toni Mancini and
Annalisa Massini and
Enrico Tronci Parallelization of Cycle-Based Logic
Simulation . . . . . . . . . . . . . . . 1750003
Brahim Neggazi and
Volker Turau and
Mohammed Haddad and
Hamamache Kheddouci A $ O(m) $ Self-Stabilizing Algorithm
for Maximal Triangle Partition of
General Graphs . . . . . . . . . . . . . 1750004
Chun-Nan Hung and
Cheng-Kuan Lin and
Lih-Hsing Hsu and
Eddie Cheng and
László Lipták Strong Fault-Hamiltonicity for the
Crossed Cube and Its Extensions . . . . 1750005
Farhad Merchant and
Anupam Chattopadhyay and
Soumyendu Raha and
S. K. Nandy and
Ranjani Narayan Accelerating BLAS and LAPACK via
Efficient Floating Point Architecture
Design . . . . . . . . . . . . . . . . . 1750006
Gaetano Coccimiglio and
Salimur Choudhury A Parallel Local Search Algorithm for
Clustering Large Biological Networks . . 1750007
Anirban Ghose and
Lokesh Dokara and
Soumyajit Dey and
Pabitra Mitra A Framework for OpenCL Task Scheduling
on Heterogeneous Multicores . . . . . . 1750008
Amit Datta and
Mallika De and
Bhabani P. Sinha Fast Parallel Algorithm for Prefix
Computation in Multi-Mesh Architecture 1750009
Amedeo Sapio and
Mario Baldi and
Fulvio Risso and
Narendra Anand and
Antonio Nucci Packet Capture and Analysis on MEDINA, A
Massively Distributed Network Data
Caching Platform . . . . . . . . . . . . 1750010
Anonymous Author Index Volume 27 . . . . . . . . . 1799001
Tripti Jain and
Klaus Schneider The Half Cleaner Lemma: Constructing
Efficient Interconnection Networks from
Sorting Networks . . . . . . . . . . . . 1850001
Yuichi Sudo and
Ajoy K. Datta and
Lawrence L. Larmore and
Toshimitsu Masuzawa Constant Space Self-stabilizing Center
Finding Algorithms in Chains and Trees 1850002
Siegfried Höfinger and
Thomas Ruh and
Ernst Haunschmid Fast Approximate Evaluation of Parallel
Overhead from a Minimal Set of Measured
Execution Times . . . . . . . . . . . . 1850003
Weijian Zheng and
Fengguang Song and
Lan Lin and
Zizhong Chen Scaling Up Parallel Computation of Tiled
QR Factorizations by a Distributed
Scheduling Runtime System and Analytical
Modeling . . . . . . . . . . . . . . . . 1850004
Hector Zenil and
Narsis A. Kiani and
Ming-mei Shang and
Jesper Tegnér Algorithmic Complexity and
Reprogrammability of Chemical Structure
Networks . . . . . . . . . . . . . . . . 1850005
Achour Mostefaoui and
Matthieu Perrin and
Michel Raynal A Simple Object that Spans the Whole
Consensus Hierarchy . . . . . . . . . . ??
Chen Hao and
Weihua Yang A Remark on Rainbow $6$-Cycles in
Hypercubes . . . . . . . . . . . . . . . ??
Lali Barri\`ere and
Xavier Muñoz and
Janosch Fuchs and
Walter Unger Online Matching in Regular Bipartite
Graphs . . . . . . . . . . . . . . . . . ??
Stefan Kronawitter and
Sebastian Kuckuk and
Harald Köstler and
Christian Lengauer Automatic Data Layout Transformations in
the ExaStencils Code Generator . . . . . ??
Joseph Tassone and
Mike Biocchi The Importance of Applying Security
Practices in Wireless Communication:
Bluetooth Low Energy and RFID . . . . . ??
Peizhi Yan and
Yi Feng Using Convolution and Deep Learning in
Gomoku Game Artificial Intelligence . . ??
Sai Anantapantula and
Christopher Melekian and
Eddie Cheng Matching Preclusion for the
Shuffle-Cubes . . . . . . . . . . . . . ??
Miao Lu and
Shurong Zhang and
Weihua Yang Regular Connected Bipancyclic Spanning
Subgraphs of Torus Networks . . . . . . ??
Alexandros V. Gerbessiotis A Study of Integer Sorting on Multicores ??
Mengjie Lv and
Shuming Zhou and
Xueli Sun and
Guanqin Lian and
Jiafei Liu Reliability Evaluation of Data Center
Network DCell . . . . . . . . . . . . . ??
Christian Schmitt and
Moritz Schmid and
Sebastian Kuckuk and
Harald Köstler and
Jürgen Teich and
Frank Hannig Reconfigurable Hardware Generation of
Multigrid Solvers with Conjugate
Gradient Coarse-Grid Solution . . . . . ??
Tianlong Ma and
Yaping Mao and
Eddie Cheng and
Jinling Wang Fractional Matching Preclusion for $ (n,
k)$-Star Graphs . . . . . . . . . . . . ??
Anonymous Author Index Volume 28 . . . . . . . . . ??
Ambra Abdullahi Hassan and
Valeria Cardellini and
Pasqua D'ambra and
Daniela Di Serafino and
Salvatore Filippone Efficient Algebraic Multigrid
Preconditioners on Clusters of GPUs . . ??
Saptaparni Kumar and
Jennifer L. Welch Implementing $ \diamond P $ with Bounded
Messages on a Network of ADD Channels ??
Shane Carroll and
Wei-ming Lin Round Robin Thread Selection
Optimization in Multithreaded Processors ??
Jinho Ahn Efficient Communication Induced
Checkpointing Protocol for Broadcast
Network-based Distributed Systems . . . ??
Jinho Ahn Scalable Sender-Based Message Logging
Protocol with Little Communication
Overhead for Distributed Systems . . . . ??
Stefan Kehrer and
Wolfgang Blochinger Elastic Parallel Systems for High
Performance Cloud Computing:
State-of-the-Art and Future Directions ??
Chen Hao and
Weihua Yang The Generalized Connectivity of Data
Center Networks . . . . . . . . . . . . ??
Pranav Arunandhi and
Eddie Cheng and
Christopher Melekian A Note on the Steiner $k$-Diameter of
Tensor Product Networks . . . . . . . . ??
Eleni C. Akrida and
Paul G. Spirakis On Verifying and Maintaining
Connectivity of Interval Temporal
Networks . . . . . . . . . . . . . . . . ??
Ramón Alonso-sanz and
Haozhen Situ Quantum Fuzzy Game Simulation . . . . . ??
Jiafei Liu and
Shuming Zhou and
Zhendong Gu and
Yihong Wang and
Qianru Zhou A Note of Independent Number and
Domination Number of $ Q_{n, k, m} $
-Graph . . . . . . . . . . . . . . . . . ??
Tianlong Ma and
Jinling Wang and
Mingzu Zhang The Restricted Edge-Connectivity of
Kronecker Product Graphs . . . . . . . . ??
Shane Carroll and
Wei-ming Lin Applied On-Chip Machine Learning for
Dynamic Resource Control in
Multithreaded Processors . . . . . . . . ??
Diego Mendez and
David Arevalo and
Diego Patino and
Eduardo Gerlein and
Ricardo Quintana Parallel Architecture of Reconfigurable
Hardware for Massive Output Active Noise
Control . . . . . . . . . . . . . . . . ??
Avah Banerjee and
Dana Richards A Sorting Network on Trees . . . . . . . ??
Ajay Arora and
Eddie Cheng and
Colton Magnant Proper Coloring Distance in Edge-Colored
Cartesian Products of Complete Graphs
and Cycles . . . . . . . . . . . . . . . ??
Shiying Wang and
Mujiangshan Wang A Note on the Connectivity of $m$-Ary
$n$-Dimensional Hypercubes . . . . . . . ??
Anonymous Author Index Volume 29 . . . . . . . . . ??
Shuangshuang Zhang and
Yuzhi Xiao and
Xia Liu and
Jun Yin A Short Note of Strong Matching
Preclusion for a Class of Arrangement
Graphs . . . . . . . . . . . . . . . . . ??
Carlos Fernandez and
Ioannis Vourkas and
Antonio Rubio Shortest Path Computing in Directed
Graphs with Weighted Edges Mapped on
Random Networks of Memristors . . . . . ??
Wantao Ning The Connectivity of Exchanged Folded
Hypercube . . . . . . . . . . . . . . . ??
Firmin Andzembe Okoubi and
Jonas Koko Parallel Nesterov Domain Decomposition
Method for Elliptic Partial Differential
Equations . . . . . . . . . . . . . . . ??
Yuichi Sudo and
Toshimitsu Masuzawa Leader Election Requires Logarithmic
Time in Population Protocols . . . . . . ??
Karla Vargas and
Sergio Rajsbaum and
Michel Raynal An Eventually Perfect Failure Detector
for Networks of Arbitrary Topology
Connected with ADD Channels Using
Time-To-Live Values . . . . . . . . . . ??
Abdulelah Algosaibi and
Khaled Ragab and
Saleh Albahli Parallel-Based Techniques for Managing
and Analyzing the Performance on
Semantic Graph . . . . . . . . . . . . . ??
Sanjeev Saxena All Nearest Smallers Made Simple . . . . ??
Qifan Zhang and
Liqiong Xu and
Weihua Yang and
Shanshan Yin Reliability Analysis of the Generalized
Exchanged Hypercube . . . . . . . . . . ??
Bo Zhu and
Tianlong Ma and
Shuangshuang Zhang and
He Zhang Fractional Matching Preclusion for Data
Center Networks . . . . . . . . . . . . ??
Eddie Cheng and
Ke Qiu and
Zhizhang Shen and
Weihua Yang Preface . . . . . . . . . . . . . . . . ??
Eddie Cheng and
Ke Qiu and
Zhizhang Shen and
Weihua Yang A Brief Account on the Development and
Future Research Directions of
Connectivity Properties of
Interconnection Networks . . . . . . . . ??
Shangwei Lin and
Jianfeng Pei and
Chunfang Li Super Edge-Connected Linear Hypergraphs ??
Yingzhi Tian and
Huaping Ma and
Liyun Wu The Connectivity of a Bipartite Graph
and Its Bipartite Complementary Graph ??
Cheng-kuan Lin and
Eddie Cheng and
László Lipták Structure and Substructure Connectivity
of Hypercube-Like Networks . . . . . . . ??
Liyang Zhai and
Liqiong Xu and
Weihua Yang Fault-Tolerant Maximal
Local-Edge-Connectivity of Augmented
Cubes . . . . . . . . . . . . . . . . . ??
Mujiangshan Wang and
Dong Xiang and
Shiying Wang Connectivity and Diagnosability of
Leaf-Sort Graphs . . . . . . . . . . . . ??
Aixia Liu and
Jun Yuan and
Shiying Wang The $g$-Extra Conditional Diagnosability
of Graphs in Terms of $g$-Extra
Connectivity . . . . . . . . . . . . . . ??
Chengfu Qin and
Weihua Yang $5$-Shredders of Contraction-Critical
$5$-Connected Graphs . . . . . . . . . . ??
Gary Chartrand and
Ping Zhang Uniformly Connected Graphs --- A Survey ??
Daolu Zha and
Xi Jin and
Rui Shang and
Pengfei Yang A Real-Time Learning-Based
Super-Resolution System on FPGA . . . . ??
Zhendong Gu and
Shuming Zhou and
Jiafei Liu and
Qianru Zhou and
Dajin Wang Shapley Distance and Shapley Index for
Some Special Graphs . . . . . . . . . . ??
Vedran Novakovi\'c Batched Computation of the Singular
Value Decompositions of Order Two by the
AVX-512 Vectorization . . . . . . . . . ??
Santiago Hernández-orozco and
Francisco Hernández-quiroz and
Hector Zenil and
Wilfried Sieg Shortening of Proof Length is Elusive
for Theorem Provers . . . . . . . . . . ??
Guanlei Xu and
Xiaogang Xu The Parallel Quantum Algorithm for the
Class of Optimization . . . . . . . . . ??
Anonymous Author Index Volume 30 . . . . . . . . . ??
He Zhang and
Jinyu Zou and
Shuangshuang Zhang and
Chengfu Ye Fractional Strong Matching Preclusion
for DHcube . . . . . . . . . . . . . . . ??
Adam Heriban and
Sébastien Tixeuil Mobile Robots with Uncertain Visibility
Sensors: Possibility Results and Lower
Bounds . . . . . . . . . . . . . . . . . ??
Laurence Boxer Coarse Grained Parallel Selection . . . ??
Jessie Abraham and
Micheal Arockiaraj Minimum Linear Arrangement of the
Cartesian Product of Optimal Order Graph
and Path . . . . . . . . . . . . . . . . ??
Hongbin Zhuang and
Sunjian Zheng and
Ximeng Liu and
Cheng-kuan Lin and
Xiaoyan Li Reliability Evaluation of Generalized
Exchanged Hypercubes Based on Imprecise
Diagnosis Strategies . . . . . . . . . . ??
Pavan Kumar Perepu OpenMP Implementation of Parallel
Longest Common Subsequence Algorithm for
Mathematical Expression Retrieval . . . ??
Yang Cao and
Fei Wu and
Thomas Robertazzi Integrating Amdahl-like Laws and
Divisible Load Theory . . . . . . . . . ??
Sterling Ramroach and
Ajay Joshi Accelerating Data-Parallel Neural
Network Training with Weighted-Averaging
Reparameterisation . . . . . . . . . . . ??
Shane Carroll and
Wei-ming Lin Exploiting Long-Term Temporal Cache
Access Patterns for LRU Insertion
Prioritization . . . . . . . . . . . . . ??
Grzegorz Rafa\l Dec LSTM Cell Implementation on FPGAs . . . ??
Bo Zhu and
Tianlong Ma and
Shuangshuang Zhang and
He Zhang Fractional Matching Preclusion for Data
Center Networks . . . . . . . . . . . . ??
Junwei Zhang and
Li Shi and
Yang Liu and
Thomas G. Robertazzi Optimizing Data Intensive Flows for
Networks on Chips . . . . . . . . . . . ??
Michel Raynal On the Versatility of Bracha's Byzantine
Reliable Broadcast Algorithm . . . . . . ??
Shuai Kou and
Chengfu Qin and
Weihua Yang Contractible Edges in 3-Connected Cubic
Graphs . . . . . . . . . . . . . . . . . ??
Wenjun Liu and
Wenjun Li Adaptive Diagnosis of Hamiltonian
Networks under the Comparison Model . . ??
Liyang Zhai and
Liqiong Xu and
Shanshan Yin On the 3-Extra Connectivity of Enhanced
Hypercubes . . . . . . . . . . . . . . . ??
Jiafei Liu and
Shuming Zhou and
Eddie Cheng and
Gaolin Chen and
Min Li Reliability Evaluation of Bicube-Based
Multiprocessor System under the
$g$-Good-Neighbor Restriction . . . . . ??
Olfa Hamdi-larbi and
Ichrak Mehrez and
Thomas Dufaud Machine Learning to Design an
Auto-tuning System for the Best
Compressed Format Detection for Parallel
Sparse Computations . . . . . . . . . . ??
Othon Michail and
Paul G. Spirakis and
Michail Theofilatos Beyond Rings: Gathering in 1-Interval
Connected Graphs . . . . . . . . . . . . ??
Paul Burkhardt Graph Connectivity in Log Steps Using
Label Propagation . . . . . . . . . . . ??
Anonymous Author Index Volume 31 . . . . . . . . . ??