By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 12 • Date Dec. 2003

Filter Results

Displaying Results 1 - 9 of 9
  • Space and time efficient parallel algorithms and software for EST clustering

    Publication Year: 2003 , Page(s): 1209 - 1221
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1008 KB) |  | HTML iconHTML  

    Expressed sequence tags, abbreviated as ESTs, are DNA molecules experimentally derived from expressed portions of genes. Clustering of ESTs is essential for gene recognition and for understanding important genetic variations such as those resulting in diseases. We present the algorithmic foundations and implementation of PaCE, a parallel software system we developed for large-scale EST clustering.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved methods for divisible load distribution on k-dimensional meshes using pipelined communications

    Publication Year: 2003 , Page(s): 1250 - 1261
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB) |  | HTML iconHTML  

    We give the closed form solutions to the parallel time and speedup of the classic method for processing divisible loads on linear arrays as functions of N, the network size. We propose two methods which employ pipelined communications to distribute divisible loads on linear arrays. We derive the closed form solutions to the parallel time and speedup for both methods and show that the asymptotic sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A clustering approach for identifying and quantifying irregularities in interconnection networks

    Publication Year: 2003 , Page(s): 1222 - 1239
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1246 KB) |  | HTML iconHTML  

    Support for arbitrary topologies has become more popular for system-area networks but very little has been done in trying to characterize their behavior and performance. Traditional parameters like diameter and bisection width are not sufficient for characterizing the irregularities that abound in such networks and fail to give much insight into throughput performance. A clustering approach for pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared memory multiprocessor architectures for software IP routers

    Publication Year: 2003 , Page(s): 1240 - 1249
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1028 KB) |  | HTML iconHTML  

    We propose new shared memory multiprocessor architectures and evaluate their performance for future Internet protocol (IP) routers based on symmetric multiprocessor (SMP) and cache coherent nonuniform memory access (CC-NUMA) paradigms. We also propose a benchmark application suite, RouterBench, which consists of four categories of applications representing key functions on the time-critical path o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Summation and routing on a partitioned optical passive stars network with large group size

    Publication Year: 2003 , Page(s): 1275 - 1285
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (637 KB) |  | HTML iconHTML  

    In a partitioned optical passive stars (POPS) network, n=dg processors are divided into g groups of d processors each, and such a POPS network is denoted by POPS(d,g). There is an optical passive star (OPS) coupler between every pair of groups. Hence, a POPS(d,g) requires g2 couplers. It is likely that, in a practical system, the number of couplers will be less than the number of proces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple and fast parallel coloring for distance-hereditary graphs

    Publication Year: 2003 , Page(s): 1201 - 1208
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (322 KB) |  | HTML iconHTML  

    In the literature, there are quite a few sequential and parallel algorithms to solve problems on distance-hereditary graphs. Two well-known classes of graphs, which contain trees and cographs, belong to distance-hereditary graphs. We consider the vertex-coloring problem on distance-hereditary graphs. Let Td(|V|, |E|) and Pdd(|V|, |E|) denote the time and processor complexitie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high-performance application data environment for large-scale scientific computations

    Publication Year: 2003 , Page(s): 1262 - 1274
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1069 KB) |  | HTML iconHTML  

    Effective high-level data management is becoming an important issue with more and more scientific applications manipulating huge amounts of secondary-storage and tertiary-storage data using parallel processors. A major problem facing the current solutions to this data management problem is that these solutions either require a deep understanding of specific data storage architectures and file layo... View full abstract»

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

    Publication Year: 2003 , Page(s): 1286 - 1289
    Save to Project icon | Request Permissions | PDF file iconPDF (212 KB)  
    Freely Available from IEEE
  • Subject index

    Publication Year: 2003 , Page(s): 1289 - 1296
    Save to Project icon | Request Permissions | PDF file iconPDF (236 KB)  
    Freely Available from IEEE

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.

Full Aims & Scope

Meet Our Editors

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