By Topic

Parallel, Distributed and Network-Based Processing, 2007. PDP '07. 15th EUROMICRO International Conference on

Date 7-9 Feb. 2007

Filter Results

Displaying Results 1 - 25 of 81
  • 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing - Cover

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing - Title

    Publication Year: 2007, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE
  • 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing - Copyright

    Publication Year: 2007, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing - Table of contents

    Publication Year: 2007, Page(s):v - x
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • Program Chairs Preface

    Publication Year: 2007, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (27 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2007, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Special Sessions Committees

    Publication Year: 2007, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2007, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (17 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2007, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • Using Grids for Exploiting Data Abundance in Science

    Publication Year: 2007, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (21 KB) | HTML iconHTML
    Freely Available from IEEE
  • Optimal Kernels to Optimal Solutions: Algorithm and Software Issues in Solver Development

    Publication Year: 2007, Page(s): xviii
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (22 KB) | HTML iconHTML

    Summary form only given. Computer modeling and simulation efforts are most useful when they can provide an optimal solution to a problem. Toward this goal we need a vertical hierarchy of algorithmic capabilities and software tools, all of which must work together to make optimal solutions possible. In this presentation we discuss efforts in the Trilinos project to enable optimal solutions for scie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grid Multi-Resolution Docking

    Publication Year: 2007, Page(s):3 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB) | HTML iconHTML

    Detailed knowledge of macromolecular structure is essential for the understanding of how the cellular machines work. Rigid body fitting is the common way to interpret the information contained in a 3D electron microscope (3DEM) medium-low resolution map in terms of its available atomic structural components. This fitting process, termed multi-resolution docking, consists in localizing atomic resol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the Development Process for CSE Software

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

    Scientific and engineering programming has been around since the beginning of computing, often being the driving force for new system development and innovation. At the same time a continual focus on new modeling capabilities, and some apparent cultural issues, find software processes for many computational science and engineering (CSE) software projects lacking. Certainly there are notable except... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Parallel Sorting Algorithm based on Odd-Even Mergesort

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

    This paper describes a new parallel sorting algorithm, derived from the odd-even mergesort algorithm, named "partition and concurrent merging" (PCM). The proposed algorithm is based on a divide-and-conquer strategy. First, the data sequence to be sorted is decomposed in several pieces that are sorted in parallel using Quicksort. After that, all pieces are merged using a recursive procedure to obta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Grid-based Parallel Approach of the Multi-Objective Branch and Bound

    Publication Year: 2007, Page(s):23 - 30
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB) | HTML iconHTML

    The branch and bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimization problems. This article focuses on the multi-objective version of this algorithm, and proposes a new parallel approach adapted to grid computing systems. This approach addresses several issues related to the characteristics of the algorithm itself and the properties of grid c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Search in Peer-to-Peer Literature Sharing Systems via Semantic Small World

    Publication Year: 2007, Page(s):31 - 38
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (298 KB) | HTML iconHTML

    Efficient search for unstructured peer-to-peer information retrieval systems is a challenging problem. This paper proposes a semantic overlay based on the small world phenomenon that facilitates efficient search for information retrieval in unstructured P2P systems. In the semantic overlay, each node maintains a number of short-range links which are semantically similar to the node, together with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms

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

    In this paper, we study the problem of scheduling file transfers through a switch. This problem is at the heart of a model often used for large grid computations, where the switch represents the core of the network interconnecting the various clusters that compose the grid. We establish several complexity results, and we introduce and analyze various algorithms, from both a theoretical and a pract... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Effective Starvation Avoidance Mechanism to Enhance the Token Coherence Protocol

    Publication Year: 2007, Page(s):47 - 54
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (141 KB) | HTML iconHTML

    Shared-memory multiprocessors are becoming to be formed by an increasingly larger number of nodes. In these systems, implementing cache coherence is a key issue. Token coherence is a low latency cache coherence protocol that avoids indirection for cache-to-cache misses and which does not require a totally-ordered interconnect. When races are rare, the protocol performs well thanks to the performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boosting Ethernet Performance by Segment-Based Routing

    Publication Year: 2007, Page(s):55 - 62
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    Ethernet is turning out to be a cost-effective solution for building cluster networks offering compatibility, simplicity, high bandwidth, scalability and a good performance-to-cost ratio. Nevertheless, Ethernet still makes inefficient use of network resources (links) and suffers from long failure recovery time due to the lack of a suitable routing algorithm. In this paper we embed an efficient rou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Activity Pre-Scheduling in Grid Workflows

    Publication Year: 2007, Page(s):63 - 71
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    Grid computing is becoming a prominent field of interest for distributed systems. The capability to support resource sharing between different organizations and the high level of performance are noteworthy features. However, to define, deploy and execute grid applications require significant design effort and complex resource coordination, which can be alleviated by using workflow management syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differentiated Quality of Service for e-Commerce Applications through Connection Scheduling based on System-Level Thread Priorities

    Publication Year: 2007, Page(s):72 - 76
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (186 KB) | HTML iconHTML

    The e-commerce Web sites receive a great and varied number of visitors every day. These visitors share the application server's limited resources and when there are too many clients connecting to the Web site, it is possible that they hinder between them, even to overload the application server. These visitors can be divided in different categories, depending on their importance from site viewpoin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication Study and Implementation Analysis of Parallel Asynchronous Iterative Algorithms on Message Passing Architectures

    Publication Year: 2007, Page(s):77 - 83
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (179 KB) | HTML iconHTML

    The implementation of parallel asynchronous iterative algorithms on message passing architectures is considered. Several issues related to communication via message passing interfaces or libraries such as MPI-1, MPI-2, PVM or SHMEM are discussed in this survey paper. Practical implementations are proposed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards On-Demand Ubiquitous Metascheduling on Computational Grids

    Publication Year: 2007, Page(s):84 - 90
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1696 KB) | HTML iconHTML

    Grid computing technologies are mature enough to be successfully applied to computationally intensive scientific applications. However, the current process of applying grid computing to them is still hard and difficult for the least experienced users. In this paper we describe the adaptations made to the GMarte metascheduling framework in order to provide an ubiquitous access to its functionality ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Performance Model for Stream-based Computations

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

    Component-based grid applications have complex deployment models. Performance-sensitive decisions should be taken by automatic tools. Such tools must match developer knowledge on component performance with QoS requirements on the applications, in order to find deployment plans that satisfy a service level agreement (SLA). This paper presents a steady state performance model that can be employed to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • pDomus: a prototype for Cluster-oriented Distributed Hash Tables

    Publication Year: 2007, Page(s):97 - 104
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1551 KB) | HTML iconHTML

    The Domus architecture for distributed hash tables (DHTs) is specially designed to support the concurrent deployment of multiple and heterogeneous DHTs, in a dynamic shared-all cluster environment. The execution model is compatible with the simultaneous access of several distributed/parallel client applications to the same or different running DHTs. Support to distributed routing and storage is dy... View full abstract»

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