By Topic

2009 15th International Conference on Parallel and Distributed Systems

8-11 Dec. 2009

Filter Results

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

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

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

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

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

    Publication Year: 2009, Page(s):v - xv
    Request permission for commercial reuse | PDF file iconPDF (189 KB)
    Freely Available from IEEE
  • Message from the General and Program Co-Chairs

    Publication Year: 2009, Page(s):xvi - xvii
    Request permission for commercial reuse | PDF file iconPDF (114 KB) | HTML iconHTML
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2009, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Keynote

    Publication Year: 2009, Page(s): xix
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (79 KB)

    We will share or experience at simplifying the programming of applications that are distributed on local area network (LAN), on cluster of workstations, or grids, and of course, clouds. We will promote a kind of approach, network on chip, to cope seamlessly with both distributed and shared-memory multi-core machines. A theoretical foundation ensures constant behavior, whatever the environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prediction-Based Prefetching to Support VCR-like Operations in Gossip-Based P2P VoD Systems

    Publication Year: 2009, Page(s):1 - 8
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    Supporting free VCR-like operations in P2P VoD streaming systems is challenging. The uncertainty of frequent VCR operations makes it difficult to provide high quality realtime streaming services over distributed self-organized P2P overlay networks. Recently, prefetching has emerged as a promising approach to smooth the streaming quality. However, how to efficiently and effectively prefetch suitabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quality of Service in Peer-to-Peer IPTV Networks

    Publication Year: 2009, Page(s):9 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    In Peer-to-peer (P2P) IPTV networks, jitter rate is one of the most important metrics for Quality of Service. In this paper, we develop a new approach to estimate jitter rate during playback. Unlike traditional approaches that focus on the download speed, our method relies on the distribution of peer download latencies. We demonstrated how to apply the proposed methodologies in a real-life environ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized Adaptive Routing for Reliability in Event Broker Networks

    Publication Year: 2009, Page(s):18 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (258 KB) | HTML iconHTML

    Guaranteeing quality of service (QoS) for event delivery has been recognized as an important but challenging issue in event based middleware (EBM), that is responsible for routing events from publishers to subscribers over an event broker network. Amongst the numerous QoS parameters, in our work, we focus on reliability as a service guarantee to subscribers in an EBM. We add to the existing body o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Robust Mapping of Dynamic Programming onto a Graphics Processing Unit

    Publication Year: 2009, Page(s):26 - 33
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2458 KB) | HTML iconHTML

    Graphics processing units (GPUs) have been widely used to accelerate algorithms that exhibit massive data parallelism or task parallelism. When such parallelism is not inherent in an algorithm, computational scientists resort to simply replicating the algorithm on every multiprocessor of a NVIDIA GPU, for example, to create such parallelism, resulting in embarrassingly parallel ensemble runs that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CUDA Accelerated LTL Model Checking

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

    Recent technological developments made available various many-core hardware platforms. For example, a SIMD-like hardware architecture became easily accessible for many users who have their computers equipped with modern NVIDIA GPU cards with CUDA technology. In this paper we redesign the maximal accepting predecessors algorithm for LTL model checking in terms of matrix-vector product in order to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Performance of Matrix Multiplication and FFT on GPU

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

    In this paper we discuss about our experiences in improving the performance of two key algorithms: the single-precision matrix-matrix multiplication subprogram (SGEMM of BLAS) and single-precision FFT using CUDA. The former is computation-intensive, while the latter is memory bandwidth or communication-intensive. A peak performance of 393 Gflops is achieved on NVIDIA GeForce GTX280 for the former,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible Multi-link Ethernet Binding System for PC Clusters with Asymmetric Topology

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

    In current high-performance PC clusters, the performance and cost of interconnection network are essential issues. Very cost-effective Ethernets, such as Gigabit Ethernet, as well as high performance SANs, such as Infiniband and Myrinet, are still widely used. The authors have been developing a multi-link binding network system for Ethernet, called RI2N, for high-throughput and fault-tolerant inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of ConnectX Virtual Protocol Interconnect for Data Centers

    Publication Year: 2009, Page(s):57 - 64
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB) | HTML iconHTML

    With the emergence of new technologies such as Virtual Protocol Interconnect (VPI) for the modern data center, the separation between commodity networking technology and high-performance interconnects is shrinking. With VPI, a single network adapter on a data center server can easily be configured to use one port to interface with Ethernet traffic and another port to interface with high-bandwidth,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • uStream: A User-Level Stream Protocol over Infiniband

    Publication Year: 2009, Page(s):65 - 71
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (514 KB) | HTML iconHTML

    As one of the most popular high speed networks, InfiniBand demonstrates several enhanced features, such as RDMA and zero-copy mechanisms, which offer high bandwidth and low latency. Communication stacks IPoIB and SDP (Sockets Direct Protocol) have been proposed on InfiniBand for sockets based applications to take advantage of these features. However, these protocols are inefficient to utilize the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WormCircle: Connectivity-Based Wormhole Detection in Wireless Ad Hoc and Sensor Networks

    Publication Year: 2009, Page(s):72 - 79
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (931 KB) | HTML iconHTML

    Wormhole attack is a severe threat against wireless ad hoc and sensor networks. It can be launched without compromising any legitimate node or cryptographic mechanisms, and often serves as a stepping stone for many serious attacks. Most existing countermeasures often make critical assumptions or require specialized hardware devices in the network. Those assumptions and requirements limit the appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcasting with Optimized Transmission Efficiency in 3-Dimensional Wireless Networks

    Publication Year: 2009, Page(s):80 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1103 KB) | HTML iconHTML

    Broadcasting is one of the most important operations in the wireless network for disseminating information throughout the entire network. Flooding is a simple mechanism to realize broadcasting, but it has high redundancy of retransmissions, leading to low transmission efficiency. Many broadcast protocols have been proposed for pursuing optimized transmission efficiency for wireless networks hypoth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contour-cast: Location-free Data Dissemination and Discovery for Wireless Sensor Networks

    Publication Year: 2009, Page(s):88 - 95
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB) | HTML iconHTML

    Data dissemination and discovery is critical for ad-hoc wireless sensor networks. Most existing research depends on location information that is not always obtained easily, efficiently and accurately. We propose the concept of Contour-cast, a location-free data dissemination and discovery approach for large-scale wireless sensor networks. One important property of Contour-cast is that it does not ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing Base Station Deployment in Wireless Sensor Networks Under One-hop and Multi-hop Communication Models

    Publication Year: 2009, Page(s):96 - 103
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    Sensor network lifetime is largely affected by the energy consumption for data transmission from sensor nodes to a base station. We generalize and solve the problems of deploying multiple base stations in sensor networks using one-hop and multi-hop communication models to maximize network lifetime. Under the one-hop communication model, the sensors far away from base stations always deplete their ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing Memory Access Schedule for Memories

    Publication Year: 2009, Page(s):104 - 111
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    According to the characteristics of the "3-D" structure of contemporary DRAM chips, the row first column ordered (RFCO) algorithm is proposed in this paper to minimize memory access schedule length. In memory systems with a single memory controller, assuming that the memory access trace is known before scheduling, the RFCO algorithm can generate schedules which are 7.89% shorter than burst schedul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When Misses Differ: Investigating Impact of Cache Misses on Observed Performance

    Publication Year: 2009, Page(s):112 - 119
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    Although modeling of memory caches for the purpose of cache design and process scheduling has advanced considerably, the effects of cache sharing are still not captured by common approaches to modeling of software performance. One of the obstacles is lack of information about the relationship between cache misses, which the cache models usually describe, and the timing penalties, which the perform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Light-weight Code Cache Design for Dynamic Binary Translation

    Publication Year: 2009, Page(s):120 - 125
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (393 KB) | HTML iconHTML

    Interpretation and basic block translation (BBT) are two typical strategies for cold code emulation in a dynamic binary translation (DBT) system. More and more DBT systems employ BBT as the generated native code runs more efficient than the interpretation routines. We observe that BBT's high efficiency is based on those special hardware assists. With certain simple hardware techniques, interpretat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Snooping and Ordering Ring - An Efficient Cache Coherence Protocol for Ring Connected CMP

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

    Ring is a promising on-chip interconnection for CMP. It is more scalable than bus and much simpler than packet-switched networks. The ordering property of ring can be used to optimize cache coherence protocol design. Existing ring protocols, such as the snooping ring protocol and the ring-order protocol need a retry and acknowledgement scheme or use the ordering property of the ring respectively t... View full abstract»

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