By Topic

Parallel and Distributed Computing, 2004. Third International Symposium on/Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks, 2004. Third International Workshop on

Date 7-7 July 2004

Filter Results

Displaying Results 1 - 25 of 58
  • ISPDC 2004. Third International Symposium on Parallel and Distributed Computing/HeteroPar '04. Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogenous Networks

    Publication Year: 2004
    Request permission for commercial reuse | PDF file iconPDF (79 KB)
    Freely Available from IEEE
  • Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks - Title Page

    Publication Year: 2004, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks - Copyright Page

    Publication Year: 2004, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (42 KB)
    Freely Available from IEEE
  • Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks - Table of contents

    Publication Year: 2004, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • Foreword by the Chairman

    Publication Year: 2004, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (17 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the HeteroPar’04 Co-Chairs

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

    Publication Year: 2004, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • The robustness of resource allocation in parallel and distributed computing systems

    Publication Year: 2004, Page(s):2 - 10
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    This paper gives an overview of the material to be discussed in the invited keynote presentation by H. J. Siegel. Performing computing and communication tasks on parallel and distributed systems involves the coordinated use of different types of machines, networks, interfaces, and other resources. Decisions about how best to allocate resources are often based on estimated values of task and system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formalism for context-aware mobile computing

    Publication Year: 2004, Page(s):14 - 21
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB) | HTML iconHTML

    Mobile devices, such as mobile phones and PDAs, have gained wide-spread popularity. Applications for this kind of mobile devices have to adapt to changes in context, such as variations in network bandwidth, battery power, connectivity, reachability of services and hosts, and so on. In this paper, we define context-aware action systems that provides a systematic method for managing and processing c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new model for 3D cellular mobile networks

    Publication Year: 2004, Page(s):22 - 28
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    In this work, we propose to extend the standard concept of planar cellular networks into space. Indeed, in cellular networks the trend is to have smaller cells for indoor environment. Then, we give a description of a 3D picocellular network based on layers of hexagonal mesh to ensure that challenge. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voronoi mobile cellular networks: topological properties

    Publication Year: 2004, Page(s):29 - 35
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    Nowadays, mobile cellular networks are based on the well-known hexagonal mesh in which nodes are considered as base stations. However, this model does not really take into account the irregularity and the randomness of central offices locations in a large telephone network. As we cannot transform this telephone network into a regular structure, because of spatial variations of population density, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel framework for ant-like algorithms

    Publication Year: 2004, Page(s):36 - 41
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB) | HTML iconHTML

    This paper describes the work of an objective framework designed to be used in the parallelization of a set of related algorithms. As a concrete application a parallel ant colony optimization algorithm (ACO) for the travelling salesman problem (TSP) is presented. The idea behind the system we are describing is to have a reusable framework for running several sequential algorithms in a parallel env... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal certificate dispersal algorithm for mobile ad hoc networks

    Publication Year: 2004, Page(s):42 - 48
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    We focus on the problem that in an ad hoc network, how to send a message securely between two users using the certificate dispersal system. In this paper, we construct two efficient certificate dispersal algorithms. We can prove that for a strongly connected graph G = (V, E) and a directed graph H= (V', E'), new upper bounds on dispersability cost on the average number of certificates stored in on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing the efficiency of JADE agent platform

    Publication Year: 2004, Page(s):49 - 56
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    Agent oriented programming is often described as the next breakthrough in development and implementation of large-scale complex software system. At the same time it is rather difficult to find successful applications of agent technology, in particular precisely when large-scale systems are considered. The aim of this paper is to investigate if one of the possible limits may be the scalability of e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a J2EE cluster for parallel computation of join queries in distributed databases

    Publication Year: 2004, Page(s):58 - 63
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    In here we consider the problem of parallel execution of Join operation by a J2EE cluster. J2EE clusters are intended for coarse-grain distributed processing of multiple queries/business transactions over the Web. Thus, the possibility of using a J2EE cluster for fine-grain parallel computations (parallel Joins in our case) is intriguing and of practical interest. We have developed a new variant o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating a workstation CPU assignment with the DYPAP monitor

    Publication Year: 2004, Page(s):64 - 70
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    The task of finding the least loaded node on a cluster or Grid computing system is necessary in load balancing and scheduling algorithms. Therefore, the lint step in these algorithms is usually a prediction of the CPU assignment or availability for a new task on each system node (inversely related to its workload). This paper presents the DYPAP monitor; a real-time monitoring utility responsible f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RSCS: a parallel simplex algorithm for the Nimrod/O optimization toolset

    Publication Year: 2004, Page(s):71 - 78
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    This paper describes a method of parallelisation of the popular Nelder-Mead simplex optimization algorithms that can lead to enhanced performance on parallel and distributed computing resources. A reducing set of simplex vertices are used to derive search directions generally closely aligned with the local gradient. When tested on a range of problems drawn from real-world applications in science a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculating Smarandache function in parallel

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

    This article presents an efficient method to calculate in parallel the values of the Smarandache function S(i), i = 1, 2, ..., n. The value S(i) can be sequentially found with a complexity of i/(log i). The computation has an important constraint, which is to have consecutive values computed by the same processor. This makes the dynamic scheduling methods inapplicable. The proposed solution is bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving the Langford problem in parallel

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

    In this paper, the parallel resolution of the Langford problem is studied. Two different approaches are developed. First, an explicit construction of all the solutions is done using a shared memory. The application associated to this approach is written in C using the standard OpenMP library. Second, a parallelization of the algebraic method introduced by Godfrey is proposed. The application is ta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed shared memory system based on the Maestro2 high performance cluster network

    Publication Year: 2004, Page(s):91 - 96
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Cluster computing has become a valid alternative for high performance computing. To fully exploit the computing power of these environments, one must utilize high performance network and protocol technologies, since parallel applications running on clusters require low latency and high throughput. To address this issue, Maestro2 high performance network technology has been developed. Parallel appl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic SMP clusters with communication on the fly in NoC technology for very fine grain computations

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

    The paper presents a new architecture for systems based on run-time reconfigured shared memory processor clusters meant for implementation using network on chip technology. Clusters constitute local data exchange sub-networks, which dynamically connect processors with shared memory modules. The sub-networks enable exposure of data from one processor's data cache for reading by other processors to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A near lower-bound complexity algorithm for compile-time task-scheduling in heterogeneous computing systems

    Publication Year: 2004, Page(s):106 - 113
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    Task scheduling is in general an NP-complete problem. For this reason a huge number of heuristics have been presented in the literature to obtain near optimal schedules. These heuristics mainly target homogeneous computing systems, while a few of them target heterogeneous systems. The heterogeneous heuristics presented so far target computing machines with different capabilities, while almost none... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel algorithm for multilevel k-way hypergraph partitioning

    Publication Year: 2004, Page(s):114 - 121
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    In this paper we present a coarse-grained parallel multi-level algorithm for the k-way hypergraph partitioning problem. The algorithm significantly improves on our previous work in terms of run time and scalability behaviour by improving processor utilisation, reducing synchronisation overhead and avoiding disk contention. The new algorithm is also generally applicable and no longer requires a par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • JIST: just-in-time scheduling translation for parallel processors

    Publication Year: 2004, Page(s):122 - 132
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    The application fields of bytecode virtual machines and VLIW processors overlap in the area of embedded and mobile systems, where the two technologies offer different benefits, namely high code portability, low power consumption and reduced hardware cost. Dynamic compilation makes it possible to bridge the gap between the two technologies, but special attention must be paid to software instruction... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data partitioning with a realistic performance model of networks of heterogeneous computers with task size limits

    Publication Year: 2004, Page(s):133 - 140
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    The paper presents a performance model that can be used to optimally schedule arbitrary tasks on a network of heterogeneous computers when there is an upper bound on the size of the task that can be solved by each computer. We formulate a problem of partitioning of an n-element set over p heterogeneous processors using this advanced performance model and give its efficient solution of the complexi... View full abstract»

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