By Topic

Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on

Date 5-8 Dec. 2005

Filter Results

Displaying Results 1 - 25 of 258
  • Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies - Cover

    Publication Year: 2005 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (157 KB)  
    Freely Available from IEEE
  • Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies - Title Page

    Publication Year: 2005 , Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (126 KB)  
    Freely Available from IEEE
  • Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies - Copyright

    Publication Year: 2005 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (97 KB)  
    Freely Available from IEEE
  • Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies - Table of contents

    Publication Year: 2005 , Page(s): v - xxiv
    Save to Project icon | Request Permissions | PDF file iconPDF (215 KB)  
    Freely Available from IEEE
  • Preface

    Publication Year: 2005 , Page(s): xxv
    Save to Project icon | Request Permissions | PDF file iconPDF (162 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2005 , Page(s): xxvi
    Save to Project icon | Request Permissions | PDF file iconPDF (173 KB)  
    Freely Available from IEEE
  • Future Technological Challenges for High Performance Computers

    Publication Year: 2005 , Page(s): 2
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (70 KB)  

    A high performance computer (HPC), sometimes called a supercomputer, is a highspeed, large-scale computer system designed for scientific and technical computations in application areas such as meteorology, molecular and bio-science, energy development, space science and so forth. These applications are called "Grand Challenge Problems" in which the major target is to run application programs withi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Agile Programming Model for Grid End Users

    Publication Year: 2005 , Page(s): 3 - 7
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (272 KB) |  | HTML iconHTML  

    Grid and service computing technologies have been explored by enterprises to promote integration, sharing, and collaboration. However, quick response to business environment changes is still a challenging issue. For end users, developing, customizing, and reengineering applications remain a difficult and timeconsuming task. Users still need to deal with excessive low-level details of platform-spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable and Practical Nonblocking Switching Networks (Extended Abstract)

    Publication Year: 2005 , Page(s): 8 - 10
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (94 KB) |  | HTML iconHTML  

    Switching networks are widely used as core components in network switches and routers, and communication subsyetems in parallel computing systems. Most switching networks are multistage interconnection networks built with small-size switching elements. Nonblocking switching networks have been favored because of their capability of setting up any one-to-one I/O connections. There are three types of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rearrangeability of the Tandem Cascade of Banyan-type Networks

    Publication Year: 2005 , Page(s): 11 - 15
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (208 KB) |  | HTML iconHTML  

    The cascade of two 2^n × 2^n baseline networks in tandem and the cascade of two omega networks through a special interconnection pattern are known to be rearrangeable. These belong to the general problem: for what two banyan-type networks (i.e., bitpermuting unique-routing network) are their tandem cascade a rearrangeable network? We relate the problem to the trace and guide of banyan-type ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ReCord: A Distributed Hash Table with Recursive Structure

    Publication Year: 2005 , Page(s): 16 - 20
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (232 KB) |  | HTML iconHTML  

    We propose a simple distributed hash table called ReCord, which is a generalized version of Randomized- Chord and offers improved tradeoffs in performance and topology maintenance over existing P2P systems. ReCord is scalable and can be easily implemented as an overlay network, and offers a good tradeoff between the node degree and query latency. For instance, an n-node ReCord with O(log n) node d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Topological Properties and Network Embedding of RP(k)

    Publication Year: 2005 , Page(s): 21 - 25
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (192 KB) |  | HTML iconHTML  

    An interconnection network, RP(k), and its properties are investigated. Two parameters, the closest group and the optimal partition of networks are proposed. It is shown that RP(k) network has high communication efficiency . It is also proven that RP(k) network is a Hamiltonian graph and the ring can be embedded into the RP(k) network with load, expansion, dilation and congestion all equal to 1 ev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory on Switch Preservation under 2-stage Interconnection

    Publication Year: 2005 , Page(s): 26 - 30
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (200 KB) |  | HTML iconHTML  

    The most compact pattern for interconnecting small switches into a large switch is conceivably the 2-stage interconnection network. A certain version of a 2-stage interconnection network is said to preserve switches with a certain attribute when the network constructs such a switch from smaller ones at nodes. Recursive application of this version of 2-stage interconnection then leads to the constr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Reconfigurable Optical Interconnect System for DSAG

    Publication Year: 2005 , Page(s): 31 - 34
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (152 KB) |  | HTML iconHTML  

    High performance computing research is facing challenges and innovation on architecture is urgent. DSAG architecture is proposed and delivers "Architecture on Demand" feature. In DSAG, components in different catalogs are parted, while the ones in same catalog are congregated. This architecture can be enabled by optical interconnect and reconfigurable computing technology. Using advanced optical d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loop Parallelisation for the Jikes RVM

    Publication Year: 2005 , Page(s): 35 - 39
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (248 KB) |  | HTML iconHTML  

    Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallel threads and processors has fewer limitations, but most computer programs tend to be serial in nature. This paper presents a compiler optimisation that at run-time parallelises code inside a JVM and thereby increases the number of threads. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eliminating Inter-Thread Interference in Register File for SMT Processors

    Publication Year: 2005 , Page(s): 40 - 45
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    For simultaneous multithreaded (SMT) processors, a large rename register file (RRF) is indispensable for holding intermediate results of in-flight instructions from multiple threads. Meanwhile, inter-thread interferences lower the efficiency of RRF badly, exacerbating the pressure on RRF design. We propose Thread-Sensitive Register Renaming (TSRR), which tracks the performance variations and dynam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Path Limited Speculation Method for Static/Dynamic Optimization in Multithreaded Systems

    Publication Year: 2005 , Page(s): 46 - 50
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (216 KB) |  | HTML iconHTML  

    Extracting thread-level parallelism, as well as instruction-level one, is greatly expected for modern microprocessors. Speculative multithreading is one of the most hopeful candidates, although, its performance improvement depends on prediction accuracy. On the other hand, profiling techniques can accelerate programs since it can reflect the programs’ actual behavior. This paper focuses our d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Way to High Performance NFS for Clusters

    Publication Year: 2005 , Page(s): 51 - 55
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (192 KB)  

    For its simplicity, reliability and maturity, NFS is widely-used in clusters. However, due to its high overheads and implementation limitations, the standard NFS cannot fully exert the potential abilities provided by multiple network channels and multiple SCSI channels on the server. In this paper, we present a new efficient way to high performance NFS implementation for cluster applications. By a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Parallel Loop Scheduling Scheme on Heterogeneous PC Clusters

    Publication Year: 2005 , Page(s): 56 - 58
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (64 KB)  

    Traditional loop-scheduling schemes are designed for homogeneous computing environments, and are probably not suitable for emerging heterogeneous PC clusters. This paper applies a two-phased method, named HPLS (Hybrid Parallel Loop Scheduling), to heterogeneous PC-cluster environments. The key idea is to distribute most of the workload to each node according to its performance, which is modeled an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Table-Driven Code Optimizer

    Publication Year: 2005 , Page(s): 59 - 64
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (272 KB) |  | HTML iconHTML  

    The Various optimization techniques are deployed in the compilation process of a source program for improving the program’s execution speed and reducing the size of the source code[2]. Of the optimization pattern matching techniques, the string pattern matching technique involves finding an optimal pattern that corresponds to the intermediate code. However, it is deemed inefficient due to exc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Voronoi-Trajectory Based Hybrid Routing (VTBR) Algorithm for Wireless Ad Hoc Networks with Obstacles

    Publication Year: 2005 , Page(s): 65 - 69
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (224 KB) |  | HTML iconHTML  

    Position based routing methods can construct effective routes; however, in some topologies with obstacles, such algorithms may end in failure. In order to avoid stationary obstacles, this paper presents a Voronoi-trajectory based hybrid routing (VTBR) algorithm that combines both proactive and reactive routing strategies to provide high routing performance. If the destination node is within the so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Communication-Induced Checkpointing and Asynchronous Recovery Protocol for Mobile Computing Systems

    Publication Year: 2005 , Page(s): 70 - 74
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (224 KB) |  | HTML iconHTML  

    Mobile computing systems have many constraints such as low battery power, low bandwidth , high mobility and lack of stable storage which are not presented in static distributed systems. In this paper, we propose an efficient communication-induced checkpointing protocol for mobile computing systems. We also propose an asynchronous recovery protocol based on the checkpointing protocol. Mobile suppor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks

    Publication Year: 2005 , Page(s): 75 - 79
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (192 KB) |  | HTML iconHTML  

    In this paper, we propose a distributed broadcasting algorithm for wireless ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. The proposed algorithm is more efficient than the existing broadcasting algorithms in the literatures. That is, the size of the forwarding ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Ring Removal Movement-Based Mobility Location Update Scheme

    Publication Year: 2005 , Page(s): 80 - 84
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (224 KB) |  | HTML iconHTML  

    Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost. In this paper, a ring removal movement-based location update scheme with a selective paging is proposed. This location update scheme reduces the location updates by removing the ring... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monte Carlo Simulation of LEACH Protocol for Wireless Sensor Networks

    Publication Year: 2005 , Page(s): 85 - 88
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (184 KB) |  | HTML iconHTML  

    LEACH protocol for wireless sensor network has attracted intensive attention because of its energy efficient, simplicity and load balancing. LEACH is a cluster-based protocol, and the numbers of cluster heads and cluster members generated by LEACH are important parameters for achieving better performance. This paper presents a simulation analysis of the statistical characteristics of the numbers o... View full abstract»

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