# Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing

## Filter Results

Displaying Results 1 - 25 of 119
• ### Data communication and computational geometry on the star and pancake interconnection networks

Publication Year: 1991, Page(s):415 - 422
Cited by:  Papers (18)
| | PDF (698 KB)

The star and pancake networks were recently proposed as attractive alternatives to the hypercube topology for interconnecting processors in a parallel computer. However, little has been done to design parallel algorithms on these networks. The paper presents several data communication algorithms that are fundamental to designing algorithms on these two networks. These algorithms are then used to d... View full abstract»

• ### Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing (Cat. No.91TH0396-2)

Publication Year: 1991
| PDF (35 KB)
• ### Detection of strong predicates in distributed programs

Publication Year: 1991, Page(s):692 - 699
Cited by:  Papers (1)
| | PDF (572 KB)

This paper discusses detection of unstable predicates in a distributed program. Some applications of this are in program debugging and testing. The authors provide a predicate logic in the form of a grammar giving the rewrite rules for constructing predicates about a distributed program. This predicate logic is general enough to describe many conditions programmers are interested in. These predica... View full abstract»

• ### Test generation in a distributed environment

Publication Year: 1991, Page(s):700 - 707
| | PDF (504 KB)

This paper describes a distributed test generation system for combinational circuits. It is made up of modules running on computers connected via a local area network. Issues in parallelizing the tasks between the various modules are discussed, with comparison to previous work in the field. The concepts of independent faults, independent fault sets, and fault partitioning are shown to be the key p... View full abstract»

• ### Very efficient cyclic shifts on hypercubes

Publication Year: 1991, Page(s):556 - 563
Cited by:  Papers (2)
| | PDF (604 KB)

Cyclic shifts are intrinsic operations in many parallel algorithms. Therefore, it is important to execute them efficiently. The authors present and analyze algorithms for the cyclic shift operation on n-dimensional (distributed memory) hypercubes. The first algorithm by S.L. Johnsson (1987) always uses shortest paths between hypercube nodes for routing. The authors prove that when using this algor... View full abstract»

• ### Stabilizing Petri nets

Publication Year: 1991, Page(s):352 - 356
Cited by:  Papers (3)
| | PDF (392 KB)

A fundamental criterion of a robust distributed system is its ability to recover from perturbations that can possibly corrupt the state of the system. In a Petri net model, system perturbations may affect the marking of the net in an unpredictable manner. The paper shows that for certain classes of nets, it is possible to devise a self-stabilizing extension, so that regardless of the initial marki... View full abstract»

• ### A parallel system for test pattern generation

Publication Year: 1991, Page(s):708 - 715
Cited by:  Papers (1)
| | PDF (500 KB)

The problem of generating test pattern sequences for digital circuits is a crucial one in the area of electronic CAD. While a significant effort has been made to develop new and more powerful algorithms to solve it, the required CPU times are still unacceptable in many cases. The authors propose a different approach based on the use of a general-purpose parallel architecture. The attention is devo... View full abstract»

• ### Explicit dynamic exclusion algorithm

Publication Year: 1991, Page(s):142 - 149
Cited by:  Papers (3)
| | PDF (672 KB)

An algorithm for the distributed (explicitly) dynamic resources allocation problem is presented. The algorithm is based on Chandy and Misra's Dining Philosophers Algorithm. Their algorithm is extended to allow philosophers to request that they be added or deleted from the problem. Philosophers are also allowed to add and delete resources from their set of needed resources. This solution can also b... View full abstract»

• ### An NC algorithm for the general planar monotone circuit value problem

Publication Year: 1991, Page(s):196 - 203
Cited by:  Papers (4)
| | PDF (628 KB)

A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in a plane and that has only AND and OR gates. Although a special case of the planar monotone circuit value problem (PMCVP) has been shown to be in NC2, it was not known whether the general PMCVP is in NC. In the paper, the author first gives an NC2 algorithm to evaluate a layered one-input-face PMC usi... View full abstract»

• ### Approximate MVA from Markov model of software client/server systems

Publication Year: 1991, Page(s):322 - 329
Cited by:  Papers (4)
| | PDF (628 KB)

Stochastic rendezvous networks (SRVN) are performance models for multitasking parallel software with intertask communication via rendezvous (RV). The paper describes an approximation for the arrival instant probabilities for a class of simple client/server SRVN, based on a rigorous analysis of the Markov chain model describing the interference of different client tasks contending for a single serv... View full abstract»

• ### Adaptive routing in generalized hypercube architectures

Publication Year: 1991, Page(s):564 - 571
Cited by:  Papers (4)  |  Patents (6)
| | PDF (672 KB)

The authors study generalized hypercube (GHC) interconnection networks. This network provides a rich interconnection topology, is symmetric, and potentially forms the basis of a very reliable architecture. They propose a general taxonomy for adaptive routing protocols, and identify three classes of protocols for generalized hypercubes in particular. These protocols are fully distributed, resilient... View full abstract»

• ### Synthesis of parallel Ada code from a knowledge base of rules

Publication Year: 1991, Page(s):600 - 607
| | PDF (688 KB)

A synergistic approach utilizing compilation, compaction, and parallelization is described to achieve real-time computing throughput from rule-based expert systems. The methodology involves synthesizing a set of concurrently executable Ada tasks from a knowledge base of rules. Compaction of code size is accomplished by eliminating the overhead associated with inference engine control constructs no... View full abstract»

• ### Pitfalls of Petri net transformation

Publication Year: 1991, Page(s):357 - 360
| | PDF (280 KB)

It is shown that there are some pitfalls in the existing methods of Petri net transformation. The existing methods may not guarantee the preserving of the properties of original nets for some kinds of Petri nets. Some new concepts are defined for the derivation of a new net reduction method. New rules and algorithms of Petri net reduction are derived in order to avoid the problems of existing appr... View full abstract»

• ### Debugging concurrent programs using static analysis and run-time hardware monitoring

Publication Year: 1991, Page(s):716 - 719
Cited by:  Patents (6)
| | PDF (280 KB)

This paper describes the design and implementation of PMD-a debugger for Occam2 on an experimental distributed memory MIMD machine. Static analysis of the source code is used to build a model of the program, albeit incomplete, with minimal run-time information being filled in dynamically from a dedicated hardware monitor. The notion of Region of Channel Usage (RCU) is introduced to efficiently det... View full abstract»

• ### Boolean theory of coteries

Publication Year: 1991, Page(s):150 - 157
Cited by:  Papers (6)
| | PDF (584 KB)

A coterie under a ground set U consists of a set of subsets (quorums) of U such that any pair of quorums intersect each other. Nondominated' coteries are of particular interest, since they are optimal' in some sense. By assigning a Boolean variable to each element in U, we represent a coterie by a Boolean function of these variables. The authors characterize the nondominated coteries as exactly ... View full abstract»

• ### Efficient parallel independent subsets and matrix factorizations

Publication Year: 1991, Page(s):204 - 211
Cited by:  Papers (3)
| | PDF (520 KB)

A parallel algorithm is given for computation of a maximal linearly independent subset of a set of vectors over a field. The algorithm uses polylogarithmic time and uses a number of processors that differs by only a polylog factor from the number required for fast parallel matrix inversion. It is used to produce efficient parallel algorithms for orthogonalizations of arbitrary matrices over real f... View full abstract»

• ### Performance of multi-threaded execution in a shared-memory multiprocessor

Publication Year: 1991, Page(s):330 - 333
Cited by:  Papers (6)  |  Patents (12)
| | PDF (340 KB)

The authors propose a general analytic model for the overlapped execution of thread management operations in shared-memory multiprocessors. Performance measures as speedup, utilization and network contention are evaluated and verified using simulations. It is assumed that the execution of each thread consists of sequence of single-cycle instructions, interleaved with four high-level thread managem... View full abstract»

• ### A heuristic processor allocation strategy in hypercube systems

Publication Year: 1991, Page(s):574 - 581
Cited by:  Papers (7)
| | PDF (736 KB)

A new processor allocation scheme for hypercube systems, called the HPA (heuristic processor allocation) strategy, is presented. In this scheme, an undirected graph, called the SC-graph (Subcube-graph), is used to maintain the free subcubes available in system, which are represented by vertices. An allocation request for a k-cube is satisfied by finding a free subcube of dimensio... View full abstract»

• ### Three disjoint path paradigms in star networks

Publication Year: 1991, Page(s):400 - 406
Cited by:  Papers (36)
| | PDF (612 KB)

Star networks have been recently proposed as an attractive choice for interconnection networks. They have sublogarithmic node degree and diameter and, like hypercubes, have a highly recursive structure. Several researchers have endeavored to prove that star networks are as versatile as hypercubes. The paper is an effort in the same direction. It presents optimal algorithms for computing disjoint p... View full abstract»

• ### Object oriented Fortran for development of portable parallel programs

Publication Year: 1991, Page(s):608 - 615
Cited by:  Papers (6)
| | PDF (572 KB)

Parallel programming has to date remained inaccessible to the average scientific programmer. Parallel programming languages are generally foreign to most scientific applications programmers who only speak Fortran. Automatic parallelization techniques have so far proved unsuccessful in extracting large amounts of parallelism from sequential codes and do not encourage development of new, inherently ... View full abstract»

• ### Data skew and the scalability of parallel joins

Publication Year: 1991, Page(s):44 - 51
Cited by:  Papers (1)  |  Patents (3)
| | PDF (532 KB)

When data are uniformly distributed, parallel join algorithms scale up well. However, scalability is curtailed by data skew-nonuniform distribution of data between processors. Investigation of this problem has been hampered by incomplete understanding of data skew as well as inadequate analytic performance models. The authors use a new model of data skew that addresses these shortcomings to examin... View full abstract»

• ### Reliagram-a communication abstraction for distributed processing

Publication Year: 1991, Page(s):361 - 368
| | PDF (688 KB)

The authors have designed and implemented an efficient transport-level protocol called reliagram transport protocol (RGP) that provides a connectionless communication abstraction called reliagram. A reliagram represents a message that can be reliably and asynchronously sent and received by the RGP applications. Novel features of RGP include explicit transfer of transport-level state information to... View full abstract»

• ### An optimal algorithm for the longest common subsequence problem

Publication Year: 1991, Page(s):630 - 639
Cited by:  Papers (3)
| | PDF (868 KB)

The longest common subsequence problem is to find a longest common subsequence of two given strings. The complexity of this problem on the decision tree model is known as mn, where m and n are the lengths of these two strings, respectively, and m⩽n. The authors present a parallel algorithm for this problem on the CREW PRAM model, which takes O(log2mloglogm) time with mn/log2 View full abstract»

• ### A comparison of task scheduling strategies for multiprocessor systems

Publication Year: 1991, Page(s):423 - 426
Cited by:  Papers (10)
| | PDF (412 KB)

There are several ways in which waiting ready tasks can be organized. The two basic organizations are the centralized organization and the distributed organization. The paper considers the impact of task scheduling strategies on the performance of the distributed organization. In particular, it shows that the performance of the distributed organization is comparable to that of the centralized orga... View full abstract»

• ### Distributed computing on anonymous hypercube networks

Publication Year: 1991, Page(s):722 - 729
Cited by:  Papers (4)
| | PDF (572 KB)

The authors consider the bit-complexity (i.e. the total number of bits transmitted) of computing boolean functions on an anonymous canonically labeled n-dimensional hypercube network with N=2n nodes and give a characterization of the boolean functions computable on such a network as exactly those boolean functions which are invariant under all bit-complement automorphisms of the hypercu... View full abstract»