By Topic

The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)

Date 4-6 July 2005

Filter Results

Displaying Results 1 - 25 of 52
  • The 4th International Symposium on Parallel and Distributed Computing - Cover

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (183 KB)
    Freely Available from IEEE
  • The 4th International Symposium on Parallel and Distributed Computing - Title Page

    Publication Year: 2005, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (89 KB)
    Freely Available from IEEE
  • The 4th International Symposium on Parallel and Distributed Computing - Copyright

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • The 4th International Symposium on Parallel and Distributed Computing - Table of contents

    Publication Year: 2005, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (93 KB)
    Freely Available from IEEE
  • General Chairman’s Forward

    Publication Year: 2005, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (20 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • A New Era in Computing: Moving Services onto Grid

    Publication Year: 2005, Page(s): 3
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • New Challenges in Parallel Optimization

    Publication Year: 2005, Page(s): 5
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • From Grid Technologies (in 6th of IST RTD 2002-2006) to knowledge Utility

    Publication Year: 2005, Page(s): 8
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • E-NEXT: Network of Excellence - Emerging Network Technologies

    Publication Year: 2005, Page(s):9 - 10
    Request permission for commercial reuse | PDF file iconPDF (93 KB) | HTML iconHTML
    Freely Available from IEEE
  • Task Scheduling for Dynamic SMP Clusters with Communication on the Fly for Bounded Number of Resources

    Publication Year: 2005, Page(s):13 - 20
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2912 KB) | HTML iconHTML

    The paper presents an algorithm for scheduling parallel tasks in a parallel architecture based on multiple dynamic SMP clusters. Processors can be switched between shared memory modules in the runtime. Memory modules and processors are organized in computational system on chip modules of a fixed size and are inter-connected by a local communication network implemented in a network-on-chip technolo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Java Byte Code Scheduling Based on the Most-Often-Used-Paths in Programs with Branches

    Publication Year: 2005, Page(s):21 - 27
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    The paper presents an introductory optimization algorithm, which can be performed before a Java program is executed in a parallel system. Taking a sequential multithreaded version of a Java program as input information, the aim of the parallel program optimization is to determine an initial distribution of objects on virtual machines so as to decrease direct inter-object communication and balance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Effective Task Scheduling Algorithm for Heterogeneous Computing System

    Publication Year: 2005, Page(s):28 - 38
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph (DAG) onto a distributed system is known to be NP-complete. The complexity of the problem increases when task scheduling is to be done in a heterogeneous computing system, where the processors in the network may not be identical and take different amounts of time to execute the same task. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cellular Nonlinear Network Grids - a new Grid Computing Approach

    Publication Year: 2005, Page(s):39 - 42
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (279 KB) | HTML iconHTML

    Throughout this paper a catenation between the universal paradigm of cellular nonlinear networks (CNN) and the innovative approach of grid computing is given. CNN are a massive parallel solution for solving non-linear problems, modelling complex phenomena in medicine, physics and data analysis as well as for powerful image processing and recognition systems. They usually are simulated on local com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Scalable Grid Replica Optimization Framework

    Publication Year: 2005, Page(s):43 - 50
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    Data grids are becoming a popular infrastructure for distributed, data intensive scientific application. Data access optimization is one of the key features of such systems, as the transfer and access to the huge amounts of data are often the bottleneck of the data intensive tasks. Concept of replication, creation of multiple copies of a data source across multiple grid nodes, was adopted by grid ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Comparative Simulation Analysis of P2P System Architectures

    Publication Year: 2005, Page(s):51 - 57
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    This paper gives a comparative study on multilayer file sharing mechanisms in peer-to-peer (P2P) systems. Based on a well-known P2P system named Gnutella, two system architectures, 1-layer and 2-layer Ngnu architectures are proposed in order to reduce network traffic and to gain better scalability. These architectures can be applied to large-scale systems, such as e-government, e-office and e-libr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive window scheduling for a hierarchical agent system

    Publication Year: 2005, Page(s):58 - 65
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    DIET (distributed interactive engineering toolbox) is a toolbox for the construction of network enabled server (NES) systems. For most NES systems, as for most grid middleware systems, the scheduling system is centralized and can suffer from poor scalability. DIET provides an alternative: low-latency, scalable scheduling services based on a distributed hierarchy of scheduling agents. However, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enforcing consistency during the adaptation of a parallel component

    Publication Year: 2005, Page(s):66 - 73
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    As grid architectures provide execution environments that are distributed, parallel and dynamic, applications require to be not only parallel and distributed, but also able to adapt themselves to their execution environment. This article presents a model for designing self-adaptable parallel components that can be assembled to build applications for grid. This model includes the definition of a co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GMRES Method on Lightweight GRID System

    Publication Year: 2005, Page(s):74 - 82
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse linear systems by the use of a lightweight grid XtremWeb. This global computing platform, just as many popular grid systems, is devoted to multi-parameters generic-applications. We have implemented an important algorithm GMR... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems

    Publication Year: 2005, Page(s):83 - 90
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling problem and was studied extensively resulting in a cohesive theory called divisible load theory (DLT). In this paper, we augment the existing divisible load theory with incentives. We develop a strategyproof mechanism for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Balancing Algorithm in Cluster-based RNA secondary structure Prediction

    Publication Year: 2005, Page(s):91 - 96
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    RNA secondary structure prediction remains one of the most compelling, yet elusive areas of computational biology. Many computational methods have been proposed in an attempt to predict RNA secondary structures. A popular dynamic programming (DP) algorithm uses a stochastic context-free grammar to model RNA secondary structures, its time complexity is O(N4) and spatial complexity is O(N... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ghost Process: a Sound Basis to Implement Process Duplication, Migration and Checkpoint/Restart in Linux Clusters

    Publication Year: 2005, Page(s):97 - 104
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (507 KB) | HTML iconHTML

    Process management mechanisms (process duplication, migration and checkpoint/restart) are very useful for high performance and high availability in clustering systems. The single system image approach aims at providing a global process management service with mechanisms for process checkpoint, process migration and process duplication. In this context, a common mechanism for process virtualization... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Balancing with Migration Based on Synchronizers in PS-GRADE Graphical Tool

    Publication Year: 2005, Page(s):105 - 112
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (478 KB) | HTML iconHTML

    Parallel application control based on application global states is a new concept realized in PS-GRADE. PS-GRADE is a graphical environment for parallel programming, which unifies message passing programming style with control based on global application states. Special processes called synchronizers are responsible for gathering process states, constructing application global states and issuing co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring and improving quality of parallel application monitoring based on global states

    Publication Year: 2005, Page(s):113 - 120
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    Effectiveness of parallel/distributed application control based on predicates defined on application global states depends on the performance of an underlying consistent global state monitoring mechanism. Focusing on strongly consistent global states (SCGS) usage, we introduce three measures of SCGS monitoring quality. They reflect delay, state information ageing and state inspection frequency exp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Profiling Macro Data Flow Graphs for Parallel Implementation of FDTD Computations

    Publication Year: 2005, Page(s):121 - 130
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (381 KB) | HTML iconHTML

    In this paper, we present methodology, which enables designing and profiling macro data flow graphs that represent computation and communication patterns for the FDTD (finite difference time domain) problem in irregular computational areas. Optimized macro dataflow graphs (MDFG) for FDTD computations are generated in three main phases: generation of initial MDFG based on wave propagation area part... View full abstract»

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