Table of Contents

• The Characterization of Data-Accumulating AlgorithmsStefan D. Bruda, Selim G. Akl. 2-6 [doi]
• Prefix Computations on Symmetric MultiprocessorsDavid R. Helman, Joseph JáJá. 7-13 [doi]
• Reducing I/O Complexity by Simulating Coarse Grained Parallel AlgorithmsFrank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich. 14-20 [doi]
• Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree AlgorithmsHettihe P. Dharmasena, Ramachandran Vaidyanathan. 21-25 [doi]
• A Time-Optimal Solution for the Path Cover Problem on CographsKoji Nakano, Stephan Olariu, Albert Y. Zomaya. 26-30 [doi]
• Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus SystemKeqin Li, Victor Y. Pan. 31 [doi]
• Improving Collective I/O Performance Using ThreadsPhillip M. Dickens, Rajeev Thakur. 38-45 [doi]
• Linear Aggressive Prefetching: A Way to Increase the Performance of Cooperative CachesToni Cortes, Jesús Labarta. 46-54 [doi]
• Hiding Communication Latency in Reconfigurable Message-Passing EnvironmentsAhmad Afsahi, Nikitas J. Dimopoulos. 55-60 [doi]
• The Impact of Memory Hierarchies on Cluster ComputingXing Du, Xiaodong Zhang. 61-69 [doi]
• A Factorial Performance Evaluation for Hierarchical Memory SystemsXian-He Sun, Dongmei He, Kirk W. Cameron, Yong Luo. 70-74 [doi]
• A Performance Model of Speculative Prefetching in Distributed Information SystemsNor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh. 75-80 [doi]
• Run-Time Selection of Block Size in Pipelined Parallel ProgramsDavid K. Lowenthal, Michael James. 82-87 [doi]
• Reducing Parallel Overheads Through Dynamic SerializationMichael Voss, Rudolf Eigenmann. 88-92 [doi]
• Using Channels for Multimedia CommunicationDavid May, Henk L. Muller. 93-98 [doi]
• The Paderborn University BSP (PUB) Library - Design, Implementation and PerformanceOlaf Bonorden, Ben H. H. Juurlink, Ingo von Otte, Ingo Rieping. 99-104 [doi]
• A Capabilities Based Communication Model for High-Performance Distributed Applications: The Open HPC++ ApproachShridhar Diwan, Dennis Gannon. 105 [doi]
• Average-Case Analysis of Isospeed Scalability of Parallel Computations on MultiprocessorsKeqin Li, Xian-He Sun. 112-116 [doi]
• Fully-Scalable Fault-Tolerant Simulations for BSP and CGMSung-Ryul Kim, Kunsoo Park. 117-124 [doi]
• Coarse Grained Parallel Maximum Matching In Convex Bipartite GraphsProsenjit Bose, Albert Chan, Frank K. H. A. Dehne, Markus Latzel. 125-129 [doi]
• Experimental Evaluation of QSM, a Simple Shared-Memory ModelBrian Grayson, Michael Dahlin, Vijaya Ramachandran. 130 [doi]
• A Consistent History Link Connectivity ProtocolPaul S. LeMahieu, Jehoshua Bruck. 138-142 [doi]
• Performance Evaluation of the ServerNet R SAN under Self-Similar TrafficDimiter R. Avresky, Vladimir Shurbanov, Robert W. Horst, Pankaj Mehra. 143-147 [doi]
• Low-Latency Message Passing on Workstation Clusters using SCRAMNetVijay Moorthy, Matthew G. Jacunski, Manoj Pillai, Peter P. Ware, Dhabaleswar K. Panda, Thomas W. Page Jr., P. Sadayappan, V. Nagarajan, Johns Daniel. 148-152 [doi]
• Cashmere-VLM: Remote Memory Paging for Software Distributed Shared MemorySandhya Dwarkadas, Robert Stets, Nikos Hardavellas, Leonidas I. Kontothanassis, Rishiyur S. Nikhil. 153-159 [doi]
• The Computational Co-op: Gathering Clusters into a MetacomputerWalfredo Cirne, Keith Marzullo. 160-166 [doi]
• Reducing System Overheads in Home-based Software DSMsWeiwu Hu, Weisong Shi, Zhimin Tang. 167 [doi]
• Exploiting Global Structure for Performance on ClustersStephen R. Donaldson, Jonathan M. D. Hill, David B. Skillicorn. 176-182 [doi]
• Implementing Efficient MPI on LAPI for IBM RS/6000 SP Systems: Experiences and Performance EvaluationMohammad Banikazemi, Rama Govindaraju, Robert Blackmore, Dhabaleswar K. Panda. 183-190 [doi]
• PM-PVM: A Portable Multithreaded PVMClaudio M. P. Santos, Júlio S. Aude. 191-195 [doi]
• tmPVM - Task Migratable PVMC. P. Tan, Weng-Fai Wong, Chung-Kwong Yuen. 196-202 [doi]
• Ubiquitous Message Passing Interface Implementation in Java: jmpiKivanc Dincer. 203 [doi]
• On-Demand Multicast Routing Scheme and its AlgorithmsTe-Chou Su, Jia-Shung Wang. 212-217 [doi]
• Fault-Tolerant Routing Algorithms for Hypercube NetworksKeiichi Kaneko, Hideo Ito. 218-224 [doi]
• Dynamic Interval Routing on Asynchronous RingsDanny Krizanc, Flaminia L. Luccio, Rajeev Raman. 225-232 [doi]
• Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical BusesJerry L. Trahan, Anu G. Bourgeois, Ramachandran Vaidyanathan, Yi Pan. 233 [doi]
• A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOWEnvironmentJosé Duato, Antonio Robles, Federico Silla, Ramón Beivide. 240-247 [doi]
• Dynamically Scheduling the Trace Produced During Program Execution into VLIW InstructionsAlberto Ferreira de Souza, Peter Rounce. 248-257 [doi]
• Segment Directory Enhancing the Limited Directory Cache Coherence SchemesJong Hyuk Choi, Kyu Ho Park. 258-267 [doi]
• Shuffle Memory SystemKichul Kim. 268-272 [doi]
• An Efficient VLSI Architecture Parallel Prefix Counting With Domino LogicRong Lin, Koji Nakano, Stephan Olariu, Albert Y. Zomaya. 273 [doi]
• The Performance of Coordinated and Independent CheckpointingLuís Moura Silva, João Gabriel Silva. 280-284 [doi]
• Automatic Array Alignment in Parallel Matlab ScriptsIgor Z. Milosavljevic, Marwan A. Jabri. 285-289 [doi]
• Parallel Program ArchetypesBerna L. Massingill, K. Mani Chandy. 290-296 [doi]
• Distributed, Scalable, Dependable Real-Time Systems: Middleware Services and ApplicationsLonnie R. Welch, Binoy Ravindran, Paul V. Werme, Michael W. Masters, Behrooz Shirazi, Prashant A. Shirolkar, Robert D. Harrison, D. Wayne Mills, Tuy Do, Judy Lafratta, Shafqat Anwar, Steve Sharp, Terry Sergeant, George Bilowus, Mark Swick, Jim Hoppel, Joseph M. Caruso. 297-301 [doi]
• OpenMP for Networks of SMPsY. Charlie Hu, Honghui Lu, Alan L. Cox, Willy Zwaenepoel. 302 [doi]
• Oblivious Deadlock-Free Routing in a Faulty HypercubeJin Suk Kim, Eric Lehman, Frank Thomson Leighton. 312-319 [doi]
• Sparse Hypercube: A Minimal k-Line Broadcast GraphSatoshi Fujita, Arthur M. Farley. 320-324 [doi]
• All-to-All Broadcast on Switch-Based Clusters of WorkstationsMatthew G. Jacunski, P. Sadayappan, Dhabaleswar K. Panda. 325-329 [doi]
• VBMAR: Virtual Network Load Balanced Minimal Adaptive RoutingXicheng Liu, Timothy J. Li, Wen Gao. 330 [doi]
• Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid ApplicationsRupak Biswas, Leonid Oliker, Sajal K. Das, Daniel J. Harvey. 338-342 [doi]
• A Parallel Algorithm for Singular Value Decomposition as Applied to Failure Tolerant ManipulatorsTracy D. Braun, Anthony A. Maciejewski, Howard Jay Siegel. 343-349 [doi]
• A Parallel Adaptive version of the Block-based Gauss-Jordan AlgorithmNordine Melab, El-Ghazali Talbi, Serge G. Petiton. 350-354 [doi]
• Sparse Matrix Block-Cyclic RedistributionGerardo Bandera, Emilio L. Zapata. 355-359 [doi]
• A New Approach to Parallel Dynamic Partitioning for Adaptive Unstructured MeshesGerd Heber, Guang R. Gao, Rupak Biswas. 360-364 [doi]
• An Object-Oriented Environment for Sparse Parallel Computation on Adaptive GridsSalvatore Filippone, Michele Colajanni, Dario Pascucci. 365 [doi]
• A Network Status Predictor to Support Dynamic Scheduling in Network-Based Computing SystemsJunSeong Kim, David J. Lilja. 372-378 [doi]
• Performance Evaluation of an Infrastructure for Worldwide Parallel ComputingThomas T. Kwan, Daniel A. Reed. 379-386 [doi]
• BRISK: A Portable and Flexible Distributed Instrumentation SystemAleksandar M. Bakic, Matt W. Mutka, Diane T. Rover. 387-391 [doi]
• An Efficient Logging Algorithm for Incremental Replay of MessageFranco Zambonelli. 392-398 [doi]
• Lazy Logging and Prefetch-Based Crash Recovery in Software Distributed Shared Memory SystemsAngkul Kongmunvattana, Nian-Feng Tzeng. 399-406 [doi]
• Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel ThreadsMagnus Broberg, Lars Lundberg, Håkan Grahn. 407 [doi]
• Delivering On Standards, Balancing Portability and PerformanceJohn Robinson. 416 [doi]
• Better Deterministic Routing on MeshesJop F. Sibeyn. 420-425 [doi]
• Efficient Parallel Algorithms for Selection and Multiselection on Mesh-Connected ComputersHong Shen. 426-430 [doi]
• Constant-Time Algorithm for Medial Axis Transform on the Reconfigurable MeshAmitava Datta. 431-435 [doi]
• 2.5n-Step Sorting on n*n Meshes in the Presence of o(sqrt(n)) Worst-Case FaultsChi-Hsiang Yeh, Behrooz Parhami, Hua Lee, Emmanouel A. Varvarigos. 436-440 [doi]
• The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical NetworksChi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varvarigos. 441 [doi]
• Multi-Threaded Design and Implementation of Parallel Pipelined STAP on Parallel Computers with SMP NodesWei-keng Liao, Alok N. Choudhary, Donald Weiner, Pramod K. Varshney. 448-452 [doi]
• A Parallel Phoneme Recognition Algorithm Based on Continuous Hidden Markov ModelSang-Hwa Chung, Min-Uk Park, Hyung Soon Kim. 453-457 [doi]
• Load Adaptive Algorithms and Implementations for the 2D Discrete Wavelet Transform on Fine-Grain Multithreaded ArchitecturesAshfaq A. Khokhar, Gerd Heber, Parimala Thulasiraman, Guang R. Gao. 458-462 [doi]
• Application of Parallel Processors to Real-Time Sensor Array ProcessingDavid R. Martinez. 463-469 [doi]
• Mapping Media Streams onto a Network of ServersReinhard Lüling. 470-476 [doi]
• A Systolic Algorithm to Process Compressed Binary ImagesFikret Erçal, Mark Allen, Hao Feng. 477 [doi]
• Optimizations for Language-Directed Computational SteeringJeffrey S. Vetter, Karsten Schwan. 486-491 [doi]
• Optimization Rules for Programming with Collective OperationsSergei Gorlatch, Christoph Wedler, Christian Lengauer. 492-499 [doi]
• A Flexible Clustering and Scheduling Scheme for Efficient Parallel ComputationS. Chingchit, Mohan Kumar, Laxmi N. Bhuyan. 500-505 [doi]
• Mechanisms for Just-in-Time Allocation of Resources to Adaptive Parallel ProgramsArash Baratloo, Ayal Itzkovitz, Zvi M. Kedem, Yuanyuan Zhao. 506-512 [doi]
• Supporting Priorities and Improving Utilization of the IBM SP Scheduler Using Slack-Based BackfillingDavid Talby, Dror G. Feitelson. 513 [doi]
• Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed OutputArnold L. Rosenberg. 520-524 [doi]
• LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory SystemsAndrei Radulescu, Arjan J. C. van Gemund, Hai Xiang Lin. 525-530 [doi]
• Parallel Load Balancing for Problems with Good BisectorsStefan Bischof, Ralf Ebner, Thomas Erlebach. 531-538 [doi]
• Asynchronous Group Mutual Exclusion in Ring NetworksKuen-Pin Wu, Yuh-Jzer Joung. 539-543 [doi]
• Randomized Initialization Protocols for Packet Radio NetworksTatsuya Hayashi, Koji Nakano, Stephan Olariu. 544 [doi]
• An Optimal Disk Allocation Strategy for Partial Match Queries on Non-Uniform Cartesian Product FilesSajal K. Das, Maria Cristina Pinotti. 550-554 [doi]
• Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification TreesMahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka. 555-562 [doi]
• P-EDR: An Algorithm for Parallel Implementation of Parzen Density Estimation from Uncertain ObservationsPedro E. López-de-Teruel, José M. García, Manuel E. Acacio, Óscar Cánovas Reverte. 563-568 [doi]
• A Fast Multithreaded Out-of-Core Visualization TechniquePeter Sulatycke, Kanad Ghose. 569-575 [doi]
• Design and Implementation of a Scalable Parallel System for Multidimensional Analysis and OLAPSanjay Goil, Alok N. Choudhary. 576-581 [doi]
• Infrastructure for Building Parallel Database Systems for Multi-Dimensional DataChialin Chang, Renato Ferreira, Alan Sussman, Joel H. Saltz. 582 [doi]
• A New Memory-Saving Technique to Map System of Affine Recurrence Equations (SARE) onto Distributed Memory SystemsAlessandro Marongiu, Paolo Palazzari, C. Casaccia. 590-596 [doi]
• A Novel Compilation Framework for Supporting Semi-Regular Distributions in Hybrid ApplicationsDhruva R. Chakrabarti, Prithviraj Banerjee. 597-602 [doi]
• Compiler Analysis to Support Compiled Communication for HPF-Like ProgramsXin Yuan, Rajiv Gupta, Rami G. Melhem. 603-608 [doi]
• PARADIGM (version 2.0): A New HPF Compilation SystemPramod G. Joisha, Prithviraj Banerjee. 609-615 [doi]
• Marshaling/Demarshaling as a Compilation/Interpretation ProcessChristian Queinnec. 616 [doi]
• IP Validation for FPGAs using Hardware Object Technology:::TM:::Steve Casselman, John Schewel, Christophe Beaumont. 624 [doi]
• Parallel Algorithms for 3D Reconstruction of Asymmetric Objects from Electron MicrographsRobert E. Lynch, Dan C. Marinescu, Hong Lin, Timothy S. Baker. 632-637 [doi]
• Large Scale Simulation of Parallel Molecular DynamicsPierre-Eric Bernard, Thierry Gautier, Denis Trystram. 638-644 [doi]
• A Parallel Algorithm for Bound-SmoothingKumar Rajan, Narsingh Deo. 645-652 [doi]
• Parallel Biological Sequence Comparison Using Prefix ComputationsSrinivas Aluru, Natsuhiko Futamura, Kishan Mehrotra. 653-659 [doi]
• Large Scale Simulation of Particulate FlowsAhmed H. Sameh, Vivek Sarin. 660 [doi]
• EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed SystemsMaurizio A. Bonuccelli, M. Claudia Clò. 668-677 [doi]
• A Robust Adaptive Metric for Deadline Assignment in Heterogeneous Distributed Real-Time SystemsJan Jonsson. 678-687 [doi]
• A Communication Latency Hiding Parallelization of a Traffic Flow SimulationCharles Michael Johnston, Anthony T. Chronopoulos. 688-695 [doi]
• Relaxing Causal Constraints in PDESNarayanan V. Thondugulam, Dhananjai Madhava Rao, Radharamanan Radhakrishnan, Philip A. Wilsey. 696-700 [doi]
• Rate of Change Load Balancing in Distributed and Parallel SystemsLuis Miguel Campos, Isaac D. Scherson. 701-707 [doi]
• An Efficient Dynamic Load Balancing using the Dimension Exchange Method for Balancing of Quantized Loads on Hypercube MultiprocessorsHwakyung Rim, Ju-wook Jang, Sung-Chun Kim. 708 [doi]
• Cascaded Execution: Speeding Up Unparallelized Execution on Shared-Memory MultiprocessorsRuth E. Anderson, Thu D. Nguyen, John Zahorjan. 714-719 [doi]
• COWL: Copy-On-Write for Logic ProgramsVítor Santos Costa. 720-727 [doi]
• Dynamic Grain-Size Adaptation on Object Oriented Parallel Programming The SCOOPP ApproachJoão Luís Sobral, Alberto José Proença. 728-732 [doi]
• Implementation of a Virtual Time Synchronizer for Distributed DatabasesAzzedine Boukerche, Sajal K. Das, Ajoy Kumar Datta, Timothy E. LeMaster. 733-737 [doi]
• A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data LocalityMahmut T. Kandemir, Alok N. Choudhary, J. Ramanujam, Prithviraj Banerjee. 738-743 [doi]
• Hyperplane Partitioning: An Approach to Global Data Partitioning for Distributed Memory MachinesS. R. Prakash, Y. N. Srikant. 744 [doi]
• Exploiting Application Tunability for Efficient, Predictable Parallel Resource ManagementFangzhe Chang, Vijay Karamcheti, Zvi M. Kedem. 749 [doi]