By Topic

2005 International Conference on Parallel Processing (ICPP'05)

14-17 June 2005

Filter Results

Displaying Results 1 - 25 of 79
  • Proceedings. 2005 International Conference on Parallel Processing

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • 2005 International Conference on Parallel Processing - Title Page

    Publication Year: 2005, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • 2005 International Conference on Parallel Processing - Copyright Page

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • 2005 International Conference on Parallel Processing - Table of contents

    Publication Year: 2005, Page(s):v - x
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • Message from the General Co-Chairs

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (23 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Co-Chairs

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

    Publication Year: 2005, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2005, Page(s):xv - xvi
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2005, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (21 KB)
    Freely Available from IEEE
  • SAREC: a security-aware scheduling strategy for real-time applications on clusters

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

    Security requirements of security-critical real-time applications must be met in addition to satisfying timing constraints. However, conventional real-time scheduling algorithms ignore the applications' security requirements. In recognition that an increasing number of applications running on clusters demand both real-time performance and security, we investigate the problem of scheduling a set of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiprocessor energy-efficient scheduling for real-time tasks with different power characteristics

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

    In the past decades, a number of research results have been reported for energy-efficient scheduling over uniprocessor and multiprocessor environments. Different from many of the past results on the assumption for task power characteristics, we consider real-time scheduling of tasks with different power characteristics. The objective is to minimize the energy consumption of task executions under t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A utility-based two level market solution for optimal resource allocation in computational grid

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

    The paper presents a market oriented resource allocation strategy for grid resource. The proposed model uses the utility functions for calculating the utility of a resource allocation. This allows the integration of different optimization objectives into allocation process. This paper is target to solve above issues by using utility-based optimization scheme. We decompose the optimization problem ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-tier resource allocation for slowdown differentiation on server clusters

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

    Slowdown, defined as the ratio of a request's queueing delay to its service time, is accepted as an important quality of service metric of Internet servers. In this paper, we investigate the problem of providing proportional slowdown differentiation (PSD) services to various applications and clients on cluster-based Internet servers. We extend a closed-form expression of the expected slowdown of a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of overlay multicast protocol for multimedia streaming

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

    In this paper, we propose a new protocol called shared tree streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decentralized protocol that constructs a shared tree called s-DBMDT (sender-dependent degree-bounded minimum diameter tree) as an overlay network that involves all the participants of the application. For a given set of nodes ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding a cluster-based overlay mesh in mobile ad hoc networks without cluster heads

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

    One strategy to tackle the complexity and scalability issue in large-scale mobile ad hoc networks (MANETs) is to use extra layers of abstraction. A common tactic is to group the nodes in the network into clusters. The clusters and the paths between them constitute an extra layer of overlay abstraction. To maintain the overlay structure, a head node is often elected in each cluster. The head nodes ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring processor design options for Java-based middleware

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

    Java-based middleware is a rapidly growing workload for high-end server processors, particularly chip multiprocessors (CMP). To help architects design future microprocessors to run this important new workload, we provide a detailed characterization of two popular Java server benchmarks, ECperf and SPECjbb2000. We first estimate the amount of instruction-level parallelism in these workloads by simu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A vector-μSIMD-VLIW architecture for multimedia applications

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

    Media processing has motivated strong changes in the focus and design of processors. These applications are composed of heterogeneous regions of code, some of them with high levels of DLP and other ones with only modest amounts of ILP. A common approach to deal with these applications are μSIMD-VLIWprocessors. However, the ILP regions fail to scale when we increase the width of the machine, whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design tradeoffs for BLAS operations on reconfigurable hardware

    Publication Year: 2005, Page(s):78 - 86
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    Numerical linear algebra operations are key primitives in scientific computing. Performance optimizations of such operations have been extensively investigated and some basic operations have been implemented as software libraries. With the rapid advances in technology, hardware acceleration of linear algebra applications using FPGAs (field programmable gate arrays) has become feasible. In this pap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timing high performance kernels through empirical compilation

    Publication Year: 2005, Page(s):89 - 98
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    There are a few application areas, which remain almost untouched by the historical and continuing advancement of compilation research. For the extremes of optimization required for high performance computing on one end, and embedded systems at the opposite end of the spectrum, many critical routines are still hand-tuned, often directly in assembly. At the same time, architecture implementations ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel approach for detecting heap-based loop-carried dependences

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

    The problem of data dependences in pointer-based codes is crucial to various compiler optimizations. The approach presented in this paper focus on detecting data dependences induced by heap-directed pointers on loops that access dynamic data structures. Knowledge about the shape of the data structure accessible from a heap-directed pointer provides critical information for disambiguating heap acce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling loop fusion and tiling for cache performance by fixing fusion-preventing data dependences

    Publication Year: 2005, Page(s):107 - 115
    Cited by:  Papers (2)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    This paper presents a new approach to enabling loop fusion and tiling for arbitrary affine loop nests. Given a set of multiple loop nests, we present techniques that automatically eliminate all the fusion-preventing dependences by means of loop tiling and array copying. Applying our techniques iteratively to multiple loop nests yields a single loop nest that can be tiled for cache locality. Our ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated performance monitoring of a cosmology application on leading HEC platforms

    Publication Year: 2005, Page(s):119 - 128
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB) | HTML iconHTML

    The cosmic microwave background (CMB) is an exquisitely sensitive probe of the fundamental parameters of cosmology. Extracting this information is computationally intensive, requiring massively parallel computing and sophisticated numerical algorithms. In this work we present MADbench, a lightweight version of the MADCAP CMB power spectrum estimation code that retains the operational complexity an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First evaluation of parallel methods of automatic global image registration based on wavelets

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

    With the increasing importance of multiple multiplatform remote sensing missions, fast and automatic integration of digital data from disparate sources has become critical to the success of these endeavors. Firstly, an overview of development of automatic and parallel global image registration is given. And then, based on the analyses of existing three parallel methods of wavelet-based global regi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithm and implementation for realtime dynamic simulation of power system

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

    As power systems continue to develop, realtime simulation and online dynamic security analysis using parallel computing are becoming increasingly important. This paper presents a novel multilevel partition scheme for parallel computing based on power network regional characteristics and describes the design and implementation of a hierarchical block bordered diagonal form (BBDF) algorithm for powe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristics for profile-driven method-level speculative parallelization

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

    Thread level speculation (TLS) is an effective technique for extracting parallelism from sequential code. Method calls provide good templates for the boundaries of speculative threads as they often describe independent tasks. However, selecting the most profitable methods to speculate on is difficult as it involves complicated trade-offs between speculation violations, thread overheads, and resour... View full abstract»

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