default search action
IEEE Transactions on Parallel and Distributed Systems, Volume 12
Volume 12, Number 1, January 2001
- John A. Stankovic:
Editorial. 1-2 - 2000 Reviewers List. 3-6
- Roberto De Prisco, Dahlia Malkhi, Michael K. Reiter:
On k-Set Consensus Problems in Asynchronous Systems. 7-21 - Yosi Ben-Asher, Gadi Haber:
Parallel Solutions of Simple Indexed Recurrence Equations. 22-37 - Young-Joo Suh, Kang G. Shin:
All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks. 38-59 - Huan-Yu Tu, Lois Wright Hawkes:
Families of Optimal Fault-Tolerant Multiple-Bus Networks. 60-73 - Behrooz Parhami, Ding-Ming Kwai:
A Unified Formulation of Honeycomb and Diamond Networks. 74-80 - Tatsuhiro Tsuchiya, Shin'ichi Nagano, Rohayu Bt Paidi, Tohru Kikuno:
Symbolic Model Checking for Self-Stabilizing Algorithms. 81-95
Volume 12, Number 2, February 2001
- Dimiter R. Avresky, Jehoshua Bruck, David E. Culler:
Introduction to the Special Section on Dependable Network Computing. 97-98 - Vasken Bohossian, Chenggong Charles Fan, Paul S. LeMahieu, Marc D. Riedel, Lihao Xu, Jehoshua Bruck:
Computing in the RAIN: A Reliable Array of Independent Nodes. 99-114 - Rafael Casado, Aurelio Bermúdez, José Duato, Francisco J. Quiles, José L. Sánchez:
A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks. 115-132 - Svend Frølund, Rachid Guerraoui:
Implementing E-Transactions with Asynchronous Replication. 133-146 - Udo Fritzke Jr., Philippe Ingels, Achour Mostéfaoui, Michel Raynal:
Consensus-Based Fault-Tolerant Total Order Multicast. 147-156 - Guohong Cao, Mukesh Singhal:
Mutable Checkpoints: A New Checkpointing Approach for Mobile Computing Systems. 157-172 - Jennifer Ren, Michel Cukier, William H. Sanders:
An Adaptive Algorithm for Tolerating Value Faults and Crash Failures. 173-192 - Shivakant Mishra, Lan Fei, Xiao Lin, Guming Xing:
On Group Communication Support in CORBA. 193-208
- Ray-Shang Lo, Gen-Huey Chen:
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method. 209-222 - Aniruddha S. Vaidya, Anand Sivasubramaniam, Chita R. Das:
Impact of Virtual Channels and Adaptive Routing on Application Performance. 223-237
Volume 12, Number 3, March 2001
- Wai-Sum Lin, Rynson W. H. Lau, Kai Hwang, Xiaola Lin, Paul Y. S. Cheung:
Adaptive Parallel Rendering on Multiprocessors and Workstation Clusters. 241-258 - Naraig Manjikian, Tarek S. Abdelrahman:
Exploiting Wavefront Parallelism on Large-Scale Shared-Memory Multiprocessors. 259-271 - Hsing-Lung Chen, Shu-Hua Hu:
Submesh Determination in Faulty Tori and Meshes. 272-282 - Mohamed Ould-Khaoua, Hamid Sarbazi-Azad:
An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic. 283-292 - Yi Pan, Si-Qing Zheng, Keqin Li, Hong Shen:
An Improved Generalization of Mesh-Connected Computers with Multiple Buses. 293-305 - Chris H. Q. Ding:
An Optimal Index Reshuffle Algorithm for Multidimensional Arrays and Its Applications for Parallel Architectures. 306-315 - Jong Won Park:
An Efficient Buffer Memory System for Subarray Access. 316-335
Volume 12, Number 4, April 2001
- Mehmet Hakan Karaata:
Self-Stabilizing Strong Fairness under Weak Fairness. 337-345 - Francesco Quaglia:
A Cost Model for Selecting Checkpoint Positions in Time Warp Parallel Simulation. 346-362 - Leana Golubchik, Richard R. Muntz, Cheng-Fu Chou, Steven Berson:
Design of Fault-Tolerant Large-Scale VOD Servers: With Emphasis on High-Performance and Low-Cost. 363-386 - Seok-Kyu Kweon, Kang G. Shin:
Real-Time Transport of MPEG Video with a Statistically Guaranteed Loss Ratio in ATM Networks. 387-403 - Csaba Andras Moritz, Matthew I. Frank:
LoGPC: Modeling Network Contention in Message-Passing Programs. 404-415 - Jordi Garcia, Eduard Ayguadé, Jesús Labarta:
A Framework for Integrating Data Alignment, Distribution, and Redistribution in Distributed Memory Multiprocessors. 416-431
Volume 12, Number 5, May 2001
- Cheng-Zhong Xu, Vipin Chaudhary:
Time Stamp Algorithms for Runtime Parallelization of DOACROSS Loops with Dynamic Dependences. 433-450 - Kirk Schloegel, George Karypis, Vipin Kumar:
Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes. 451-466 - Chun-Lung Chen, Ge-Ming Chiu:
A Fault-Tolerant Routing Scheme for Meshes with Nonconvex Faults. 467-475 - Ludek Kucera:
Wait-Free Deflection Routing of Long Messages. 476-488 - Rajeev Sivaram, Ram Kesavan, Dhabaleswar K. Panda, Craig B. Stunkel:
Architectural Support for Efficient Multicasting in Irregular Networks. 489-513 - Yomin Hou, Chien-Min Wang, Chiu-Yu Ku, Lih-Hsing Hsu:
Optimal Processor Mapping for Linear-Complement Communication on Hypercubes. 514-527
Volume 12, Number 6, June 2001
- Ahuva Mu'alem Weil, Dror G. Feitelson:
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. 529-543 - Koji Nakano, Stephan Olariu, Albert Y. Zomaya:
Energy-Efficient Permutation Routing in Radio Networks. 544-557 - Yu-Chee Tseng, Cheng-Chung Tan:
Termination Detection Protocols for Mobile Distributed Systems. 558-566 - Yuanyuan Yang, Jianchao Wang:
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks. 567-582 - Yuzhong Sun, Paul Y. S. Cheung, Xiaola Lin:
Barrier Synchronization on Wormhole-Routed Networks. 583-597 - William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Augmented Ring Networks. 598-609 - Erik D. Demaine, Ian T. Foster, Carl Kesselman, Marc Snir:
Generalized Communicators in the Message Passing Interface. 610-616 - Min-You Wu, Wei Shu, Jun Gu:
Efficient Local Search for DAG Scheduling. 617-627 - Konstantinos Kalpakis, Koustuv Dasgupta, Ouri Wolfson:
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. 628-637 - Tzong-Jye Liu, Shing-Tsaan Huang:
Phase Synchronization on Asynchronous Uniform Rings with Odd Size. 638-652 - Silvia M. Figueira, Francine Berman:
A Slowdown Model for Applications Executing on Time-Shared Clusters of Workstations. 653-670
Volume 12, Number 7, July 2001
- Patrick Keane, Mark Moir:
A Simple Local-Spin Group Mutual Exclusion Algorithm. 673-685 - Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, Pradip K. Srimani:
A Strategy to Manage Cache Consistency in a Disconnected Distributed Environment. 686-700 - Yulu Yang, Akira Funahashi, Akiya Jouraku, Hiroaki Nishi, Hideharu Amano, Toshinori Sueyoshi:
Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers. 701-715 - Juan-Miguel Martinez-Rubio, Pedro López, José Duato:
A Cost-Effective Approach to Deadlock Handling in Wormhole Networks. 716-729 - Csaba Andras Moritz, Donald Yeung, Anant Agarwal:
SimpleFit: A Framework for Analyzing Design Trade-Offs in Raw Architectures. 730-742 - Ching-Hsien Hsu, Yeh-Ching Chung, Don-Lin Yang, Chyi-Ren Dow:
A Generalized Processor Mapping Technique for Array Redistribution. 743-757 - Thyagaraj Thanalapati, Sivarama P. Dandamudi:
An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers. 758-768
Volume 12, Number 8, August 2001
- Pramod G. Joisha, Prithviraj Banerjee:
The Efficient Computation of Ownership Sets in HPF. 769-788 - Kian-Lee Tan, Jun Cai, Beng Chin Ooi:
An Evaluation of Cache Invalidation Strategies in Wireless Environments. 789-807 - Ram Kesavan, Dhabaleswar K. Panda:
Efficient Multicast on Irregular Switch-Based Cut-Through Networks with Up-Down Routing. 808-828 - Ray Jinzhu Chen:
A Hybrid Solution of Fork/Join Synchronization in Parallel Queues. 829-845 - Weifa Liang, Richard P. Brent, Hong Shen:
Fully Dynamic Maintenance of k-Connectivity in Parallel. 846-864
Volume 12, Number 9, September 2001
- Takashi Harada, Masafumi Yamashita:
Coterie Join Operation and Tree Structured k-Coteries. 865-874 - Venkatavasu Bokka, Koji Nakano, Stephan Olariu, James L. Schwing, Larry Wilson:
Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications. 875-887 - Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi:
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. 888-898 - Albert Y. Zomaya, Yee-Hwei Teh:
Observations on Using Genetic Algorithms for Dynamic Load-Balancing. 899-911 - Limin Xiang, Kazuo Ushijima:
On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR. 912-921 - Mahmut T. Kandemir, Prithviraj Banerjee, Alok N. Choudhary, J. Ramanujam, Eduard Ayguadé:
Static and Dynamic Locality Optimizations Using Integer Linear Programming. 922-941 - Dong Xiang:
Fault-Tolerant Routing in Hypercube Multicomputers Using Local Safety Information. 942-951 - Iffat H. Kazi, David J. Lilja:
Coarse-Grained Thread Pipelining: A Speculative Parallel Execution Model for Shared-Memory Multiprocessors. 952-966 - Yanyong Zhang, Anand Sivasubramaniam, José E. Moreira, Hubertus Franke:
Impact of Workload and System Parameters on Next Generation Cluster Scheduling Mechanisms. 967-985 - Neophytos Neophytou, Paraskevas Evripidou:
Net-dbx: A Web-Based Debugger of MPI Programs Over Low-Bandwidth Lines. 986-995 - Lorenzo Alvisi, Dahlia Malkhi, Evelyn Tumlin Pierce, Michael K. Reiter:
Fault Detection for Byzantine Quorum Systems. 996-1007
Volume 12, Number 10, October 2001
- Giuseppe Anastasi, Alberto Bartoli, Francesco Spadoni:
A Reliable Multicast Protocol for Distributed Mobile Systems: Design and Evaluation. 1009-1022 - Ivan Stojmenovic, Xu Lin:
Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks. 1023-1032 - Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert:
Matrix Multiplication on Heterogeneous Platforms. 1033-1051 - Binu K. Johnson, R. Karthikeyan, D. Janaki Ram:
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing. 1052-1065 - Richard Wolski, John Brevik, Graziano Obertelli, Neil T. Spring, Alan Su:
Writing Programs that Run EveryWare on the Computational Grid. 1066-1080 - Mohammad Banikazemi, Rama Govindaraju, Robert Blackmore, Dhabaleswar K. Panda:
MPI-LAPI: An Efficient Implementation of MPI for IBM RS/6000 SP Systems. 1081-1093 - Michael Mitzenmacher:
The Power of Two Choices in Randomized Load Balancing. 1094-1104
Volume 12, Number 11, November 2001
- Hervé Avril, Carl Tropper:
On Rolling Back and Checkpointing in Time Warp. 1105-1121 - Ivan Stojmenovic, Xu Lin:
Power-Aware Localized Routing in Wireless Networks. 1122-1133 - Yu-Chen Kuo:
Composite k-Arbiters. 1134-1145 - Elizabeth Varki:
Response Time Analysis of Parallel Computer and Storage Systems. 1146-1161 - Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos:
Optimal Total Exchange in Cayley Graphs. 1162-1168 - Enrico Pontelli, Gopal Gupta:
Backtracking in Independent And-Parallel Implementations of Logic Programming Languages. 1169-1189 - Massimo Franceschetti, Jehoshua Bruck:
A Group Membership Algorithm with a Practical Specification. 1190-1200
Volume 12, Number 12, December 2001
- N. S. Sundar, Doddaballapur Narasimha-Murthy Jayasimha, Dhabaleswar K. Panda:
Hybrid Algorithms for Complete Exchange in 2D Meshes. 1201-1218 - José Duato, Timothy Mark Pinkston:
A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources. 1219-1235 - Zahir Tari, Andrew G. Fry:
Controlling Aggregation in Distributed Object Systems: A Graph-Based Approach. 1236-1255 - Guohong Cao, Mukesh Singhal:
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems. 1256-1268 - Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
Parallel Processing of Adaptive Meshes with Load Balancing. 1269-1280 - Chin-Hsiung Wu, Shi-Jinn Horng:
L2 Vector Median Filters on Arrays with Reconfigurable Optical Buses. 1281-1292 - Shyh-Kwei Chen, W. Kent Fuchs:
Compiler-Assisted Multiple Instruction Word Retry for VLIW Architectures. 1293-1304 - T. N. Vijaykumar, Sridhar Gopal, James E. Smith, Gurindar S. Sohi:
Speculative Versioning Cache. 1305-1317 - Mahmut T. Kandemir:
Compiler-Directed Collective-I/O. 1318-1331
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.