Table of Contents

• EDS: A Parallel Computer System for Advanced Information ProcessingColin J. Skelton, Carsten Hammer, M. Lopez, Mike Reeve, Paul Townsend, Kam-Fai Wong. 1-18
• A Decompositional Approach to the Design of Efficient parallel ProgramsYing Liu, Ambuj K. Singh, Rajive Bagrodia. 21-36
• Space-Efficient Parallel MergingJyrki Katajainen. 37-49
• On Embedding Interconnection Networks into Rings of ProcessorsJuraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto. 53-62
• Asynchronous Mobile Processes and Graph RewritingJohn R. W. Glauert. 63-78
• PTAH: Introduction to a New Parallel Architecture for Highly Numeric ProcessingFranck Cappello, Jean-Luc Béchennec, Jean-Louis Giavitto. 81-96
• The Topsy Project: a Position PaperPeter Osmon, Tom Stiemerling, Tony Valsamidis, Andy Whitcroft, Tim Wilkinson, Nick Williams. 97-112
• Optimal Algorithms for Disemination of Information in Generalized Communication ModesRainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz. 115-130
• Efficient Parallel Algorithms on Interval GraphsSajal K. Das, Calvin Ching-Yuen Chen. 131-143
• SYMPATIX: a SIMD computer performing the low and intermediate levels of image processingT. Collette, Hassane Essafi, Didier Juvin, J. Kaiser. 147-161
• 1-Dimensional Parallel FFT Benchmark on SUPRENUMVladimir Getov. 163-174
• On Designing Fault-Tolerant Extensions With Optimal Fanout For Complete Bipartite NetworksAbdel Aziz Farrag, Robert Dawson, Qi Yao. 177-191
• Application-Specific Deadlock Free Wormhole Routing on MulticomputersXiaoxiong Zhong, Virginia Mary Lo. 193-208
• Scalability Problems in Multiprocessors with Private CachesMichel Dubois, Luiz André Barroso, Yung-Syau Chen, Koray Öner. 211-230
• Promises and Issues in Optical ComputingPierre Chavel, Jean Taboury. 231-242
• A Model to Design Reusable Parallel Software ComponentsJean Paul Bahsoun, Louis Féraud. 245-260
• Extensibility and Reuse of Object-Oriented Synchronization ComponentsLaurent Thomas. 261-275
• Using Parallelism and Pipeline for the Optimisation of Join QueriesMyra Spiliopoulou, Michael Hatzopoulos, Costas Vassilakis. 279-294
• Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database SystemsRobert Marek, Erhard Rahm. 295-310
• Explicit Expression of Multidimensional Data ParallelismHua Bi. 313-328
• Programming Massively Parallel Architectures with Sequential Object Oriented LanguagesJean-Marc Jézéquel, F. André Bergheul, F. André. 329-344
• A New Program Transformation to Minimise Communication in Distributed Memory ArchitectureMichael F. P. O Boyle, G. A. Hedayat. 347-362
• Distributed Termination EnforcementMartin Rudalics. 363-378
• Verification of Systolic Architecture DesignsFuyau Lin, Timothy K. Shih. 381-396
• Reduction Operators in ALPHAHervé Le Verge. 397-411
• An operational semantics for a parallel functional language with continuationsLuc Moreau. 415-430
• A Concurrent and Distributed Extension of SchemeChristian Queinnec. 431-446
• New Techniques for Cycle ShrinkingYves Robert, Siang W. Song. 449-464
• Loop Restructuring Techniques For Thrashing ProblemGuohua Jin, Fujie Chen. 465-480
• Characterizing the Paralation Model using Dynamic AssignmentEric T. Freeman, Daniel P. Friedman. 483-496
• An Implementation of Static Functional Process NetworksStuart Cox, Shell-Ying Huang, Paul Kelly, Junxian Liu, Frank Taylor. 497-512
• Translating Concurrent Programs into VLSI ChipsAlain J. Martin. 515-532
• Message-Brokers and Communicating Prolog ProcessesMichael J. Wise. 535-549
• Extensions to a Parallel Prolog System to Support Real-Time ApplicationsCostas Mourlas, Constantin Halatsis. 551-565
• Declarative Programming for Conventional MIMD MultiprocessorsLubomir Bic, John M. A. Roy, Mark Nagel. 569-583
• Minimizing Loop Storage Allocation for An Argument-Fetching Dataflow Architecture ModelQi Ning, Guang R. Gao. 585-600
• Performance of Muse on the BBN Butterfly TC2000Khayri A. M. Ali, Roland Karlsson. 603-616
• And-Or Parallelism in Full Prolog with Paged Binding ArraysGopal Gupta, Vítor Santos Costa. 617-632
• Improving the Efficiency of Virtual Channels with Time-Dependent Selection FunctionsJosé Duato. 635-650
• Using Opportunistic Combining Networks to Reduce Contention in MulticomputersGregory V. Wilson. 651-666
• Mixed-Mode Multicomputers with Load AdaptabilityMohamed S. Baig, Tarek A. El-Ghazawi, Nikitas A. Alexandridis. 669-683
• Architecture of Parallel Management Kernel for PIE64Yasuo Hidaka, Hanpei Koike, Hidehiko Tanaka. 685-700
• Concurrent Data Structures for Hypercube MachineMohammad Reza Meybodi. 703-724
• Repeated Matrix Squaring for the Parallel Solution of Linear SystemsBruno Codenotti, Mauro Leoncini, Giovanni Resta. 725-732
• Performance Evaluation of Cache Memories in Tightly Coupled Multiprocessor SystemsJean-Marc Kuntz. 735-750
• An Evaluation of Set-Associativity in Two-Level Caches for Shared Memory MultiprocessorsSenthil Krishnamoorthy, Alok N. Choudhary. 751-766
• Reliable Communication in VPLeva Kühn, Franz Puntigam. 769-782
• Paragon Specifications: Structure, Analysis and ImplementationPaul Anderson, David Bolton, Paul H. J. Kelly. 783-798
• Stanford DASH Multiprocessor: The Hardware and Software ApproachAnoop Gupta. 801-805
• Dynamic Action SCheduling in a Parallel Database SystemPaul W. P. J. Grefen, Peter M. G. Apers. 809-824
• A Compositional Approach for the Design of a Parallel Query Processing LanguageCarla Chachaty, Pascale Borla-Salamet, Mike Ward. 825-840
• Back and Forth Bisimulations On Prime Event StructuresFerroudja Cherief. 843-858
• Dynamic Concurrent ProcessesJean Fanchon. 859-874
• Exegesis of DBC/1012 and P-90 - Industrial Supercomputer Database MachinesFelipe Cariño, Pekka Kostamaa. 877-892
• Exploiting Parallelism in Primitive Operations on Bulk Data TypesSimon H. Lavington, M. E. Waite, Jerome Robinson, Neil Dewhurst. 893-908
• Comparative Semantics of ::::µLog::::Koenraad De Bosschere, Jean-Marie Jacquet. 911-926
• A Framework for Parallel Composition of ProtocolsGurdip Singh, Arthur J. Bernstein. 927-942
• A Case Study: Parallel Program Development for a Recursive Numerical AlgorithmSergei Gorlatch. 945-946
• A Distributed Protocol for Channel-Based Communication with ChoiceFrederick Knabe. 947-948
• A Refinement of Communicating ProcessesSylvie Damy, Guy-René Perrin. 949-950
• Distributing Finite Transition Systems Extended AbstractPaul Caspi, Alain Girault. 950-951
• Coping with the Process Proliferation Problem in Concurrent Object-Based Language ImplementationsRiccardo Capobianchi, Rachid Guerraoui, Agnes Lanusse, Pierre Roux. 953-954
• Correctness of flat data parallel algorithms: an axiomatic approach and examplesJoaquim Gabarró, Ricard Gavaldà. 955-956
• Generating Memory-Efficient Imperative Data Structures from Systolic ProgramsZbigniew Chamski. 957-958
• Geometric Transforms on Parallel ArchitectureJean-Paul Carrara, Jean-Luc Basille, Jean-François Larue, Didier Juvin. 959-960
• Implementing Cut in a Distributed Data Driven OR-Parallel Prolog EnvironmentPéter Kacsuk. 961-962
• Optical Interconnects for Parallel Systems: Demonstration on an Optical Link with Multiple-Quantum-Well Opto-Electronic ArraysN. de Beaucoudrey, A. Bellemain, D. Phalippou, P. Chavel, D. Fortin, Iaakov Exman, Larry Rudolph, J. P. Schnell, J. P. Pocholle. 963-964
• Parallel Task Assignment by Graph PartitioningShan Fan Liu, Mary Lou Soffa. 965-966
• Parallelizing Recursive Logic Programs through DecompositionAntonius Klingler, Volker Penner. 967-968
• Performance Analysis of the Network of the GFLOPS Parallel ArchitectureDominique Houzet, Jean-Luc Basille, Jean-Yves Latil. 969-970
• PRELUDE: A System for Portable Parallel SoftwareWilliam E. Weihl, Eric A. Brewer, Adrian Colbrook, Chrysanthos Dellarocas, Wilson C. Hsieh, Anthony D. Joseph, Carl A. Waldspurger, Paul Wang. 971-973
• Routing in Hypercycles. Deadlock Free and Backtracking StrategiesNikitas J. Dimopoulos, M. Chowdhury, Radhakrishnan Sivakumar, Vassilios V. Dimakopoulos. 973-974
• Serialisation as a Paradigm for the Engineering of Parallel ProgramsG. R. Justo, Peter H. Welch. 975-976
• SIMCDL: Simulating Parallel Programming in a Sequential EnvironmentJérôme Perret, Philippe Gautron. 977-978
• XFSM: A Format Model of Communicating State Machines for Implementation SpecificationGünter Karjoth. 979-980
• XPRAM Model and Programming InterfaceJonathan M. Nash, Peter M. Dew. 981-982