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

8-11 Dec. 2009

Filter Results

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

    Publication Year: 2009, Page(s): C1
    Request permission for reuse | PDF file iconPDF (994 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for reuse | PDF file iconPDF (10 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009, Page(s): iii
    Request permission for reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for reuse | PDF file iconPDF (105 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):v - xi
    Request permission for reuse | PDF file iconPDF (247 KB)
    Freely Available from IEEE
  • Message from General Chairs

    Publication Year: 2009, Page(s):xii - xiii
    Request permission for reuse | PDF file iconPDF (67 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from Program Committee Chair

    Publication Year: 2009, Page(s): xiv
    Request permission for reuse | PDF file iconPDF (64 KB) | HTML iconHTML
    Freely Available from IEEE
  • In Memoriam: Professor Susumu Horiguchi

    Publication Year: 2009, Page(s): xv
    Request permission for reuse | PDF file iconPDF (59 KB) | HTML iconHTML
    Freely Available from IEEE
  • PDCAT Organization

    Publication Year: 2009, Page(s): xvi
    Request permission for reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • PDCAT Program Committees

    Publication Year: 2009, Page(s):xvii - xix
    Request permission for reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • Workshops Committees

    Publication Year: 2009, Page(s):xx - xxii
    Request permission for reuse | 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

    Publication Year: 2009, Page(s): xxiii
    Request permission for reuse | Click to expandAbstract | 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 i... 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

    Publication Year: 2009, Page(s): xxiv
    Request permission for reuse | Click to expandAbstract | 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 provid... 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

    Publication Year: 2009, Page(s): xxv
    Request permission for reuse | Click to expandAbstract | 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 ... 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

    Publication Year: 2009, Page(s): xxvi
    Request permission for reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • Tutorial 1-1: Algorithms for Cooperative Mobile Robots: System Models and Basic Terminology

    Publication Year: 2009, Page(s): xxvii
    Request permission for reuse | PDF file iconPDF (72 KB)
    Freely Available from IEEE
  • Tutorial 1-2: Rendezvous on Faulty Autonomous Mobile Robots

    Publication Year: 2009, Page(s): xxviii
    Request permission for reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Tutorial 1-3: Leader Election and Pattern Formation in Swarms of Deterministic Robots

    Publication Year: 2009, Page(s): xxix
    Request permission for reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • Tutorial 1-4: A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots

    Publication Year: 2009, Page(s): xxx
    Request permission for reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • Tutorial 2: Queue Machines: An Unknown Alternative

    Publication Year: 2009, Page(s): xxxi
    Request permission for reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • Tutorial 3: Methodologies and Performance Impacts of General Purpose Computing on GPUs

    Publication Year: 2009, Page(s): xxxii
    Request permission for reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Balanced Dense Polynomial Multiplication on Multi-Cores

    Publication Year: 2009, Page(s):1 - 9
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | 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 d... 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

    Publication Year: 2009, Page(s):10 - 17
    Request permission for reuse | Click to expandAbstract | 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 ... 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

    Publication Year: 2009, Page(s):18 - 25
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | 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 ... 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

    Publication Year: 2009, Page(s):26 - 33
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | 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 sc... View full abstract»

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