By Topic

Parallel and Distributed Computing, Applications and Technologies, 2009 International Conference on

Date 8-11 Dec. 2009

Filter Results

Displaying Results 1 - 25 of 102
  • [Front cover]

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (994 KB)  
    Freely Available from IEEE
  • [Title page i]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (10 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (45 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (105 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - xi
    Save to Project icon | Request Permissions | PDF file iconPDF (247 KB)  
    Freely Available from IEEE
  • Message from General Chairs

    Page(s): xii - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (67 KB)  
    Freely Available from IEEE
  • Message from Program Committee Chair

    Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (64 KB)  
    Freely Available from IEEE
  • In Memoriam: Professor Susumu Horiguchi

    Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (59 KB)  
    Freely Available from IEEE
  • PDCAT Organization

    Page(s): xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB)  
    Freely Available from IEEE
  • PDCAT Program Committees

    Page(s): xvii - xix
    Save to Project icon | Request Permissions | PDF file iconPDF (75 KB)  
    Freely Available from IEEE
  • Workshops Committees

    Page(s): xx - xxii
    Save to Project icon | Request Permissions | PDF file iconPDF (82 KB)  
    Freely Available from IEEE
  • Keynote 1: The Role of Functional Memories in Parallel Information Processing with Localized and Distributed Systems

    Page(s): xxiii
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (73 KB)  

    The analysis of parallel information-processing systems, independent of their realization in localized or distributed form, reveals that the necessary data exchange between data-storage and data-processing parts of the system represents a major limiting factor for the system performance. Therefore, in addition to the number-crunching power of the processing parts, innovations which substantially improve the bandwidth of the data exchange are essential for advances in the overall system capabilities. To be practically useful, such innovations must in particular carefully balance the bandwidth of the exchanged data amount against the required power dissipation for this purpose. We review the main methods for achieving the data exchange improvements, namely (a) an increased memory-access bandwidth by multi-porting of the memory and (b) a unification of memory and processing parts of the information-processing system. We further present the advances in VLSI architectures for realizing the higher data-exchange bandwidth by applying advanced nano-technologies and discuss practical implementation examples for parallel processors as well as for pattern-matching and pattern-recognition systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Keynote 2: Pains and Challenges in the Mobile Internet Evolution

    Page(s): xxiv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (70 KB)  

    The mobile Internet evolves drastically in the last decade in Japan. The rapid evolution provides pains and challenges for operators, content providers, and client software technology providers. The CPU and memory size evolve in a scale of thousand times. Display resolution evolves in a slightly modest manner. Restrictions, the speed of change, and the diversity of capabilities continues to provide challenges to software engineering and service engineering. The author will summarize the decade of challenges in software engineering in the mobile handset client side. There are 4 billion mobile handsets on this planet and the media and service impacts of them will exceed those of PCs and TVs. The lessons learned in the mobile Internet evolution about mobile service engineering will be highlighted. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Keynote 3: Computing with Membranes: An Overview

    Page(s): xxv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (68 KB)  

    Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, namely a P system, which abstracts from the way living cells process chemical compounds in their compartmental structure. P systems are a class of distributed maximally parallel computing devices of a biochemical type. We present an overview of the area and discuss recent results that answer some interesting and fundamental open questions concerning these systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 1: Theoretical Aspects of Autonomous Mobile Robots

    Page(s): xxvi
    Save to Project icon | Request Permissions | PDF file iconPDF (61 KB)  
    Freely Available from IEEE
  • Tutorial 1-1: Algorithms for Cooperative Mobile Robots: System Models and Basic Terminology

    Page(s): xxvii
    Save to Project icon | Request Permissions | PDF file iconPDF (72 KB)  
    Freely Available from IEEE
  • Tutorial 1-2: Rendezvous on Faulty Autonomous Mobile Robots

    Page(s): xxviii
    Save to Project icon | Request Permissions | PDF file iconPDF (70 KB)  
    Freely Available from IEEE
  • Tutorial 1-3: Leader Election and Pattern Formation in Swarms of Deterministic Robots

    Page(s): xxix
    Save to Project icon | Request Permissions | PDF file iconPDF (73 KB)  
    Freely Available from IEEE
  • Tutorial 1-4: A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots

    Page(s): xxx
    Save to Project icon | Request Permissions | PDF file iconPDF (71 KB)  
    Freely Available from IEEE
  • Tutorial 2: Queue Machines: An Unknown Alternative

    Page(s): xxxi
    Save to Project icon | Request Permissions | PDF file iconPDF (73 KB)  
    Freely Available from IEEE
  • Tutorial 3: Methodologies and Performance Impacts of General Purpose Computing on GPUs

    Page(s): xxxii
    Save to Project icon | Request Permissions | PDF file iconPDF (74 KB)  
    Freely Available from IEEE
  • Balanced Dense Polynomial Multiplication on Multi-Cores

    Page(s): 1 - 9
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (356 KB) |  | HTML iconHTML  

    In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementation strategies for FFT-based dense polynomial multiplication targeting multi-cores. We show that balanced input data can maximize parallel speedup and minimize cache complexity for bivariate multiplication. However, unbalanced input data, which are common in symbolic computation, are challenging. We provide efficient techniques, what we call contraction and extension, to reduce multivariate (and univariate) multiplication to balanced bivariate multiplication. Our implementation in Cilk++ demonstrates good speedup on multi-cores. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelized Critical Path Search in Electrical Circuit Designs

    Page(s): 10 - 17
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (826 KB) |  | HTML iconHTML  

    For finding the critical path in electrical circuit designs, a shortest-path search must be carried out. This paper introduces a new two-level shortest-path search algorithm specially adapted for parallelization. The proposed algorithm is based on a module-based partitioning algorithm and a shortest-path search parallelized for the usage on multi-core systems. Experimental results show the impact of this approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Evolution of the Non-Parameter Harris Affine Corner Detector: A Distributed Approach

    Page(s): 18 - 25
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (462 KB) |  | HTML iconHTML  

    A parallel version of a new automatic Harris-based corner detector is presented. A scheduler to dynamically and homogeneously distribute high computational workload on heterogeneous parallel architectures such as Grid systems has been implemented to speedup the whole procedure. Experimental results show the robustness of the underlying scheduler, which can be easily exploited in various automatic image analysis systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines

    Page(s): 26 - 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (451 KB) |  | HTML iconHTML  

    We consider the parallel computing environment where m organizations provide machines and several jobs to be executed. While cooperation of organizations is required to minimize the global makespan, each organization also expects the faster completion of its own jobs primarily and thus it is not necessarily cooperative. To handle the situations, we formulate the ¿-cooperative multi-organization scheduling problem (¿-MOSP), where ¿ ¿ 1 is a parameter representing the degree of cooperativeness. ¿-MOSP minimizes the makespan under the cooperation constraint that each organization does not allow the completion time of its own jobs to be delayed ¿ times of that in the case where those jobs are executed by itself. In this paper, we aim to reveal the relation between the makespan and the degree of cooperativeness. First, we investigate the relation between ¿ and the quality of the global makespan. For ¿ = 1 (i.e., each organization never sacrifices its completion time), we show an instance where the cooperation constraint degrades the optimal makespan by m times. In contrast, for ¿ > 1, we can construct an algorithm transforming any unconstrained schedule to one satisfying the cooperation constraint. This algorithm bounds the degradation ratio by ¿/(¿ - 1), which implies that weak cooperation improves the makespan dramatically. Second, we study the complexity of ¿-MOSP. We show its strongly NPhardness and inapproximability for the approximation factor less than max{(¿ + l)/¿, 3/2}. We also show the hardness of transformation: Even if an optimal schedule under no cooperation constraint is given, no polynomial-time algorithm finds an optimal schedule for ¿-MOSP. This result is a witness for inexistence of general polynomial-time transformation algorithms that preserve the approximation ratio. View full abstract»

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