By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Date Dec. 1997

Filter Results

Displaying Results 1 - 14 of 14
  • Comments on "A new family of Cayley graph interconnection networks of constant degree four"

    Publication Year: 1997, Page(s):1299 - 1300
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (77 KB)

    For original paper see Vadapalli and Srimani, ibid., vol. 7, no. 1, p 26-32, 1996, where the authors have proposed a new family of Cayley graph interconnection networks of constant degree four. Our comments show that their proposed graph is not new but is the same as the wrap-around butterfly graph. The structural kinship of the proposed graph with the de Bruijn graph is also discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1997 Index IEEE Transactions on Parallel And Vol. 8

    Publication Year: 1997, Page(s):1301 - 1312
    Request permission for commercial reuse | PDF file iconPDF (457 KB)
    Freely Available from IEEE
  • Solving an algebraic path problem and some related graph problems on a hyper-bus broadcast network

    Publication Year: 1997, Page(s):1226 - 1235
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    The parallel computation model upon which the proposed algorithms are based is the hyper-bus broadcast network. The hyper-bus broadcast network consists of processors which are connected by global buses only. Based on such an improved architecture, we first design two O(1) time basic operations for finding the maximum and minimum of N numbers each of size O(log N)-bit and computing the matrix mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting corrupted pages in M replicated large files

    Publication Year: 1997, Page(s):1241 - 1245
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    A file in a distributed database system is replicated on M sites and may contain corrupted pages. Abdel-Ghafiar and El Abbadi gave a detection scheme assuming that the number of corrupted pages f<M/2. We replace this assumption by a much weaker one, that, for each page, the majority of copies are correct. Our schemes are based on the structure of the Reed-Solomon code, as proposed by Abdel-Ghaf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized algorithm for parallel sorting on product networks

    Publication Year: 1997, Page(s):1211 - 1225
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    We generalize the well-known odd-even merge sorting algorithm, originally due to Batcher (1968), and show how this generalized algorithm can be applied to sorting on product networks. If G is an arbitrary factor graph with N nodes, its r-dimensional product contains Nr nodes. Our algorithm sorts Nr keys stored in the r-dimensional product of G in O(rrF(N)) time, wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nearly optimal one-to-many parallel routing in star networks

    Publication Year: 1997, Page(s):1196 - 1202
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Star networks were proposed recently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows that star networks are as versatile as hypercubes. This paper is an effort in the same direction. Based on the well-known paradigms, we study the one-to-many parallel routing problem on star networks and develop an impro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified architecture for the computation of B-spline curves and surfaces

    Publication Year: 1997, Page(s):1275 - 1287
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    B-Splines, in general, and Non-Uniform Rational B-Splines (NURBS), in particular, have become indispensable modeling primitives in computer graphics and geometric modeling applications. In this paper, a novel high-performance architecture for the computation of uniform, nonuniform, rational, and nonrational B-Spline curves and surfaces is presented. This architecture has been derived through a seq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel algorithm for constructing a labeled tree

    Publication Year: 1997, Page(s):1236 - 1240
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    A tree T is labeled when the n vertices are distinguished from one another by names such as v1, v2…vn . Two labeled trees are considered to be distinct if they have different vertex labels even though they might be isomorphic. According to Cayley's tree formula, there are nn-2 labeled trees on n vertices. Prufer used a simple way to prove this for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An effective processor allocation strategy for multiprogrammed shared-memory multiprocessors

    Publication Year: 1997, Page(s):1246 - 1258
    Cited by:  Papers (7)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Existing techniques for sharing the processing resources in multiprogrammed shared-memory multiprocessors, such as time-sharing, space-sharing, and gang-scheduling, typically sacrifice the performance of individual parallel applications to improve overall system utilization. We present a new processor allocation technique called Loop-Level Process Control (LLPC) that dynamically adjusts the number... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended Fibonacci Cubes

    Publication Year: 1997, Page(s):1203 - 1210
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    The Fibonacci Cube is an interconnection network that possesses many desirable properties that are important in network design and application. The Fibonacci Cube can efficiently emulate many hypercube algorithms and uses fewer links than the comparable hypercube, while its size does not increase as fast as the hypercube. However, most Fibonacci Cubes (more than 2/3 of all) are not Hamiltonian. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant ring embedding in a star graph with both link and node failures

    Publication Year: 1997, Page(s):1185 - 1195
    Cited by:  Papers (91)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    The star graph interconnection network has been recognized as an attractive alternative to the hypercube network. Previously, the star graph has been shown to contain a Hamiltonian cycle. In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with fe⩽n-3 faulty links, a Hamiltonian cycle still can be found in an n-star, and that with f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Backbone networks using rotation counters

    Publication Year: 1997, Page(s):1288 - 1298
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    We use simulations to evaluate the performance of an RCP ring network for network interconnection. The RCP (Rotation Counter Protocol) is a token ring protocol that has in its token a special field for counting down of the number of packets transmitted in one cycle. By correlating the queuing performance of each station through the counter, the delay of the high-priority data can be made almost in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling data-flow graphs via retiming and unfolding

    Publication Year: 1997, Page(s):1259 - 1267
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    Loop scheduling is an important problem in parallel processing. The retiming technique reorganizes an iteration; the unfolding technique schedules several iterations together. We combine these two techniques to obtain a static schedule with a reduced average computation time per iteration. We first prove that the order of retiming and unfolding is immaterial for scheduling a data-flow graph (DFG).... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deadline assignment in a distributed soft real-time system

    Publication Year: 1997, Page(s):1268 - 1274
    Cited by:  Papers (78)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    In a distributed environment, tasks often have processing demands at multiple different sites. A distributed task is usually divided into several subtasks, each to be executed in order at some site. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. In this paper, we present and analyze techniques for aut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to:

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology