Table of Contents

• Dynamic Reconfiguration of a PMMLA for High-Throughput ApplicationsGautam Ghare, Soo-Young Lee. 1-6
• Nearly Optimal Algorithms for Broadcast on d-Dimensional All-Port and Wormhole-Routed TorusJyh-Jong Tsay, Wen-Tsong Wang. 2-9 [doi]
• Virtual FPGAs: Some Steps Behind the Physical BarriersWilliam Fornaciari, Vincenzo Piuri. 7-12
• Minimizing Total Communication Distance of Time-Step Optimal Broadcast in Mesh NetworksSongluan Cang, Jie Wu. 10-17 [doi]
• A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor ArrayPierpaolo Baglietto, Massimo Maresca, Mauro Migliardi. 13-18
• Hiding Communication Latency in Data Parallel ApplicationsVivek Garg, David E. Schimmel. 18-23 [doi]
• A Performance Modeling and Analysis Environment for Reconfigurable ComputersJeffrey Walrath, Ranga Vemuri. 19-24
• Protocols for Non-Deterministic Communication over Synchronous ChannelsErik D. Demaine. 24-30 [doi]
• Runtime Reconfigurable RoutingGordon J. Brebner, Adam Donlin. 25-30
• Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few ChannelsKoji Nakano, Stephan Olariu, James L. Schwing. 31-35 [doi]
• An Integrated Partitioning and Synthesis System for Dynamically Reconfigurable Multi-FPGA ArchitecturesIyad Ouaiss, Sriram Govindarajan, Vinoo Srinivasan, Meenakshi Kaul, Ranga Vemuri. 31-36
• Optimal All-to-Some Personalized Communication on HypercubesY. Charlie Hu. 36-40 [doi]
• Temporal Partitioning for Partially-Reconfigurable-Field-Programmable GateJohn Spillane, Henry L. Owen. 37-42
• Compiler-Optimization of Implicit Reductions for Distributed Memory MultiprocessorsBo Lu, John M. Mellor-Crummey. 42-51 [doi]
• A Java Development and Runtime Environment for Reconfigurable ComputingDon Davis, Michael Barr, Toby Bennett, Stephen Edwards, Jonathan Harris, Ian Miller, Chris Schanck. 43-48
• Synthesizing Reconfigurable Sequential Machines Using Tabular ModelsKamlesh Rath, Jian Li. 49-54
• Local Enumeration Techniques for Sparse AlgorithmsGerardo Bandera, Pablo P. Trabado, Emilio L. Zapata. 52-56 [doi]
• Evaluation of a Low-Power Reconfigurable DSP ArchitectureArthur Abnous, Katsunori Seno, Yuji Ichikawa, Marlene Wan, Jan M. Rabaey. 55-60
• Optimizing Data Scheduling on Processor-in-Memory ArraysYi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapornchai, Peter M. Kogge. 57-61 [doi]
• A Reconfigurable Hardware-Monitor for Communication Analysis in Distributed Real-Time SystemsAndreas Kirschbaum, Jürgen Becker, Manfred Glesner. 61-66
• An Expression-Rewriting Framework to Generic Communication Sets for HPF Programs with Block-Cyclic DistributionGwan-Hwan Hwang, Jenq Kuen Lee. 62-68 [doi]
• On Reconfigurable Co-processing UnitsReiner W. Hartenstein, Michael Herz, Thomas Hoffmann, Ulrich Nageldinger. 67-72
• A Generalized Framework for Global Communication OptimizationMahmut T. Kandemir, Prithviraj Banerjee, Alok N. Choudhary, J. Ramanujam, U. Nagaraj Shenoy. 69-73 [doi]
• A Mathematical Benefit Analysis of Context Switching Reconfigurable ComputingStephen M. Scalera, John J. Murray, Steve Lease. 73-78
• Evaluation of Compiler and Runtime Library Approaches for Supporting Parallel Regular ApplicationsDhruva R. Chakrabarti, Prithviraj Banerjee, Antonio Lain. 74-79 [doi]
• A Configurable Computing Approach Towards Real-Time Target TrackingBharadwaj Pudipeddi, A. Lynn Abbott, Peter M. Athanas. 79-84
• Preliminary Results from a Parallel MATLAB CompilerMichael J. Quinn, Alexey G. Malishevsky, Nagajagadeswar Seelam, Yan Zhao. 81-87 [doi]
• HOSMII: A Virtual Hardware Integrated with DRAMYuichiro Shibata, Hidenori Miyazaki, Xiao-ping Ling, Hideharu Amano. 85-90
• Jacobi Orderings for Multi-Port HypercubesDolors Royo, Antonio González, Miguel Valero-García. 88-97 [doi]
• Hardware Reconfigurable Neural NetworksJean-Luc Beuchat, Jacques-Olivier Haenni, Eduardo Sanchez. 91-98
• Automatic Differentiation for Message-Passing Parallel ProgramsPaul D. Hovland, Christian H. Bischof. 98-104 [doi]
• A Simulator for the Reconfigurable Mesh ArchitectureCarsten Steckel, Martin Middendorf, Hossam A. ElGindy, Hartmut Schmeck. 99-104
• PACE: Processor Architectures for Circuit EmulationReiner Kolla, Oliver Springauf. 105-110
• Processor Lower Bound Formulas for Array Computations and Parametric Diophantine SystemsPeter R. Cappello, Ömer Egecioglu. 105-109 [doi]
• A Flexible Class of Parallel Matrix Multiplication AlgorithmsJohn A. Gunnels, Calvin Lin, Greg Morrow, Robert A. van de Geijn. 110-116 [doi]
• Multiparadigm, Multilingual Interoperability: Experience with ConverseLaxmikant V. Kalé, Milind A. Bhandarkar, Robert Brunner, Josh Yelon. 111-122
• Caching-Efficient Multithreaded Fast Multiplication of Sparse MatricesPeter Sulatycke, Kanad Ghose. 117-123 [doi]
• An Empirical Comparison of Runtime Systems for Conservative Parallel SimulationChu-Cheow Lim, Yoke-Hean Low, Wentong Cai, Wen-Jing Hsu, Shell-Ying Huang, Stephen John Turner. 123-134
• Permutation Capability of Optical Multistage Interconnect NetworksYuanyuan Yang, Jianchao Wang, Yi Pan. 125-133 [doi]
• HIPIQS: A High-Performance Switch Architecture Using Input QueuingRajeev Sivaram, Craig B. Stunkel, Dhabaleswar K. Panda. 134-143 [doi]
• Synchronizing Operations on Multiple ObjectsTim Rühl, Henri E. Bal. 135-146
• On the Bisection Width and Expansion of Butterfly NetworksClaudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar. 144-150 [doi]
• Runtime Support for Virtual BSP ComputerMohan V. Nibhanupudi, Boleslaw K. Szymanski. 147-158
• Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed ControlDavid Coudert, Afonso Ferreira, Xavier Muñoz. 151-155 [doi]
• Distributed Dynamic Control of Circuit-Switched Banyan NetworksCharles A. Salisbury, Rami G. Melhem. 156-161 [doi]
• Migration and Rollback Transparency for Arbitrary Distributed Applications in Workstation ClustersStefan Petri, Matthias Bolz, Horst Langendörfer. 159-170
• A Case for Aggregate NetworksRaymond Hoare, Henry G. Dietz. 162-166 [doi]
• An Enhanced Co-Scheduling Method Using Reduced MS-State DiagramsRamaswamy Govindarajan, N. S. S. Narasimha Rao, Erik R. Altman, Guang R. Gao. 168-175 [doi]
• Network-Aware Distributed Computing: A Case StudyHongsuda Tangmunarunkit, Peter Steenkiste. 171-182
• Predicated Software Pipelining Technique for Loops with ConditionsDragan Milicev, Zoran Jovanovic. 176-180 [doi]
• The Generalized Lambda TestWeng-Long Chang, Chih-Ping Chu, Jesse Wu. 181-186 [doi]
• Efficient Runtime Thread Management for the Nano-Threads Programming ModelDimitrios S. Nikolopoulos, Eleftherios D. Polychronopoulos, Theodore S. Papatheodorou. 183-194
• Experimental Study of Compiler Techniques for NUMA MachinesYunheung Paek, David A. Padua. 187-193 [doi]
• Register-Sensitive Software PipeliningAmod K. Dani, V. Janaki Ramanan, Ramaswamy Govindarajan. 194-198 [doi]
• A Topology Based Approach to Coordinated Multicast OperationsJörg Nolte. 195-206
• Analyzing the Individual/Combined Effects of Speculative and Guarded Execution on a Superscalar ArchitectureM. Srinivas, Alexandru Nicolau. 199-208 [doi]
• Computing with Evolving ProteinsJosé Luis Fernández-Villacañas Martín, J. M. Fatah, S. Amin. 207-215
• NOW Parallel Reconstruction of Functional ImagesFrank Munz, T. Stephan, Ursula Maier, Thomas Ludwig 0002, Arndt Bode, Sibylle Ziegler, Stephan G. Nekolla, P. Bartenstein, Markus Schwaiger. 210-214 [doi]
• An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for TerrainsNeelima Gupta, Sandeep Sen. 215-219 [doi]
• A Parallel Evolutionary Algorithm for the Vehicle Routing Problem with Heterogeneous FleetLuiz Satoru Ochi, Dalessandro Soares Vianna, Lúcia Maria de A. Drummond, André O. Victor. 216-224
• Design, Implementation and Evaluation of Parallel Pipelined STAP on Parallel ComputersAlok N. Choudhary, Wei-keng Liao, Donald Weiner, Pramod K. Varshney, Richard W. Linderman, Mark H. Linderman. 220-225 [doi]
• Locality Optimization for Program InstancesClaudia Leopold. 225-233
• The VEGA Moderately Parallel MIMD, Moderately Parallel SIMD, Architectures for High Performance Array Signal ProcessingMikael Taveniku, Anders Ahlander, Magnus Jonsson, Bertil Svensson. 226-232 [doi]
• Medical Image Processing and Visualization on Heterogeneous Clusters of Symmetric Multiprocessors Using MPI and POSIX ThreadsChristoph Giess, Achim Mayer, Harald Evers, Hans-Peter Meinzer. 233-237 [doi]
• Artificial Neural Networks on Reconfigurable MeshesJing-Fu Fu Jenq, Wing Ning Li. 234-242
• A Quantitative Code Analysis of Scientific Systolic Programs: DSP vs. Matrix AlgorithmsR. Sernec, M. Zajc, Jurij F. Tasic. 238-242 [doi]
• A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective IntelligenceTadeusz Szuba. 243-251
• Tree-Based Multicasting in Wormhole-Routed Irregular TopologiesRan Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan. 244-249 [doi]
• NoWait-RPC: Extending ONC RPC to a Fully Compatible Message Passing SystemThomas Hopfner, Franz Fischer, Georg Färber. 250-254 [doi]
• Replicated Shared Object Model for Edge Detection with Spiral ArchitectureXiangjian He, Tom Hintz, Ury Szewcow. 252-260
• Efficient Barrier Synchronization Mechanism for BSP Model on Message Passing ArchitecturesJin-Soo Kim, Soonhoi Ha, Chu Shik Jhon. 255-259 [doi]
• Performance and Experience with LAPI - a New High-Performance Communication Library for the IBM RS/6000 SPGautam Shah, Jarek Nieplocha, Jamshed H. Mirza, Chulho Kim, Robert J. Harrison, Rama Govindaraju, Kevin J. Gildea, Paul DiNicola, Carl A. Bender. 260-266 [doi]
• Scheduling Tasks of a Parallel Program in Two-Processor Systems with Use of Cellular AutomataFranciszek Seredynski. 261-269
• Total Exchange on k-ary n-cubes with Adaptive RoutingFabrizio Petrini. 267-271 [doi]
• Evolving Processes and Evolution Schedulers for Concurrent Scheduling Controls and Parallel Evolutionary ComputationTzilla Elrad, Jinlong Lin. 270-278
• Managing Concurrent Access for Shared Memory Active MessagesSteven Lumetta, David E. Culler. 272-278 [doi]
• An Evolutionary Approach to Multiprocessor Scheduling of Dependent TasksRoman Nossal. 279-287
• Design and Implementation of a Parallel I/O Runtime System for Irregular ApplicationsJaechun No, Sung Soon Park, Jesús Carretero, Alok N. Choudhary, Pang Chen. 280-284 [doi]
• Using PI/OT to Support Complex Parallel I/OIan Parsons, Jonathan Schaeffer, Duane Szafron, Ronald C. Unrau. 285-291 [doi]
• Multiprocessor Scheduling Using Mean-Field AnnealingShaharuddin Salleh, Albert Y. Zomaya. 288-296
• Code Transformations for Low Power Caching in Embedded Multimedia ProcessorsChidamber Kulkarni, Francky Catthoor, Hugo De Man. 292-297 [doi]
• Using the BSP Cost Model to Optimise Parallel Neural Network TrainingR. O. Rogers, David B. Skillicorn. 297-305
• Memory Hierarchy Management for Iterative Graph StructuresIbraheem Al-Furaih, Sanjay Ranka. 298-302 [doi]
• High-Performance External Computations Using User-Controllable I/OJang Sun Lee, Sung Hoon Ko, Sanjay Ranka, Byung Eui Min. 303-307 [doi]
• A Fault-Tolerant Parallel Heuristic for Assignment ProblemsEl-Ghazali Talbi, Jean-Marc Geib, Z. Hafidi, Djemai Kebbal. 306-314
• Pin-Down Cache: A Virtual Memory Management Technique for Zero-Copy CommunicationHiroshi Tezuka, Francis O Carroll, Atsushi Hori, Yutaka Ishikawa. 308-314 [doi]
• Meta-heuristics for Circuit Partitioning in Parallel Test GenerationConsolación Gil, Julio Ortega, Antonio F. Díaz, Maria Dolores Gil Montoya. 315-323
• Synthesis of a Systolic Array Genetic AlgorithmGraham M. Megson, I. M. Bland. 316-320 [doi]
• Vector Prefix and Reduction Computation on Coarse-Grained, Distributed-Memory Parallel MachinesSeungjo Bae, Dongmin Kim, Sanjay Ranka. 321-325 [doi]
• A Survey of Randomness and Parallelism in Comparison ProblemsDanny Krizanc. 324-329
• Solving the Maximum Clique Problem Using PUBBYuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuichi Hirabayashi. 326-332 [doi]
• Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling TechniquesDavid Hsu, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani. 330-340
• A Scalable VLSI Architecture for Binary Prefix SumsRong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya. 333-337 [doi]
• Emulating Direct Products by Index-Shuffle GraphsBojana Obrenic. 338-344 [doi]
• Optimal Bounds on Tail Probabilities - A Simplified ApproachAviad Cohen, Yuri Rabinovich, Assaf Schuster, Hadas Shachnai. 341-350
• A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman ProblemLee Wang, Anthony A. Maciejewski, Howard Jay Siegel, Vwani P. Roychowdhury. 345-349 [doi]
• A New Self-Routing Multicast NetworkYuanyuan Yang, Jianchao Wang. 351-357 [doi]
• Random Sampling Techniques in Parallel ComputationRajeev Raman. 351-360
• Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of WorkstationsRan Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan. 358-364 [doi]
• Randomization in Parallel StringologyS. Muthukrishnan. 361-362
• Randomized Parallel Prefetching and Buffer ManagementPeter J. Varman. 363-372
• Multicasting and Broadcasting in Large WDM NetworksWeifa Liang, Hong Shen. 365-369 [doi]
• Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree NetworkShan-Chyun Ku, Biing-Feng Wang. 370-374 [doi]
• Parallel Algorithms for Finite Automata ProblemsBala Ravikumar. 373
• Randomized Routing and PRAM Emulation on Parallel MachinesDavid S. L. Wei. 374-383
• Deterministic Routing of h-relations on the MultibutterflyAndrea Pietracaprina. 375-379 [doi]
• An Efficient Counting NetworkCostas Busch, Marios Mavronicolas. 380-384 [doi]
• On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection NetworksTorsten Suel. 384-386
• Partitioned Schedules for Clustered VLIW ArchitecturesMarcio Merino Fernandes, Josep Llosa, Nigel P. Topham. 386-391 [doi]
• High Performance Linear Algebra Package LAPACK90Jack Dongarra, Jerzy Wasniewski. 387-391
• Dynamic Processor Allocation with the Solaris Operating SystemKelvin K. Yue, David J. Lilja. 392-397 [doi]
• Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense GraphsAnders Dessmark, Carsten Dorgerloh, Andrzej Lingas, Juergen Wirtgen. 392-399
• Thread-Based vs Event-Based Implementation of a Group Communication ServiceShivakant Mishra, Rongguang Yang. 398-402 [doi]
• Parallel Randomized Techniques for Some Fundamental Geometric Problems: A SurveySuneeta Ramaswami. 400-407
• Performance Sensitivity of Space Sharing Processor Scheduling in Distributed-Memory MulticomputersSivarama P. Dandamudi, Hai Yu. 403-409 [doi]
• Randomized Algorithms on the MeshLata Narayanan. 408-417
• Efficient Fine-Grain Thread Migration with Active ThreadsBoris Weissman, Benedict Gomes, Jürgen Quittek, Michael Holtkamp. 410-414 [doi]
• Clustering and Reassignment-Based Mapping Strategy for Message Passing ArchitecturesMiquel A. Senar, Ana Ripoll, Ana Cortés, Emilio Luque. 415-421 [doi]
• Implementing Parallelism in Random Discrete Event-Driven SimulationMarc Bumble, Lee D. Coraor. 418-427
• Asymptotically Optimal Randomized Tree Embedding in Static NetworksKeqin Li. 423-430 [doi]
• Reconfigurable Wormhole Networks: A Realistic ApproachJosé L. Sánchez, José M. García, Francisco José Alfaro. 428-437
• Resource Placement in 2D ToriBader Almohammad, Bella Bose. 431-438 [doi]
• Scheduling with Communication Delays and Data Routing in Message Passing ArchitecturesAziz Moukrim, Alain Quilliot. 438-451
• An O((log log n):::2:::) Time Convex Hull Algorithm on Reconfigurable MeshesTatsuya Hayashi, Koji Nakano, Stephan Olariu. 439-446 [doi]
• Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory SystemsVincenzo Auletta, Sajal K. Das, Amelia De Vivo, Maria Cristina Pinotti, Vittorio Scarano. 447-454 [doi]
• Parallel Optimisation in the SCOOP LibraryPer Kristian Nilsen, Nicolas Prcovic. 452-463
• Sharing Random Bits with No Process CoordinationMarius Zimand. 455-459 [doi]
• Lower Bounds on Communication Loads and Optimal Placements in Torus NetworksM. Cemil Azizoglu, Ömer Egecioglu. 460-464 [doi]
• NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest PathsSven Venema, Hong Shen, Francis Suraweera. 464-471
• Impact of Switch Design on the Application Performance of Cache-Coherent MultiprocessorsLaxmi N. Bhuyan, Hu-Jun Wang, Ravi R. Iyer, Akhilesh Kumar. 466-474 [doi]
• BIP: A New Protocol Designed for High Performance Networking on MyrinetLoïc Prylli, Bernard Tourancheau. 472-485
• Parallel Tree Building on a Range of Shared Address Space Multiprocessors: Algorithms and Application PerformanceHongzhang Shan, Jaswinder Pal Singh. 475-484 [doi]
• Configuration Independent Analysis for Characterizing Shared-Memory ApplicationsGheith A. Abandah, Edward S. Davidson. 485-491 [doi]
• COMPaS: A Pentium Pro PC-based SMP Cluster and Its ExperienceYoshio Tanaka, Motohiko Matsuda, Makoto Ando, Kazuto Kubota, Mitsuhisa Sato. 486-497
• Experimental Validation of Parallel Computation Models on the Intel ParagonBen H. H. Juurlink. 492-497 [doi]
• PULC: ParaStation User-Level Communication. Design and OverviewJoachim M. Blum, Thomas M. Warschko, Walter F. Tichy. 498-509
• Comparing the Optimal Performance of Different MIMD Multiprocessor ArchitecturesLars Lundberg, Håkan Lennerstad. 498-502 [doi]
• The Design of COMPASS: An Execution Driven Simulator for Commercial Applications Running on Shared Memory MultiprocessorsAshwini K. Nanda, Yiming Hu, Moriyoshi Ohara, Caroline Benveniste, Mark Giampapa, Maged M. Michael. 503-509 [doi]
• Eliminating the Protocol Stack for Socket Based Communication in Shared Memory InterconnectsStein Jørgen Ryan, Haakon Bryhni. 510-523
• An Efficient RMS Admission Control and Its Application to Multiprocessor SchedulingSylvain Lauzac, Rami G. Melhem, Daniel Mossé. 511-518 [doi]
• Guidelines for Data-Parallel Cycle-Stealing in Networks of WorkstationsArnold L. Rosenberg. 519-523 [doi]
• Porting a Molecular Dynamics Application on a Low-Cost Cluster of Personal Computer Running GAMMAGiuseppe Ciaccio, Vincenzo Di Martino. 524-533
• Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task GraphsMichel Cosnard, Emmanuel Jeannot, Laurence Rougeot. 524-530 [doi]
• Benchmarking the Task Graph Scheduling AlgorithmsYu-Kwong Kwok, Ishfaq Ahmad. 531-537 [doi]
• Optimal Communication Performance on Fast Ethernet with GAMMAGiuseppe Ciaccio. 534-548
• A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task GraphsBenjamin S. Macey, Albert Y. Zomaya. 538-541 [doi]
• Utilization and Predictability in Scheduling the IBM SP2 with BackfillingDror G. Feitelson, Ahuva Mu alem Weil. 542-546 [doi]
• High Performance Data Mining Using Data Cubes on Parallel ComputersSanjay Goil, Alok N. Choudhary. 548-555 [doi]
• MPI on NT: A Preliminary Evaluation of the Available EnvironmentsMark Baker, Geoffrey Fox. 549-563
• An Efficient Parallel Algorithms for High Dimensional Similarity JoinKhaled Alsabti, Sanjay Ranka, Vineet Singh. 556-560 [doi]
• Sorting on Clusters of SMPsDavid R. Helman, Joseph JáJá. 561-567 [doi]
• Failure Recovery for Distributed Processes in Single System Image ClustersJeffrey Zabarsky. 564-583
• An AT:::2::: Optimal Mapping of Sorting onto the Mesh Connected Array without ComparatorsJu-wook Jang. 568-572 [doi]
• ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large DatasetsMahesh V. Joshi, George Karypis, Vipin Kumar. 573-579 [doi]
• Improved Concurrency Control Techniques For Multi-Dimensional Index StructuresKothuri Venkata Ravi Kanth, David Serena, Ambuj K. Singh. 580-586 [doi]
• The QCD Abacus: A Cellular Automata Formulation for Continuous Gauge SymmetriesRichard C. Brower. 584
• Affordable Fault Tolerance Through AdaptationIlwoo Chang, Matti A. Hiltunen, Richard D. Schlichting. 585-603
• DEEP: A Development Environment for Parallel ProgramsBrian Q. Brode, Chris R. Warber. 588-593 [doi]
• Rapid Development of Real-Time Systems Using RTExpressMilissa M. Benincasa, Richard Besler, Diane Brassaw, Ralph Kohler Jr.. 594-599 [doi]
• The Effect of the Router Arbitration Policy on the Scalability of ServerNetVladimir Shurbanov, Dimiter R. Avresky, Robert W. Horst. 604-609 [doi]
• Design and Implementation of the FRIENDS SystemJean-Charles Fabre. 604-622
• WILDFIRE Heterogeneous Adaptive Parallel Processing SystemsBradley K. Fross, Dennis M. Hawver, James B. Peterson. 611-615 [doi]
• ACEcard: A High-Performance Architecture for Run-Time ReconfigurationDon Davis, Jonathan Harris. 616-619 [doi]
• A Hardware/Software Co-Design System Using Configurable Computing TechnologyJohn Schwel. 620-625 [doi]
• A Generalized Forward Recovery Checkpointing SchemeKe Huang, Jie Wu, Eduardo B. Fernández. 623-643
• A Clustered Approach to Multithreaded ProcessorsVenkata Krishnan, Josep Torrellas. 627-634 [doi]
• C++ Expression Templates Performance Issues in Scientific ComputingFederico Bassetti, Kei Davis, Daniel J. Quinlan. 635-639 [doi]
• Aggressive Dynamic Execution of Multimedia Kernel TracesBenjamin Bishop, Robert Michael Owens, Mary Jane Irwin. 640-646 [doi]
• Derivation of Fail-Aware Membership Service SpecificationsChristof Fetzer, Flaviu Cristian. 644-663
• Performance Prediction in Production EnvironmentsJennifer M. Schopf, Francine Berman. 647-653 [doi]
• Predicting the Running Times of Parallel Programs by SimulationRadu Rugina, Klaus E. Schauser. 654-660 [doi]
• Compile-Time Synchronization Optimization for Software DSMsHwansoo Han, Chau-Wen Tseng. 662-669 [doi]
• The Timewheel Group Membership ProtocolShivakant Mishra, Christof Fetzer, Flaviu Cristian. 664-680
• An Efficient Logging Scheme for Lazy Release Consistent Distributed Shared Memory SystemsTaesoon Park, Heon Young Yeom. 670-674 [doi]
• Update Protocols and Iterative Scientific ApplicationsPeter J. Keleher. 675-681 [doi]
• Fault-Tolerant Broadcasting in Toroidal NetworksBader Almohammad, Bella Bose. 681-692
• Characterization for Java Memory BehaviorAlex Gontmakher, Assaf Schuster. 682-686 [doi]
• Locality and Performance of Page- and Object-Based DSMsBryan R. Buck, Peter J. Keleher. 687-693 [doi]
• A Flexible Approach for a Fault-Tolerant RouterAndreas C. Döring, Wolfgang Obelöer, Gunther Lustig, Erik Maehle. 693-713
• Optimistic Synchronization of Mixed-Mode SimulatorsPeter Frey, Radharamanan Radhakrishnan. 694-699 [doi]
• Airshed Pollution Modeling: A Case Study in Application Development in an HPF EnvironmentJaspal Subhlok, Peter Steenkiste, James M. Stichnoth, Peter Lieu. 701-710 [doi]
• Design of a FEM Computation Engine for Real-Time Laparoscopic Surgery SimulationAlex Rhomberg, Rolf Enzler, Markus Thaler, Gerhard Tröster. 711-715 [doi]
• Fault-Tolerant Message Routing for MultiprocessorsLev Zakrevski, Mark G. Karpovsky. 714-730
• SIMD and Mixed-Mode Implementations of a Visual Tracking AlgorithmMark Bernd Kulaczewski, Howard Jay Siegel. 716-720 [doi]
• The Implicit Pipeline MethodJohn B. Pormann. 721-725 [doi]
• Rendering Computer Animations on a Network of WorkstationsTimothy D. Davis, Edward W. Davis. 726-730 [doi]
• Self-Testing Fault-Tolerant Real-Time SystemsM. Rooholamini, Seyed H. Hosseini. 731-741
• Hyper Butterfly Network: A Scalable Optimally Fault Tolerant ArchitectureWei Shi, Pradip K. Srimani. 732-736 [doi]
• Scheduling Algorithms Exploiting Spare Capacity and Tasks Laxities for Fault Detection and Location in Real-Time Multiprocessor SystemsK. Mahesh, G. Manimaran, C. Siva Ram Murthy, Arun K. Somani. 737-741 [doi]
• The Robust-Algorithm Approach to Fault Tolerance on Processor Arrays: Fault Models, Fault Diameter, and Basic AlgorithmsBehrooz Parhami, Chi-Hsiang Yeh. 742-746 [doi]
• Checkpointing Protocols in Distributed Systems with Mobile Hosts: A Performance AnalysisFrancesco Quaglia, Bruno Ciciani, Roberto Baldoni. 742-755
• Fault-Tolerant Switched Local Area NetworksPaul S. LeMahieu, Vasken Bohossian, Jehoshua Bruck. 747-751 [doi]
• Trace-Driven Debugging of Message Passing ProgramsMichael A. Frumkin, Robert Hood, Luis Lopez. 753-762 [doi]
• Performance Analysis of a Fault-Tolerant Scheme for Location Management of Mobile HostsSaad Biaz, Nitin H. Vaidya. 756-769
• Predicate Control for Active Debugging of Distributed ProgramsAshis Tarafdar, Vijay K. Garg. 763-769 [doi]
• VPPB - A Visualization and Performance Prediction Tool for Multithreaded Solaris ProgramsMagnus Broberg, Lars Lundberg, Håkan Grahn. 770-776 [doi]
• Fault Tolerant Mobility Planning for Rapidly Deployable Wireless NetworksCharles Shields Jr., Vikas Jain, Simeon C. Ntafos, Ravi Prakash, S. Venkatesan. 770-789
• Parallel Performance Visualization Using Moments of Utilization DataT. J. Godin, Michael J. Quinn, Cherri M. Pancake. 777-782 [doi]
• Optimizing Parallel Applications for Wide-Area ClustersHenri E. Bal, Aske Plaat, Mirjam G. Bakker, Peter Dozy, Rutger F. H. Hofman. 784-790 [doi]
• Building BSP Programs Using the Refinement CalculusDavid B. Skillicorn. 790-795
• Prioritized Token-Based Mutual Exclusion for Distributed SystemsFrank Mueller. 791-795 [doi]
• Adaptive Quality Equalizing: High-Performance Load Balancing for Parallel Branch-and-Bound Across Applications and Computing SystemsNihar R. Mahapatra, Shantanu Dutt. 796-800 [doi]
• Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2Ruben Gamboa. 796-806
• Memory Space Representation for Heterogeneous Network Process MigrationKasidit Chanchio, Xian-He Sun. 801-805 [doi]
• On the Automatic Validation of Parameterized Unity ProgramsJean-Paul Bodeveix, Mamoun Filali. 807-819
• Tailoring UNITY to Distributed Program DesignMichel Charpentier, Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec. 820-832
• Automatically Proving UNITY Safety Properties with Arrays and QuantifiersXavier Thirioux. 833-843
• Experiments with Program Parallelization Using Archetypes and Stepwise RefinementBerna L. Massingill. 844-856
• Deriving Efficient Cache Coherence Protocols through RefinementRatan Nalumasu, Ganesh Gopalakrishnan. 857-870
• An Introduction to Mobile UNITYGruia-Catalin Roman, Peter J. McCann. 871-880
• An Object Model for MultiprogrammingJayadev Misra. 881-889
• A Cottage Industry of Software Publishing: Implications for Theories of CompositionK. Mani Chandy, Paolo A. G. Sivilotti, Joseph Kiniry. 890-899
• Thermal Management in Embedded Systems Using MEMSJeffrey T. Draper, Jay Block, Jeff Koller, Craig S. Steele. 900-901
• A Scalable Multiprocessor for Real-Time Signal ProcessingDaniel Scherrer, Hans Eberle. 902-907
• Safety Net: Secure Communications for Embedded High-Performance ComputingCraig S. Steele, Jeffrey T. Draper, Jeff Koller. 908-912
• Partial Rearrangements of Space-Shared FPGAsOliver Diessel, Hossam A. ElGindy. 913-918
• Measuring the Vulnerability of Interconnection Networks in Embedded SystemsVijay Lakamraju, Zahava Koren, Israel Koren, C. Mani Krishna. 919-924
• An Architecture for Rapid Distributed Fault ToleranceSamuel H. Russ. 925-930
• A Resource Management Model for Dynamic, Scalable, Dependable, Real-Time SystemsBinoy Ravindran, Lonnie R. Welch, Carl Bruggeman, Behrooz Shirazi, Charles Cavanaugh. 931-936
• A Mapping Methodology for Designing Software Task Pipelines for Embedded Signal ProcessingMyungho Lee, Wenheng Liu, Viktor K. Prasanna. 937-944
• Toward Embedded Development from Advanced KhorosJoe Fogler, Thomas Robey, Mark Young. 945-952
• Object Nets for the Design and Verification of Distributed and Embedded ApplicationsJürgen Nützel, Bernd Däne, Wolfgang Fengler. 953-962
• Data Parallel Programming with the Khoros Data Services LibrarySteve Kubica, Thomas Robey, Chris Moorman. 963-968
• A Development Tool Environment for Configuration, Build, and Launch of Complex ApplicationsMike Krueger. 969-978
• Simulation of the Communication Time for a Space-Time Adaptive Processing Algorithm on a Parallel Embedded SystemJack M. West, John K. Antonio. 979-986
• Optimal Configuration of Compute Nodes for Synthetic Aperture Radar ProcessingJeffrey T. Muehring, John K. Antonio. 987-993
• A Visual Environment for the Development of Parallel Real-Time ProgramsJosé R. P. Ribeiro, Nilton C. da Silva, Célio Estevan Morón. 994-1014
• Performance Analysis of Parallel Embedded Real Time Systems Based on Measurement and VisualizationJavier García, Jose Luis Díaz de Arriba, Joaquín Entrialgo, Daniel F. García. 1015-1024
• Performance Range Comparison via Crossing Point AnalysisXian-He Sun. 1025-1036
• A Tree-Driven Multiple-Rate Model of Time Measuring in Object-Oriented Real-Time SystemsVesna Mincev, Dragan Milicev. 1037-1046
• Resource Reservation for Adaptive QOS Mapping in Real-Time MachTatsuo Nakajima. 1047-1056
• Automated Verification of Communication Protocols Using CCS and BDDsReiner Lichtenecker, Klaus Gotthardt, Janusz Zalewski. 1057-1066
• NTI: A Network Time Interface M-Module for High-Accuracy Clock-SynchronizationMartin Horauer, Ulrich Schmid, Klaus Schossmaier. 1067-1076
• Modeling and Validation Support for Interactive Networked Multimedia ApplicationsLuciano Paschoal Gaspary, Maria Janilce B. Almeida. 1077-1087
• EDF Consensus on CAN Bus Access for Dynamic Real-Time ApplicationsMohammad Ali Livani, Jörg Kaiser. 1088-1097
• Using PVM and MPI for Co-processed, Distributed and Parallel Scientific VisualizationRobert Haimes, Kirk E. Jordan. 1098-1105
• Surge Handling as a Measure of Real-Time System DependabilityZahava Koren, Israel Koren, C. Mani Krishna. 1106-1116
• Partial Security and Timeliness in Real-Time Database SystemsSang Hyuk Son. 1117-1120
• A Synthesis Method for Fault-Tolerant Multicast Routing ProtocolKenji Ishida, Kitsutaro Amano. 1121-1130
• Improved Videotransmission over Lossy Channels Using ParallelizationChristoph Günzel, Falko Riemenschneider, Juergen Wirtgen. 1131-1139
• Testing of Synchronization Conditions for Distributed Real-Time ApplicationsAjay D. Kshemkalyani. 1140-1152
• An Architecture for Network Resource Monitoring in a Distributed EnvironmentPhilip M. Irey IV, Robert W. Hott, David T. Marlow. 1153-1163