Table of Contents

• Improved Probabilistic Routing on Generalized HypercubesAfonso Ferreira, Miltos D. Grammatikakis. 1-12
• Efficient Data Communication in Incomplete HypercubeJen-Shiuh Liu, Wen-Jing Hsu. 13-24
• Efficient Communication in the Folded Petersen Interconnection NetworkSabine R. Öhring, Sajal K. Das. 25-36
• Compiling Rewriting onto SIMD and MIMD/SIMD MaschinesPatrick Lincoln, Narciso Martí-Oliet, José Meseguer, Livio Ricciulli. 37-48
• A Compilation Technique for Varying Communication Cost NUMA ArchitecturesSantosh Pande, Kleanthis Psarris. 49-60
• A Data Partitioning Algorithm for Distributed Memory CompilationMichael F. P. O Boyle. 61-72
• Towards a High Precision Massively Parallel ComputerMario Fiallos Aguilar, Jean Duprat. 73-84
• On the Testability of Purely Recursive Digital FiltersAnastasios Vergis, Vassilios S. Verykios. 85-96
• Voting on Synchronous CommunicationsRichard P. Hopkins. 97-108
• Protocol Validation: A Parallel Technique to Reduce the Reachability TreeAbderrahim Benslimane. 109-121
• Optimal Parallel Execution of Complete Binary Trees and Grids into most Popular Interconnection NetworksEvripidis Bampis, Jean-Claude König, Denis Trystram. 122-133
• Time-Optimal Nearest-Neighbor Computations on Enhanced MeshesStephan Olariu, Ivan Stojmenovic. 134-145
• Simulation of PRAM Models on MeshesVille Leppänen, Martti Penttonen. 146-158
• On the Multisearching Problem of HypercubesMikhail J. Atallah, Andreas Fabri. 159-166
• Code Liberation - a Tool for Refitting Code to a Parallel EnvionmentPatricia Prather Pineo. 167-179
• High-Level Visualisation of Parallel Logic Program ExecutionSteven David Prestwich, Anthony J. Kusalik. 180-191
• Next-Generation Parallel Performance Visualization: A Prototyping Environment for Visualization DevelopmentSteven T. Hackstadt, Allen D. Malony. 192-201
• A Formal Approach to Modeling Expected Behavior in Parallel Program VisualizationsJoseph L. Sharnowski, Betty H. C. Cheng. 202-213
• An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration NetworksH. K. Dai. 214-225
• Bypass Strategy in Hypercube Multiprocessors by adding Bus ConnectionsTsutomu Ishikawa. 226-237
• OPTIMUL: A Hybrid Multiprocessor for Distributed and Shared Memory Multiprocessing with WDM Optical Fiber InterconnectionsKanad Ghose. 238-249
• ILIAS, a Sequential Language for Parallel Matrix ComputationsL. D. J. C. Loyens, Jean R. Moonen. 250-261
• Static Communications in Parallel Scientific PropgramsDamien Gautier de Lahaut, Cécile Germain. 262-276
• Load Balancing for Extraplation Methods on Distributed Memory MultiprocessorsThomas Rauber, Gudula Rünger. 277-288
• On the Definition of SpeedupWolfgang Ertel. 289-300
• Petri Net Performance Models of Parallel Systems - Methodology and Case StudyHarald Wabnig, Günter Haring. 301-312
• Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD MachinesLouis H. Ziantz, Can C. Özturan, Boleslaw K. Szymanski. 313-322
• A New Approach to Array Redistribution: Strip Mining RedistributionAkiyoshi Wakatani, Michael Wolfe. 323-335
• Analytic Model of a Cache Only Memory ArchitectureCarlos Carreras, Carlos A. López, Manuel V. Hermenegildo. 336-350
• Memory Assignment for Multiprocessor Caches through Grey ColoringAnant Agarwal, John V. Guttag, Christoforos N. Hadjicostis, Marios C. Papaefthymiou. 351-362
• An Adaptive Update-Based Cache Coherence Protocol for Reduction of Miss Rate and TrafficHåkan Nilsson, Per Stenström. 363-374
• Eliminating Invalidation in Coherent-Cache Parallel Graph ReductionAndrew J. Bennett, Paul H. J. Kelly. 375-386
• Enhancing Parallelism by Removing Cyclic Data DependenciesFubo Zhang, Erik H. D Hollander. 387-397
• An Interaction-based Language and its Typing SystemKaku Takeuchi, Kohei Honda, Makoto Kubo. 398-413
• On the Parallelism of DataConstantinos V. Papadopoulos. 414-424
• Predicative Polymorphism in Pi-CalculusVasco Thudichum Vasconcelos. 425-437
• Improving the Execution of Dependent And-Parallel Prolog DDASKish Shen. 438-452
• OR-Parallel Prolog on Distributed Memory SystemsPéter Kacsuk. 453-463
• Efficient Distributed Memory Implementation of a Data Parallel Functional LanguageHerbert Kuchen, Marinus J. Plasmeijer, Holger Stoltze. 464-477
• Modelling Photochemical Pollution using Parallel and Distributed Computing PlatformsDavid Abramson, M. Cope, R. McKenzie. 478-489
• Parallel Algorithms and Interval Selection Strategies for Globally Adaptive QuadratureJ. Mark Bull, T. L. Freeman. 490-501
• Systolic Designs for Evaluation Linear Combinations of Chebyshev PolynomialsOctav Brudaru, Graham M. Megson. 502-513
• The Impact of the KSR1 Allcache Architecture on the Behavior of the DBS3 Parallel DBMSBenoît Dageville, Patrick Casadessus, Pascale Borla-Salamet. 514-525
• Sparse Generalized HyperGrids for Performance ScalabilityFotios K. Liotopoulos. 526-538
• A Distributed Garbage Collector for Active ObjectsIsabelle Puaut. 539-552
• Bus-Based Parallel Computers: A Viable Way for Massive ParallelismAfonso Ferreira, Alfredo Goldman vel Lejbman, Siang W. Song. 553-564
• Implementation of GTSCristina Barrado, Jesús Labarta, Patricia Borensztejn. 565-576
• A Hierarchical Activation Management Technique for Fine-Grain Multithreaded ExecutionChinhyun Kim, Jean-Luc Gaudiot. 577-588
• Scheduling Task Graphs Onto Distributed Memory Multiprocessors Under Realistic ConstaintsNeelima Mehdiratta, Kanad Ghose. 589-600
• A Dynamic Algorihtm for Online Scheduling of Parallel ProcessesConstantinos V. Papadopoulos. 601-610
• COREA: A Synchronous Calculus of Parallel Communicating Reactive AutomataFrédéric Boniol. 611-622
• Deriving Histories of Nets with Priority RelationRyszard Janicki, Maciej Koutny. 623-634
• What Do You get From a Pi-Calculus Semantics?Matthias Radestock, Susan Eisenbach. 635-647
• Rewriting: An Effective Model of ConcurrencyPatrick Viry. 648-660
• Mercury: Object-Affinity Scheduling and Continuation Passing on MultiprocessorsRobert J. Fowler, Leonidas I. Kontothanassis. 661-676
• Dynamic Allocation of Communication Bandwidth in MulticomputersAbdel-Halim Smai, Lars-Erik Thorelli. 677-688
• Load Balances Priority Queues on Distributed Memory MachinesAjay K. Gupta, Andreas G. Photiou. 689-700
• Parallel Computations with Algebraic Numbers - A Case Study: Jordan Normal Form of MatricesJean-Louis Roch, Gilles Villard. 701-712
• Batch Dynamic Algorithms for Two Graph ProblemsPaolo Ferragina, Fabrizio Luccio. 713-724
• A General Method for Maximizing the Error-Detecting Ability of Distributed AlgorithmsMartina Schollmeyer, Bruce M. McMillin. 725-736
• MAGE: A Massively Agent Execution System for Logic ProgrammingCostas Mourlas, Constantin Halatsis. 737-740
• Checking the Serial Correctness of Control-Parallel ProgramsGilbert Caplain, René Lalement, Thierry Salset. 741-744
• NXLib - A Parallel Programming Environment for Workstation ClustersGeorg Stellner, Arndt Bode, Stefan Lamberts, Thomas Ludwig 0002. 745-748
• Applying Human Factors Techniques to the Design of a Tool for Parallel Program Performance Analysis and TuningAnna Hondroudakis, Rob Procter. 749-752
• An Actor Based Programming System for Heterogeneous ProcessingJocelyn Desbiens, Michel Toulouse, Martin Lavoie, Stéphane Pouzyreff, Pierre Raymond, Tahar Tamazouzt. 753-756
• Introducing Fairness in CSP Systems Specified with State VariablesRicardo Peña-Marí, Luis A. Galán. 757-760
• A Dataflow-Based Massively Parallel Programming Language and Its ImplementationShigeru Kusakabe, Eiichi Takahashi, Rin-ichiro Taniguchi, Makoto Amamiya. 761-764
• Using Subpages for Coherency Control in Parallel Database SystemsAndreas Listl. 765-768
• A Multi-Dimensional Interconnection Network for SIMD ArchitecturesC. Verdier, A. Lafage, E. Boutillon, A. Demeure. 769-772
• A Scalable Bit-Sequential SIMD Architecture for Pattern RecognitionMartin Neschen, Martin Gumm. 773-776
• An Iterative Array Processor Architecture for Matrix ComputationStephen P. S. Lam. 777-780
• Datarol-II: A Fine-Grain Massively Parallel ArchitectureTetsuo Kawano, Shigeru Kusakabe, Rin-ichiro Taniguchi, Makoto Amamiya. 781-784
• From BSP to a Virtual von Neumann MachineNasser Kalantery, Stephen C. Winter, Derek R. Wilson. 785-788
• Data Parallel Relational Database Processing on the Connection Machine CM-2 with Data VaultHideaki Okada, Kazuhiko Matsumoto, Masaru Kitsuregawa. 789-792
• Straggered Scheme: A Loop Allocation PolicyAli R. Hurson, Joford T. Lim, Behrooz Shirazi, Krishna M. Kavi. 793-796
• Using Parallel Simulated Annealing in the Mapping ProblemBorut Robic, Jurij Silc. 797-800
• A New Parallel MIMD Connected Component Labeling AlgorithmThomas Johansson, Ewert Bengtsson. 801-804
• Using Reference Counters in Update-Based Coherent MemoryEvangelos P. Markatos, Catherine E. Chronaki. 805-808
• Compositional Reasoning about Real-Time Distributed Systems with Limited ResourcesHenk Schepers. 809-812
• Dynamic Load Balancing on a Virtually-Shared Memory Parallel Computer SystemDimitris Lioupis, Michael Stefanidakis. 813-818
• Analysing the Load Balancing Scheme of a Parallel System on Multiprocessors - A Modeling ApproachJohann Schumann, Manfred R. Jobmann. 819-822
• Performance of Interconnection Network in Multithreaded ArchitecturesShashank S. Nemawarkar, Ramaswamy Govindarajan, Guang R. Gao, Vinod K. Agarwal. 823-826
• Scheduling Algorithms Performance with the pSystem Parallel Programming EnvironmentLuís M. B. Lopes, Fernando M. A. Silva. 827-830
• A New Routing Scheme for Concatenating Two Omega NetworksSeung-Woo Seo, Tse-Yun Feng. 831-834