IEEE Transactions on Parallel and Distributed Systems, Vol. 4 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• 

• 

• 

• 

• 
  jump to

  • Number 1
  • Number 2
  • Number 3
  • Number 4
  • Number 5
  • Number 6
  • Number 7
  • Number 8
  • Number 9
  • Number 10
  • Number 11
  • Number 12

• 

• > Home > Journals > IEEE Transactions on Parallel and Distributed Systems

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 4, Number 1, January 1993

Editor's Notice

• 
  • 
  • 
  • 
  • 
    Tse-Yun Feng:
    Editor's Notice. 1-2

Papers

• 
  Wen-Jing Hsu:
  Fibonacci Cubes-A New Interconnection Technology. 3-12
• 
  Yuval Tamir, Hsin-Chou Chi:
  Symmetric Crossbar Arbiters for VLSI Communication Switches. 13-27
• 
  Aaron J. Goldberg, John L. Hennessy:
  Mtool: An Integrated System for Performance Debugging Shared Memory Multiprocessor Applications. 28-40
• 
  Daniel Lenoski, James Laudon, Truman Joe, David Nakahira, Luis Stevens, Anoop Gupta, John L. Hennessy:
  The DASH Prototype: Logic Overhead and Performance. 41-61
• 
  Yahui Zhu, Mohan Ahuja:
  On Job Scheduling on a Hypercube. 62-69
• 
  Joel L. Wolf, Daniel M. Dias, Philip S. Yu:
  A Parallel Sort Merge Join Algorithm for Managing Data Skew. 70-86
• 
  Ten H. Tzen, Lionel M. Ni:
  Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers. 87-98

Short Notes

• 
  Alexander Thomasian:
  Determining the Number of Remote Sites Accessed in Distributed Transaction Processing. 99-103
• 
  K. H. Kim, Alireza Kavianpour:
  A Distributed Recovery Block Approach to Fault-Tolerant Execution of Application Tasks in Hypercubes. 104-111
• 
  David J. Pritchard, Denis A. Nicole:
  Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network. 111-117

Volume 4, Number 2, February 1993

Papers

• 
  K. C. Lee:
  A Virtual Bus Architecture for Dynamic Parallel Processing. 121-130
• 
  Mark S. Squillante, Edward D. Lazowska:
  Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling. 131-143
• 
  Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
  Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets. 144-154
• 
  Yitzhak Birk:
  On-Line Control and Deadlock-Avoidance in a Page-Parallel Multiprocessor Rasterizer. 155-163
• 
  C. Murray Woodside, Gerald G. Monforton:
  Fast Allocation of Processes in Distributed and Parallel Systems. 164-174
• 
  Gilbert C. Sih, Edward A. Lee:
  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures. 175-187
• 
  Ivor P. Page, Tom Jacob, Eric Chern:
  Fast Algorithms for Distributed Resource Allocation. 188-197
• 
  Dali L. Tao, Carlos R. P. Hartmann:
  A Novel Concurrent Error Detection Scheme for FFT Networks. 198-221
• 
  Mark A. Nichols, Howard Jay Siegel, Henry G. Dietz:
  Data Management and Control-Flow Aspects of an SIMD/SPMD Parallel Language/Compiler. 222-234

Short Notes

• 
  Abdou Youssef, Bruce W. Arden:
  Functional and Topological Relations Among Banyan Multistage Networks of Differing Switch Sizes. 235-240

Volume 4, Number 3, March 1993

Papers

• 
  Ahmed A. El-Amawy:
  Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound. 241-255
• 
  Lorrie Fava Lindon, Selim G. Akl:
  An Optimal Implementation of Broadcasting with Selective Reduction. 256-269
• 
  Fillia Makedon, Antonios Symvonis:
  An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements. 270-276
• 
  Mee Yee Chan, Shiang-Jen Lee:
  Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes. 277-288
• 
  Asit Dan, Philip S. Yu:
  Performance Analysis of Buffer Coherency Policies in a Multisystem Data Sharing Environment. 289-305
• 
  Jau-Hsiung Huang, Leonard Kleinrock:
  Performance Evaluation of Dynamic Sharing of Processors in Two-Stage Parallel Processing Systems. 306-317
• 
  David W. Glazer, Carl Tropper:
  On Process Migration and Load Balancing in Time Warp. 318-327
• 
  Vipin Chaudhary, Jake K. Aggarwal:
  A Generalized Scheme for Mapping Parallel Algorithms. 328-346

Short Notes

• 
  Devendra Kumar, Saad Harous:
  A Study of Achievable Speedup in Distributed Simulation via NULL Messages. 347-354
• 
  Abdou Youssef:
  A Parallel Algorithm for Random Walk Construction with Application to the Monte Carlo Solution of Partial Differential Equations. 355-360

Volume 4, Number 4, April 1993

Papers

• 
  Kichul Kim, Viktor K. Prasanna:
  Latin Squares for Parallel Array Access. 361-370
• 
  Yinong Chen, Winfried Bücken, Klaus Echtle:
  Efficient Algorithms for System Diagnosis with Both Processor and Comparator Faults. 371-381
• 
  Chia Shen, Krithi Ramamritham, John A. Stankovic:
  Resource Reclaiming in Multiprocessor Real-Time Systems. 382-397
• 
  Paraskevas Evripidou, Jean-Luc Gaudiot:
  Block Scheduling of Iterative Algorithms and Graph-Level Priority Scheduling in a Simulated Data-Flow Multiprocessor. 398-413
• 
  Yigang Chen, Wei-Tek Tsai, Daniel Y. Chao:
  Dependency Analysis - A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems. 414-426
• 
  V. Nageshwara Rao, Vipin Kumar:
  On the Efficiency of Parallel Backtracking. 427-437
• 
  Arthur L. Liestman, Dana S. Richards:
  Network Communication in Edge-Colored Graphs: Gossiping. 438-445
• 
  Edward K. B. Lee, Simon Haykin:
  Parallel Implementation of the Extended Square-Root Covariance Filter for Tracking Applications. 446-457
• 
  Amal Chakraborty, Donald C. S. Allison, Calvin J. Ribbens, Layne T. Watson:
  The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations. 458-465

Short Notes

• 
  William J. Dally, Hiromichi Aoki:
  Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels. 466-475
• 
  Mee Yee Chan, Francis Y. L. Chin:
  Optimal Resilient Distributed Algorithms for Ring Election. 475-480

Volume 4, Number 5, May 1993

Papers

• 
  Hee Yong Youn, Calvin Ching-Yuen Chen:
  A Comprehensive Performance Evaluation of Crossbar Networks. 481-489
• 
  Massimo Maresca:
  Polymorphic Processor Arrays. 490-506
• 
  Helmar Burkhart, Rudolf Eigenmann, Heinz Kindlimann, Michael Moser, Heinz Scholian:
  The M3 Multiprocessor Laboratory. 507-519
• 
  Steven L. Scott, James R. Goodman:
  Performance of Pruning-Cache Directories for Large-Scale Multiprocessors. 520-534
• 
  Leonard Kleinrock, Willard Korfhage:
  Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems. 535-546
• 
  Ten H. Tzen, Lionel M. Ni:
  Dependence Uniformization: A Loop Parallelization Technique. 547-558
• 
  Renbing Xiong, Theodore Brown:
  Parallel Median Splitting and k-Splitting with Application to Merging and Sorting. 559-565
• 
  Yen-Chun Lin:
  On Balancing Sorting on a Linear Array. 566-571
• 
  Bülent Abali, Füsun Özgüner, Abdulla Bataineh:
  Balanced Parallel Sort on Hypercube Multiprocessors. 572-581
• 
  Joseph F. JáJá, Kwan Woo Ryu:
  Optimal Algorithms on the Pipelined Hypercube and Related Networks. 582-591
• 
  Victor Y. Pan:
  Concurrent Iterative Algorithm for Toeplitz-like Linear Systems. 592-600

Volume 4, Number 6, June 1993

Papers

• 
  Myung Hoon Sunwoo, J. K. Aggarwal:
  A Sliding Memory Plane Array Processor. 601-612
• 
  Sarita V. Adve, Mark D. Hill:
  A Unified Formalization of Four Shared-Memory Models. 613-624
• 
  Gilbert C. Sih, Edward A. Lee:
  Declustering: A New Multiprocessor Scheduling Technique. 625-637
• 
  Kumar K. Goswami, Murthy V. Devarakonda, Ravishankar K. Iyer:
  Prediction-Based Dynamic Load-Sharing Heuristics. 638-648
• 
  Shahid H. Bokhari:
  A Network Flow Model for Load Balancing in Circuit-Switched Multicomputers. 649-657
• 
  Mohan Ahuja:
  An Implementation of F-Channels. 658-667
• 
  Subir Varma:
  Performance Evaluation of the Time-Stamp Ordering Algorithm in a Distributed Database. 668-676
• 
  Gruia-Catalin Roman, Jerome Y. Plun, C. Donald Wilcox:
  Dynamic Synchrony Among Atomic Actions. 677-685
• 
  Apostolos Gerasoulis, Tao Yang:
  On the Granularity and Clustering of Directed Acyclic Task Graphs. 686-701

Short Notes

• 
  A. Duksu Oh, Hyeong-Ah Choi:
  Generalized Measures of Fault Tolerance in n-Cube Networks. 702-703
• 
  Dilip Sarkar:
  Cost and Time-Cost Effectiveness of Multiprocessing. 704-712
• 
  Sing-Ban Tien, Cauligi S. Raghavendra:
  Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes. 713-718

Correspondence

• 
  Imadeldin O. Mahgoub, Ahmed K. Elmagarmid:
  Clarifications and Corrections To 'Performance Analysis of a Generalized Class of m-Level Hierarchical Multiprocessor Systems' (Mar 1992 129-138). 719-720

Volume 4, Number 7, July 1993

Editor's Notice

• 
  • 
  • 
  • 
  • 
    Tse-Yun Feng:
    Editor's Notice. 721-724

Papers

• 
  George D. Stamoulis, John N. Tsitsiklis:
  Efficient Routing Schemes for Multiple Broadcasts in Hypercubes. 725-739
• 
  Kang G. Shin, Chao-Ju Hou:
  Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems. 740-761
• 
  David M. Ogle, Karsten Schwan, Richard T. Snodgrass:
  Application-Dependent Dynamic Monitoring of Distributed and Parallel Systems. 762-778
• 
  Toshihide Ibaraki, Tiko Kameda:
  A Theory of Coteries: Mutual Exclusion in Distributed Systems. 779-794
• 
  Narain H. Gehani:
  Capsules: A Shared Memory Access Mechanism for Concurrent C/C++. 795-811
• 
  James R. Larus:
  Loop-Level Parallelism in Numeric and Symbolic Programs. 812-826
• 
  David P. Helmbold, Charles E. McDowell, Jian-Zhong Wang:
  Determining Possible Event Orders by Analyzing Sequential Traces. 827-840

Volume 4, Number 8, August 1993

Papers

• 
  Ronald F. DeMara, Dan I. Moldovan:
  The SNAP-1 Parallel AI Prototype. 841-854
• 
  Nian-Feng Tzeng:
  Reconfiguration and Analysis of a Fault-Tolerant Circular Butterfly Parallel System. 855-863
• 
  Bapiraju Vinnakota, Niraj K. Jha:
  Synthesis of Algorithm-Based Fault-Tolerant Systems from Dependence Graphs. 864-874
• 
  Mayez A. Al-Mouhamed:
  Analysis of Macro-Dataflow Dynamic Scheduling on Nonuniform Memory Access Architectures. 875-888
• 
  Chengwen Liu, Clement T. Yu:
  Performance Issues in Distributed Query Processing. 889-905
• 
  Philip Heidelberger, David M. Nicol:
  Conservative Parallel Simulation of Continuous Time Markov Chains Using Uniformization. 906-921
• 
  Anshul Gupta, Vipin Kumar:
  The Scalability of FFT on Parallel Computers. 922-932
• 
  Mee Yee Chan, Francis Y. L. Chin:
  A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes. 933-946
• 
  Robert B. Mueller-Thuns, Daniel G. Saab, Robert F. Damiano, Jacob A. Abraham:
  Benchmarking Parallel Processing Platforms: An Applications Perspective. 947-954

Short Notes

• 
  Junguk L. Kim, Taesoon Park:
  An Efficient Protocol for Checkpointing Recovery in Distributed Systems. 955-960

Volume 4, Number 9, September 1993

Editor's Notice

• 
  • 
  • 
  • 
  • 
    Tse-Yun Feng:
    Editor's Notice. 961

Papers

• 
  Elango Ganesan, Dhiraj K. Pradhan:
  The Hyper-deBruijn Networks: Scalable Versatile Architecture. 962-978
• 
  Marc Willebeek-LeMair, Anthony P. Reeves:
  Strategies for Dynamic Load Balancing on Highly Parallel Computers. 979-993
• 
  Dimitris C. Gerogiannis, Stelios C. Orphanoudakis:
  Load Balancing Requirements in Parallel Implementations of Image Feature Extraction Tasks. 994-1013
• 
  Toshio Nakatani, Kemal Ebcioglu:
  Making Compaction-Based Parallelization Affordable. 1014-1029
• 
  Akira Imai, Evan Tick:
  Evaluation of Parallel Copying Garbage Collection on a Shared-Memory Multiprocessor. 1030-1040
• 
  Gail A. Alverson, David Notkin:
  Program Structuring for Effective Parallel Portability. 1041-1059
• 
  Matthew T. O'Keefe, Henry G. Dietz:
  Loop Coalescing and Scheduling for Barrier MIMD Architectures. 1060-1064
• 
  Gita Alaghband, Muhammad S. Benten, Rüdiger Jakob, Harry F. Jordan, Aruna V. Ramanan:
  Language Portability Across Shared Memory Multiprocessors. 1064-1072

Volume 4, Number 10, October 1993

Papers

• 
  Mauricio J. Serrano, Behrooz Parhami:
  Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses. 1073-1080
• 
  Eric M. Dowling, Zuqiang Fu, Ron S. Drafz:
  HARP: An Open Architecture for Parallel Matrix and Signal Processing. 1081-1091
• 
  Alok N. Choudhary, Janak H. Patel, Narendra Ahuja:
  NETRA: A Hierarchical and Partitionable Architecture for Computer Vision Systems. 1092-1104
• 
  Xiaola Lin, Lionel M. Ni:
  Multicast Communication in Multicomputer Networks. 1105-1117
• 
  Chita R. Das, Prasant Mohapatra, Lei Tien, Laxmi N. Bhuyan:
  An Availability Model for MIN-Based Multiprocessors. 1118-1129
• 
  David J. Lilja, Pen-Chung Yew:
  Improving Memory Utilization in Cache Coherence Directories. 1130-1146
• 
  Anurag Kumar, Rajeev Shorey:
  Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System. 1147-1164

Short Notes

• 
  Qing Yang, Hong Wang:
  A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors. 1165-1171
• 
  Dikran S. Meliksetian, C. Y. Roger Chen:
  Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles. 1172-1178
• 
  Masaru Takesue:
  A Family of Parallel Prefix Algorithms Embedded in Networks. 1179-1184

Volume 4, Number 11, November 1993

Papers

• 
  Avraham Leff, Joel L. Wolf, Philip S. Yu:
  Replication Algorithms in a Remote Caching Architecture. 1185-1204
• 
  Sukhamoy Som, Roland R. Mielke, John W. Stoughton:
  Prediction of Performance and Processor Requirements in Real-Time Data Flow Architectures. 1205-1216
• 
  Oliver C. Ibe, Hoon Choi, Kishor S. Trivedi:
  Performance Evaluation of Client-Server Systems. 1217-1229
• 
  Sotirios G. Ziavras:
  Efficient Mapping Algorithms for a Class of Hierarchical Systems. 1230-1245
• 
  Peter A. Franaszek, Jayant R. Haritsa, John T. Robinson, Alexander Thomasian:
  Distributed Concurrency Control Based on Limited Wait-Depth. 1246-1264
• 
  Wouter B. Teeuw, Henk M. Blanken:
  Control Versus Data Flow in Parallel Database Machines. 1265-1279
• 
  Kleanthis Psarris, Xiangyun Kong, David Klappholz:
  The Direction Vector I Test. 1280-1290
• 
  Jing-Fu Jenq, Sartaj Sahni:
  Image Shrinking and Expanding on a Pyramid. 1291-1296

Volume 4, Number 12, December 1993

Editor's Notice

• 
  • 
  • 
  • 
  • 
    Tse-Yun Feng:
    Editor's Notice. 1297

Papers

• 
  Tai-Kuo Woo, Stanley Y. W. Su:
  PCBN: A High-Performance Partitionable Circular Bus Network for Distributed Systems. 1298-1307
• 
  Kang G. Shin, Chih-Che Chou:
  A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks. 1308-1319
• 
  José Duato:
  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks. 1320-1331
• 
  Chienhua Chen, Dharma P. Agrawal, J. Richard Burke:
  dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout. 1332-1344
• 
  James W. Stamos, Honesty C. Young:
  A Symmetric Fragment and Replicate Algorithm for Distributed Joins. 1345-1354
• 
  Joel L. Wolf, Philip S. Yu, John Turek, Daniel M. Dias:
  A Parallel Hash Join Algorithm for Managing Data Skew. 1355-1371
• 
  David Nassimi:
  Parallel Algorithms for the Classes of +or-2b DESCEND and ASCEND Computations on a SIMD Hypercube. 1372-1381
• 
  Michele Angelaccio, Michele Colajanni:
  Unifying and Optimizing Parallel Linear Algebra Algorithms. 1382-1397

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: