Volume 10, Number 1, January 1999

• 
  Binh Vien Dao, José Duato, Sudhakar Yalamanchili: Dynamically Configurable Message Flow Control for Fault-Tolerant Routing. 7-22

• 
  Behrooz Parhami, Ding-Ming Kwai: Data-Driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter. 23-28

• 
  Nalini K. Ratha, Anil K. Jain: Computer Vision Algorithms on Reconfigurable Logic Arrays. 29-43

• 
  Yu-Chee Tseng, San-Yuan Wang, Chin-Wen Ho: Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach. 44-61
• 
  Stuart W. Daniel, Kang G. Shin, Sang Kyun Yun: A Router Architecture for Flexible Routing and Switching in Multihop Point-To-Point Networks. 62-75
• 
  Dhabaleswar K. Panda, Sanjay Singal, Ram Kesavan: Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths. 76-96

Volume 10, Number 2, February 1999

• 
  Yingchun Zhu, Laurie J. Hendren: Guest Editors' Introduction: Special Issue on Compilers and Languages for Parallel and Distributed Computers. 97-98
• 
  Yingchun Zhu, Laurie J. Hendren: Locality Analysis for Parallel C Programs. 99-114
• 
  Mahmut T. Kandemir, Alok N. Choudhary, U. Nagaraj Shenoy, Prithviraj Banerjee, J. Ramanujam: A Linear Algebra Framework for Automatic Determination of Optimal Data Layouts. 115-135
• 
  Eric Hung-Yu Tseng, Jean-Luc Gaudiot: Communication Generation for Aligned and Cyclic(K) Distributions Using Integer Lattice. 136-146
• 
  Yu-Kwong Kwok, Ishfaq Ahmad: FASTEST: A Practical Low-Complexity Algorithm for Compile-Time Assignment of Parallel Programs to Multiprocessors. 147-159
• 
  Lawrence Rauchwerger, David A. Padua: The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization. 160-180

• 
  Roberto Baldoni, Francesco Quaglia, Paolo Fornara: An Index-Based Checkpointing Algorithm for Autonomous Distributed Systems. 181-192

Volume 10, Number 3, March 1999

• 
  Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran: An Application-Driven Study of Parallel System Overheads and Network Bandwidth Requirements. 193-210

• 
  Dimiter R. Avresky: Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes. 211-222
• 
  Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs. 223-237
• 
  S. Srinivasan, Niraj K. Jha: Safety and Reliability Driven Task Allocation in Distributed Systems. 238-251
• 
  Frank A. Stomp, Gadi Taubenfeld: Constructing a Reliable Test&Set Bit. 252-265

• 
  Rong Lin, Stephan Olariu, James L. Schwing, Biing-Feng Wang: The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry. 266-280

• 
  Marty Humphrey, John A. Stankovic: Predictable Threads for Dynamic, Hard Real-Time Environments. 281-296

• 
  Zhiyong Li, John H. Reif, Sandeep K. S. Gupta: Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. 297-315

• 
  J. S. Kim, David J. Lilja: Performance-Based Path Determination for Interprocessor Communication in Distributed Computing Systems. 316-327

• 
  S. Rai, Y. C. Oh: Tighter Bounds on Full Access Probability in Fault-Tolerant Multistage Interconnection Networks. 328-335

Volume 10, Number 4, April 1999

• 
  Tatsuhiro Tsuchiya, Masatoshi Yamaguchi, Tohru Kikuno: Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes. 337-345

• 
  Simonjit Dutta, Manoj Franklin: Control Flow Prediction Schemes for Wide-Issue Superscalar Processors. 346-359

• 
  Ching-Jung Liao, Yeh-Ching Chung: Tree-Based Parallel Load-Balancing Methods for Solution-Adaptive Finite Element Graphs on Distributed Memory Multicomputers. 360-370

• 
  Ram Kesavan, Dhabaleswar K. Panda: Multiple Multicast with Minimized Node Contention on Wormhole k-ary n-cube Networks. 371-393

• 
  Gagan Agrawal: A General Interprocedural Framework for Placement of Split-Phase Large Latency Operations. 394-413

• 
  Ishfaq Ahmad, Yu-Kwong Kwok: On Parallelizing the Multiprocessor Scheduling Problem. 414-432

Volume 10, Number 5, May 1999

• 
  José Ramón González de Mendívil, Federico Fariña, José Ramón Garitagoitia, Carlos F. Alastruey, José M. Bernabéu-Aubán: A Distributed Deadlock Resolution Algorithm for the AND Model. 433-447

• 
  Xian-He Sun, Mario Pantano, Thomas Fahringer: Integrated Range Comparison for Data-Parallel Compilation Systems. 448-458
• 
  Ding-Kai Chen, Pen-Chung Yew: Redundant Synchronization Elimination for DOACROSS Loops. 459-470

• 
  Ge-Ming Chiu, Shin-Kung Chen: An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead. 471-486
• 
  Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: How to Sort N Items Using a Sorting Network of Fixed I/O Size. 487-499
• 
  Amotz Bar-Noy, Ching-Tien Ho: Broadcasting Multiple Messages in the Multiport Model. 500-508

• 
  Kai Hwang, Choming Wang, Cho-Li Wang, Zhiwei Xu: Resource Scaling Effects on MPP Performance: The STAP Benchmark Implications. 509-527

Volume 10, Number 6, June 1999

• 
  Neeraj Suri, Krithi Ramamritham: Editorial: Special Section on Dependable Real-Time Systems. 529-532
• 
  Hengming Zou, Farnam Jahanian: A Real-Time Primary-Backup Replication Service. 533-548
• 
  Parameswaran Ramanathan: Overload Management in Real-Time Control Applications Using (m, k)-Firm Guarantee. 549-559
• 
  Zbigniew Kalbarczyk, Ravishankar K. Iyer, Saurabh Bagchi, Keith Whisnant: Chameleon: A Software Infrastructure for Adaptive Fault Tolerance. 560-579
• 
  David Powell, Jean Arlat, Ljerka Beus-Dukic, Andrea Bondavalli, P. Coppola, Alessandro Fantechi, Eric Jenn, Christophe Rabéjac, Andy J. Wellings: GUARDS: A Generic Upgradable Architecture for Real-Time Dependable Systems. 580-599
• 
  Matti A. Hiltunen, Richard D. Schlichting, Xiaonan Han, Melvin M. Cardozo, Rajsekhar Das: Real-Time Dependable Channels: Customizing QoS Attributes for Distributed Systems. 600-612
• 
  Seungjae Han, Kang G. Shin: Experimental Evaluation of Behavior-Based Failure-Detection Schemes in Real-Time Communication Networks. 613-626
• 
  Zeyad Alkhalifa, V. S. S. Nair, Narayanan Krishnamurthy, Jacob A. Abraham: Design and Evaluation of System-Level Checks for On-Line Control Flow Error Detection. 627-641
• 
  Flaviu Cristian, Christof Fetzer: The Timed Asynchronous Distributed System Model. 642-657

• 
  Behrooz Parhami, Ding-Ming Kwai: Periodically Regular Chordal Rings. 658-672

Volume 10, Number 7, July 1999

• 
  Ümit V. Çatalyürek, Cevdet Aykanat: Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication. 673-693
• 
  Nitin H. Vaidya: Staggered Consistent Checkpointing. 694-702
• 
  D. Manivannan, Mukesh Singhal: Quasi-Synchronous Checkpointing: Models, Characterization, and Classification. 703-713
• 
  Jens Bæk Jørgensen, Lars Michael Kristensen: Computer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm Using Colored Petri Nets and Occurrence Graphs with Symmetries. 714-732
• 
  Hasan Cam, José A. B. Fortes: Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks. 733-741
• 
  Roberto Giorgi, Cosimo Antonio Prete: PSCR: A Coherence Protocol for Eliminating Passive Sharing in Shared-Bus Shared-Memory Multiprocessors. 742-763

• 
  Vittorio Scarano: On the Sizes of Extended Fibonacci Cubes. 764-766

• 
  Behrooz Parhami, Ding-Ming Kwai: Correction to 'Periodically Regular Chordal Rings'. 767-768

Volume 10, Number 8, August 1999

• 
  Fenghao Mu, Christer Svensson: Vector Transfer by Self-Tested Self-Synchronization for Parallel Systems. 769-780
• 
  Francesco Quaglia, Vittorio Cortellessa, Bruno Ciciani: Trade-Off between Sequential and Time Warp-Based Parallel Simulation. 781-794
• 
  Albert Y. Zomaya, Chris Ward, Benjamin S. Macey: Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues. 795-812
• 
  Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman: Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. 813-824
• 
  Ricardo C. Corrêa, Afonso Ferreira, Pascal Rebreyend: Scheduling Multiprocessor Tasks with Genetic Algorithms. 825-837
• 
  Stephen L. Hary, Füsun Özgüner: Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution. 838-851
• 
  Limin Xiang, Kazuo Ushijima, Selim G. Akl, Ivan Stojmenovic: An Efficient Implementation for the BROADCAST Instruction of BSR+. 852-863

Volume 10, Number 9, September 1999

• 
  Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal: Communication-Induced Determination of Consistent Snapshots. 865-877
• 
  Masafumi Yamashita, Tsunehiko Kameda: Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. 878-887
• 
  Mustaque Ahamad, Rammohan Kordale: Scalable Consistency Protocols for Distributed Services. 888-903
• 
  Timothy Mark Pinkston, Sugath Warnakulasuriya: Characterization of Deadlocks in k-ary n-Cube Networks. 904-921
• 
  Jack L. Lo, Sujay S. Parekh, Susan J. Eggers, Henry M. Levy, Dean M. Tullsen: Software-Directed Register Deallocation for Simultaneous Multithreaded Processors. 922-933
• 
  Alan A. Bertossi, Luigi V. Mancini, Federico Rossini: Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems. 934-945
• 
  Seung-Woo Seo, Tse-Yun Feng, Hyoung-Il Lee: Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm. 946-957

Volume 10, Number 10, October 1999

• 
  Jie Wu, Dharma P. Agrawal: Guest Editors' Introduction: Challenges in Designing Fault-Tolerant Routing in Networks. 961-963
• 
  Qian-Ping Gu, Shietung Peng: Unicast in Hypercubes with Large Number of Faulty Nodes. 964-975
• 
  Bader Almohammad, Bella Bose: Fault-Tolerant Communication Algorithms in Toroidal Networks. 976-983
• 
  Weijia Jia, Wei Zhao, Dong Xuan, Gaochao Xu: An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques. 984-1000
• 
  Vivek Halwan, Füsun Özgüner, Atakan Dogan: Routing in Wormhole-Switched Clustered Networks with Applications to Fault Tolerance. 1001-1011
• 
  Hong Shen, Francis Y. L. Chin, Yi Pan: Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks. 1012-1025
• 
  Rajendra V. Boppana, Suresh Chalasani: Fault-Tolerant Communication with Partitioned Dimension-Order Routers. 1026-1039
• 
  Mathew P. Haynos, Yuanyuan Yang: An Analytical Model on the Blocking Probability of a Fault-Tolerant Network. 1040-1051
• 
  Aniruddha S. Vaidya, Chita R. Das, Anand Sivasubramaniam: A Testbed for Evaluation of Fault-Tolerant Routing in Multiprocessor Interconnection Networks. 1052-1066

• 
  Bojana Obrenic, Martin C. Herbordt, Arnold L. Rosenberg, Charles C. Weems: Using Emulations to Enhance the Performance of Parallel Architectures. 1067-1081
• 
  Joseph C. Jacob, Soo-Young Lee: Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations. 1082-1101

• 
  Dimiter R. Avresky, Khalid M. Al-Tawil: Correction to 'Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes'. 1102

Volume 10, Number 11, November 1999

• 
  Lutz Prechelt: Exploiting Domain-Specific Properties: Compiling Parallel Dynamic Neural Network Algorithms into Efficient Code. 1105-1117
• 
  Chi-Chung Hui, Samuel T. Chanson: Hydrodynamic Load Balancing. 1118-1137
• 
  Wenjian Qiao, Lionel M. Ni, Tomas Rokicki: Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches. 1138-1158
• 
  Vara Varavithya, Prasant Mohapatra: Asynchronous Tree-Based Multicasting in Wormhole-Switched MINs. 1159-1178
• 
  Tarek F. Abdelzaher, Kang G. Shin: Combined Task and Message Scheduling in Distributed Real-Time Systems. 1179-1191
• 
  Hui-Ling Huang, Gen-Huey Chen: Combinatorial Properties of Two-Level Hypernet Networks. 1192-1199

Volume 10, Number 12, December 1999

• 
  Antoine Petitet, Jack Dongarra: Algorithmic Redistribution Methods for Block-Cyclic Decompositions. 1201-1216
• 
  Neungsoo Park, Viktor K. Prasanna, Cauligi S. Raghavendra: Efficient Algorithms for Block-Cyclic Array Redistribution Between Processor Sets. 1217-1240
• 
  Hideo Nagumo, Mi Lu, Karan L. Watson: Parallel Parsing Algorithms for Static Dictionary Compression. 1241-1251
• 
  Michal Soch, Pavel Tvrdík: Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes. 1252-1261
• 
  Peter J. Varman, Rakesh M. Verma: Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. 1262-1275
• 
  Koji Nakano, Stephan Olariu, James L. Schwing: Broadcast-Efficient Protocols for Mobile Radio Networks. 1276-1289
• 
  David S. L. Wei, Felix P. Muga II, Kshirasagar Naik: Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm. 1290-1298
• 
  Yuanyuan Yang, Jianchao Wang: A New Self-Routing Multicast Network. 1299-1316
• 
  James H. Anderson, Mark Moir: Universal Constructions for Large Objects. 1317-1332

last updated on Tue May 21 03:33:40 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page