Table of Contents

• A Study of the Efficiency of Shared Attraction Memories in Cluster-Based COMA MultiprocessorsAnders Landin, Mattias Karlgren. 1-7 [doi]
• An Evaluation of a Commercial CC-NUMA Architecture - The CONVEX Exemplar SPP1200Radhika Thekkath, Amit Pal Singh, Jaswinder Pal Singh, Susan John, John L. Hennessy. 8-17 [doi]
• Coherent Block Data Transfer in the FLASH MultiprocessorJohn Heinlein, Kourosh Gharachorloo, Robert P. Bosch Jr., Mendel Rosenblum, Anoop Gupta. 18-27 [doi]
• A Memory Efficient Array Architecture for Real-Time Motion EstimationVasily G. Moshnyaga, Keikichi Tamaru. 28-32 [doi]
• An Efficient Technique of Instruction Scheduling on a Superscalar-Based MulprocessorRong-Yuh Hwang. 33-39 [doi]
• Accuracy and Speedup of Parallel Trace-Driven Architectural SimulationAnthony-Trung Nguyen, Pradip Bose, Kattamuri Ekanadham, Ashwini K. Nanda, Maged M. Michael. 39-44 [doi]
• Wide-Sense Nonblocking Clos Networks under Packing StrategyYuanyuan Yang, Jianchao Wang. 45-54 [doi]
• Gracefully Degradable Pipeline NetworksRobert Cypher, Ambrose Kofi Laing. 55-64 [doi]
• Distributed Submesh Determination in Faulty Tori and MeshesHsing-Lung Chen, Shu-Hua Hu. 65-70 [doi]
• Modeling Compiled Communication Costs in Multiplexed Optical NetworksCharles A. Salisbury, Rami G. Melhem. 71-79 [doi]
• Characterization of Deadlocks in Interconnection NetworksSugath Warnakulasuriya, Timothy Mark Pinkston. 80-86 [doi]
• k -ary n -trees: High Performance Networks for Massively Parallel ArchitecturesFabrizio Petrini, Marco Vanneschi. 87 [doi]
• An Architecture Workbench for MulticomputersAndy D. Pimentel, Louis O. Hertzberger. 94-99 [doi]
• SuperWeb: Towards a Global Web-Based Parallel Computing InfrastructureKlaus E. Schauser, Chris J. Scheiman, Gyung-Leen Park, Behrooz Shirazi, Jeff Marquis. 100-106 [doi]
• S-Check: a Tool for Tuning Parallel ProgramsRobert Snelick. 107-112 [doi]
• Causality Filters : A Tool for the Online Visualization and Steering of Parallel and Distributed ProgramsEileen Kraemer. 113-120 [doi]
• Interactive Visual Exploration of Distributed ComputationsDelbert Hart, Eileen Kraemer. 121-127 [doi]
• High Performance Computational Steering of Physical SimulationsJeffrey S. Vetter, Karsten Schwan. 128 [doi]
• Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time TasksAlan A. Bertossi, Andrea Fusiello, Luigi V. Mancini. 133-138 [doi]
• Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer SystemYuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar. 139-145 [doi]
• Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task GraphsTheodore Andronikos, Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas. 146-151 [doi]
• A Comparison of General Approaches to Multiprocessor SchedulingJing-Chiou Liou, Michael A. Palis. 152-156 [doi]
• DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor SystemsGyung-Leen Park, Behrooz Shirazi, Jeff Marquis. 157-166 [doi]
• Dynamic Processor Scheduling with Client Resources for Fast Multi-Resolution WWW Image BrowsingDaniel Andresen, Tao Yang, David Watson, Athanassios S. Poulakidas. 167 [doi]
• Performance Analysis and Optimization on a Parallel Atmospheric General Circulation Model CodeJohn Z. Lou, John D. Farrara. 174-180 [doi]
• A Tool for On-line Visualization and Interactive Steering of Parallel HPC ApplicationsSabine Rathmayer. 181-186 [doi]
• Performance Prediction for Complex Parallel ApplicationsJürgen Brehm, Patrick H. Worley. 187-191 [doi]
• Implementation and Results of Hypothesis Testing from the C3I Parallel Benchmark SuiteBrian Van Voorst, Luiz Pires, Rakesh Jha, Mustafa Muhammad. 192-196 [doi]
• Real-Time Parallel MPEG-2 Decoding in SoftwareAngelos Bilas, Jason Fritts, Jaswinder Pal Singh. 197-203 [doi]
• Parallel Inference on a Linguistic Knowledge BaseSanda M. Harabagiu, Dan I. Moldovan. 204 [doi]
• Predicting Queue Times on Space-Sharing Parallel ComputersAllen B. Downey. 209-218 [doi]
• DPF: A Data Parallel Fortran Benchmark SuiteY. Charlie Hu, S. Lennart Johnsson, Dimitris Kehagias, Nadia Shalaby. 219-226 [doi]
• Latency Tolerance: A Metric for Performance Analysis of Multithreaded ArchitecturesShashank S. Nemawarkar, Guang R. Gao. 227-232 [doi]
• Architecture and Performance of the Hitachi SR2201 Massively Parallel Processor SystemHiroaki Fujii, Yoshiko Yasuda, Hideya Akashi, Yasuhiro Inagami, Makoto Koga, Osamu Ishihara, Masamori Kashiyama, Hideo Wada, Tsutomu Sumimoto. 233-241 [doi]
• Experience with Fine-Grain Communication in EM-X Multiprocessor for Parallel Sparse Matrix ComputationMitsuhisa Sato, Yuetsu Kodama, Hirofumi Sakane, Hayato Yamana, Shuichi Sakai, Yoshinori Yamaguchi. 242-248 [doi]
• A Customizable Simulator for Workstation NetworksMustafa Uysal, Anurag Acharya, Robert Bennett, Joel H. Saltz. 249 [doi]
• Empirical Evaluation of Distributed Mutual Exclusion AlgorithmsShiwa S. Fu, Nian-Feng Tzeng, Zhiyuan Li. 255-259 [doi]
• External Adjustment of Runtime Parameters in Time Warp Synchronized Parallel SimulatorsRadharamanan Radhakrishnan, Lantz Moore, Philip A. Wilsey. 260-266 [doi]
• Relative Performance of Preemption-Safe Locking and Non-Blocking Synchronization on Multiprogrammed Shared Memory MultiprocessorsMaged M. Michael, Michael L. Scott. 267-273 [doi]
• A Reliable Hardware Barrier Synchronization SchemeRajeev Sivaram, Craig B. Stunkel, Dhabaleswar K. Panda. 274-280 [doi]
• Analysis of Several Scheduling Algorithms under the Nano-Thread Programming ModelXavier Martorell, Jesús Labarta, Nacho Navarro, Eduard Ayguadé. 281-287 [doi]
• Comparing Gang Scheduling with Dynamic Space Sharing on Symmetric Multiprocessors Using Automatic Self-Allocating Threads (ASAT)Charles Severance, Richard J. Enbody. 288 [doi]
• A Randomized Sorting Algorithm on the BSP modelAlexandros V. Gerbessiotis, Constantinos J. Siniolakis. 293-297 [doi]
• Work-Time Optimal K-Merge Algorithms on the PRAMTatsuya Hayashi, Koji Nakano, Stephan Olariu. 298 [doi]
• Optimizing Parallel Bitonic SortMihai F. Ionescu. 303-309 [doi]
• A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent ComputersJ. Choi. 310-314 [doi]
• Matrix Transpose on Meshes: Theory and PracticeMichael Kaufmann, Ulrich Meyer, Jop F. Sibeyn. 315-319 [doi]
• Coarse Grained Parallel Next Element SearchAlbert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin. 320 [doi]
• Optimal Wormhole Routing in the (n, d)-TorusStefan Bock, Friedhelm Meyer auf der Heide, Christian Scheideler. 326-332 [doi]
• Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh InterconnectionJau-Der Shih. 333-340 [doi]
• A Hybrid Interconnection Network for Integrated Communication ServicesYilong Chen, Jyh-Charn Liu. 341-345 [doi]
• Deadlock-Free Fault-tolerant Routing in the Multi-dimensional Crossbar Network and Its Implementation for the Hitachi SR2201Yoshiko Yasuda, Hiroaki Fujii, Hideya Akashi, Yasuhiro Inagami, Teruo Tanaka, Junji Nakagoshi, Hideo Wada, Tsutomu Sumimoto. 346-352 [doi]
• An Accurate Model for the Performance Analysis of Deterministic Wormhole RoutingBruno Ciciani, Claudio Paolucci, Michele Colajanni. 353 [doi]
• Design and Evaluation of Data Storage and Retrieval Strategies in a Distributed Memory Continuous Media ServerChutimet Srinilta, Divyesh Jadav, Alok N. Choudhary. 360-367 [doi]
• MTIO - A Multi-Threaded Parallel I/O SystemSachin More, Alok N. Choudhary, Ian T. Foster, Ming Q. Xu. 368-373 [doi]
• Low Latency MPI for Meiko CS/2 and ATM ClustersChris R. Jones, Ambuj K. Singh, Divyakant Agrawal. 374-380 [doi]
• Reducing Waiting Costs in User-Level CommunicationStefanos N. Damianakis, Yuqun Chen, Edward W. Felten. 381-387 [doi]
• Design and Implementation of Virtual Memory-Mapped Communication on MyrinetCezary Dubnicki, Angelos Bilas, Kai Li. 388 [doi]
• Designing Efficient Distributed Algorithms Using Sampling TechniquesSanguthevar Rajasekaran, David S. L. Wei. 397-401 [doi]
• Fast Parallel Computation of the Polynomial ShiftEugene V. Zima. 402-406 [doi]
• A Parallel Algorithm for Weighted Distance TransformsAkihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara. 407-412 [doi]
• Parallel Solutions of Indexed Recurrence EquationsGadi Haber, Yosi Ben-Asher. 413-417 [doi]
• Joining Forces in Solving Large-Scale Quadratic Assignment Problems in ParallelAdrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard. 418 [doi]
• Optimization Schemas for Parallel Implementation of Nondeterministic Languages and SystemsGopal Gupta, Enrico Pontelli. 428-435 [doi]
• Logic Channels: A Coordination Approach to Distributed ProgrammingManuel Díaz, Bartolomé Rubio, José M. Troya. 436-442 [doi]
• Time-Stamping Algorithms for Parallelization of Loops at Run-TimeCheng-Zhong Xu, Vipin Chaudhary. 443-450 [doi]
• Interoperability of Data Parallel Runtime LibrariesGuy Edjlali, Alan Sussman, Joel H. Saltz. 451-459 [doi]
• Platform-Independent Runtime Optimizations Using OpenThreadsMatthew Haines, Koen Langendoen. 460 [doi]
• Aurora: Scoped Behavior for Per-Context Optimized Distributed Data SharingPaul Lu. 467-473 [doi]
• Evaluating the Performance of Software Distributed Shared Memory as a Target for Parallelizing CompilersAlan L. Cox, Sandhya Dwarkadas, Honghui Lu, Willy Zwaenepoel. 474-482 [doi]
• View Caching: Efficient Software Shared Memory for Dynamic ComputationsVijay Karamcheti, Andrew A. Chien. 483-489 [doi]
• Enhancing Software DSM for Compiler-Parallelized ApplicationsPeter J. Keleher, Chau-Wen Tseng. 490-499 [doi]
• Relative Performance of Hardware and Software-Only Directory Protocols Under Latency Tolerating and Reducing TechniquesHåkan Grahn, Per Stenström. 500 [doi]
• O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube MulticomputersSajal K. Das, Maria Cristina Pinotti. 507-511 [doi]
• A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack ProblemSmaïl Niar, Arnaud Fréville. 512-516 [doi]
• Lower Bounds on Systolic GossipMichele Flammini, Stephane Perennes. 517-521 [doi]
• Parallel Simulated Annealing: An Adaptive ApproachJonas Knopman, Júlio S. Aude. 522-526 [doi]
• Parallel Global Routing Algorithms for Standard CellsZhaoyun Xing, John A. Chandy, Prithviraj Banerjee. 527 [doi]
• On Privatization of Variables for Data-Parallel ExecutionManish Gupta. 533-541 [doi]
• Semantics and Implementation of a Generalized forall Statement for Parallel LanguagesPaul Dechering, Leo C. Breebaart, Frits Kuijlman, Kees van Reeuwijk, Henk J. Sips. 542-548 [doi]
• A BSP Approach to the Scheduling of Tightly-Nested LoopsRadu Calinescu. 549-553 [doi]
• A Formal Model of Software Pipelining Loops with ConditionsDragan Milicev, Zoran Jovanovic. 554-558 [doi]
• Data Access Reorganizations in Compiling Out-of-Core Data Parallel Programs on Distributed Memory MachinesMahmut T. Kandemir, Rajesh Bordawekar, Alok N. Choudhary. 559 [doi]
• A Hybrid Time Synchronization Implemented Through Special Ring Array for Mesh or TorusYuzhong Sun, Zhiwei Xu, Mingfa Zhu. 565-569 [doi]
• Deadlock- and Livelock-Free Routing Protocols for Wave SwitchingJosé Duato, Pedro López, Sudhakar Yalamanchili. 570-577 [doi]
• Architecture-Dependent Tuning of the Parameterized Communication Model for Optimal MulticastingNatawut Nupairoj, Lionel M. Ni, Ju-Young Lee Park, Hyeong-Ah Choi. 578-582 [doi]
• Crossbar Analysis for Optimal Deadlock Recovery Router ArchitectureYungho Choi, Timothy Mark Pinkston. 583-588 [doi]
• Performance Analysis of Minimal Adaptive Wormhole Routing with Time-Dependent Deadlock RecoveryFabrizio Petrini, Marco Vanneschi. 589 [doi]
• A 2-D Parallel Convex Hull Algorithm with Optimal Communication PhasesJieliang Zhou, Xiaotie Deng, Patrick W. Dymond. 596-602 [doi]
• An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-treesChin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen. 603-607 [doi]
• An Efficient Parallel Algorithm for Solving the Knapsack Problem on the HypercubeAlfredo Goldman, Denis Trystram. 608-615 [doi]
• d-Dimensional Range Search on MulticomputersAfonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda. 616-620 [doi]
• Control Schemes in a Generalized Utility for Parallel Branch-and-Bound AlgorithmsYuji Shinano, Kenichi Harada, Ryuichi Hirabayashi. 621 [doi]
• Alias Analysis for Fortran90 Array SlicesK. Gopinath, R. Seshadri. 628-632 [doi]
• A Compile-Time Partitioning Strategy for Non-Rectangular Loop NestsRizos Sakellariou. 633-637 [doi]
• The Sparse Cyclic Distribution against its Dense CounterpartsGerardo Bandera, Manuel Ujaldon, María A. Trenas, Emilio L. Zapata. 638-642 [doi]
• A Compiler-Directed Cache Coherence Scheme Using Data PrefetchingHock-Beng Lim, Pen-Chung Yew. 643-649 [doi]
• Extensible Message Passing Application Development and Debugging with PythonDavid M. Beazley, Peter S. Lomdahl. 650 [doi]
• Parallel Go with the Winners Algorithms in the LogP ModelMarcus Peinado, Thomas Lengauer. 656-664 [doi]
• A Comparison of Parallel Approaches for Algebraic Factorization in Logic SynthesisSumit Roy, Prithviraj Banerjee. 665-671 [doi]
• Conflict-Free Access to Multiple Single-Ported Register FilesSilvia M. Müller, Uzi Vishkin. 672-678 [doi]
• On the Dynamic Initialization of Parallel ComputersStephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya. 679 [doi]
• The Impact of Timing on Linearizability in Counting NetworksMarios Mavronicolas, Marina Papatriantafilou, Philippas Tsigas. 684-688 [doi]
• A Parallel Priority Data Structure with ApplicationsGerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis. 689-693 [doi]
• Multiple Templates Access of Trees in Parallel Memory SystemsVincenzo Auletta, Amelia De Vivo, Vittorio Scarano. 694-701 [doi]
• Maintaining Spatial Data Sets in Distributed-Memory MachinesSusanne E. Hambrusch, Ashfaq A. Khokhar. 702-707 [doi]
• Geometric Data Structures on a Reconfigurable Mesh, with ApplicationsAmitava Datta. 708 [doi]
• Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus LengthManfred Kunde, Kay Guertzig. 713-720 [doi]
• Oblivious Routing Algorithms on the Mesh of BusesKazuo Iwama, Eiji Miyano. 721-727 [doi]
• Nearly Optimal One-To-Many Parallel Routing in Star NetworksChi-Chang Chen, Jianer Chen. 728-733 [doi]
• Broadcasting and Multicasting in Cut-through Routed NetworksJohanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud. 734-738 [doi]
• Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection ArchitecturesChi-Hsiang Yeh, Behrooz Parhami. 739 [doi]
• SPAX: A New Parallel Processing System for Commercial ApplicationWoo-Jong Hahn, Kee-Wook Rim, Soo-Won Kim. 744-749 [doi]
• Scalability of SCI Workstation Clusters: A Preliminary StudyKnut Omang, Bodo Parady. 750-755 [doi]
• Maximum Delivery Time and Hot Spots in ServerNet(tm) TopologiesDimiter R. Avresky, Vladimir Shurbanov, Robert W. Horst, William J. Watson, L. Young, Doug Jewett. 756-762 [doi]