By Topic

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies

Date 20-22 Oct. 2011

Filter Results

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

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

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

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

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

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

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

    Publication Year: 2011, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (107 KB) | HTML iconHTML
    Freely Available from IEEE
  • PDCAT 2011 Conference organization

    Publication Year: 2011, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • PDCAT 2011 Program Committee

    Publication Year: 2011, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • Message from PDGCU 2011 Workshop Chairs

    Publication Year: 2011, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • PDGCU 2011 Workshop Organization

    Publication Year: 2011, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • A Fast Incremental Spectral Clustering for Large Data Sets

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

    Spectral clustering is an emerging research topic that has numerous applications, such as data dimension reduction and image segmentation. In spectral clustering, as new data points are added continuously, dynamic data sets are processed in an on-line way to avoid costly re-computation. In this paper, we propose a new representative measure to compress the original data sets and maintain a set of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamically Accessing Packet Header Fields at High-Speed

    Publication Year: 2011, Page(s):6 - 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    A significant part of packet processing consists of detecting whether certain standard protocol headers are present, where they are located and whether they include optional information. Packet processing programs are on tight time budgets, especially to handle speeds in the gigabits per second (gbps) range. Thus, high-speed mechanisms for finding and accessing headers are critical. Our approach l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Providing Access Control through Program Transformation

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

    This paper proposes a scheme that automatically adds access control code to web service programs. The scheme simplifies the tasks of the programmers. It uses a fine-grained access control policy to control the access to data. The proposed scheme is more flexible than existing schemes in setting access control policies on data. The scheme automatically tracks the flow of data in the server programs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guaranteed Scheduling for (m,k)-firm Deadline-Constrained Real-Time Tasks on Multiprocessors

    Publication Year: 2011, Page(s):18 - 23
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    We present a guaranteed real-time scheduling algorithm for multiple real-time tasks subject to (m,k)-firm deadlines on homogeneous multiprocessors. The scheduling objective of the proposed algorithm is to provide guaranteed performance by bounding the probability of missing (m,k)-firm deadline constraints while improving the probability of deadline satisfactions as much as possible. This goal is e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Distributed Task Migration Scheme for Mesh-Based Chip-Multiprocessors

    Publication Year: 2011, Page(s):24 - 29
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB) | HTML iconHTML

    A task migration scheme for homogeneous chip multiprocessors (CMP) is presented in this paper. The proposed migration mechanism focuses on the communication sub-system and aims to reduce the total power consumption and latency of the network-on-chip (NoC). In this work, starting from an initial mapping, the tasks migrate to new cores in such a way that the distance between the end-point nodes of h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Threat Assessment Based on Alert Verification

    Publication Year: 2011, Page(s):30 - 34
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    In face of overwhelming alerts produced by firewalls or intrusion detection devices, it is difficult to assess network threats that we face. In this paper, we propose a threat assessment approach to estimate the impact of attacks on network. The approach employs the Common Vulnerability Scoring System to quantitatively assess network threats and further correlates alerts with contextual informatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • jMigBSP: Object Migration and Asynchronous One-Sided Communication for BSP Applications

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

    This paper describes the rationale for developing jMigBSP - a Java programming library that offers object rescheduling. It was designed to work on grid computing environments and offers an interface that follows the BSP (Bulk Synchronous Parallel) style. jMigBSP's main contribution focuses on the rescheduling facility in two different ways: (i) by using migration directives on the application code... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation Pattern Driven Reuse of Manual Optimizations for GPGPUs

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

    The wide application of General Purpose Graphic Processing Units (GPGPUs) results in large manual efforts on porting and optimizing algorithms on them. However, most existing automatic ways of generating GPGPU code fail to conduct optimization strategies regarding a specific computation and to reuse constantly evolving manual optimizations. In this paper, we present a computation pattern driven ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reference metadata extraction from scientific papers

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

    Bibliographical information of scientific papers is of great value since the Science Citation Index is introduced to measure research impact. Most scientific documents available on the web are unstructured or semi-structured, and the automatic reference metadata extraction process becomes an important task. This paper describes a framework for automatic reference metadata extraction from scientifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Social Network-Based Information Dissemination Scheme

    Publication Year: 2011, Page(s):50 - 55
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

    Handheld devices can use the Bluetooth technology to exchange information with other. This feature allows that handheld devices to be utilized in disseminating information. A scheme for disseminating information using the handheld devices is proposed. The scheme uses both social network analysis and user activity analysis to deliver information to people who might be interested in the information.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resistence against Malicious Collectives in BubbleTrust

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

    Malicious collectives represent one of the biggest threats for secured P2P applications. In our previous work, we proposed a trust management system called Bubble Trust targeting this problem. In this paper, we investigate the most common malicious strategies as well as the resistance the Bubble Trust uses against them. We created the simulation framework suitable for testing other TMSs in the sam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XunleiProbe: A Sensitive and Accurate Probing on a Large-Scale P2SP System

    Publication Year: 2011, Page(s):62 - 67
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (879 KB) | HTML iconHTML

    Xunlei [1] is a new P2P content distribution system which is popular in China. It composes traditional HTTP/FTP downloading and P2P content distribution features which attract many people including researchers. Xunlei's network is Bit Torrent-like and the measurement is more difficult than other P2P networks [2]. There are many constrains on Xunlei tracker, so we can not obtain information from tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Runtime Fault Detection Method for HPC Cluster

    Publication Year: 2011, Page(s):68 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    As the number of nodes keeps increasing, faults have become commonplace for HPC cluster. For fast recovery from faults, the fault detection method is necessary. Based on the usage patterns of HPC cluster, a automatic runtime fault detection mechanism is proposed in this paper: First, the normal activities for nodes in HPC cluster are modeled using runtime state by clustering analysis, Second, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Multi-constraint Preemption Algorithm for Parallel Job Scheduling

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

    Using effective scheduling strategies to improve turnaround time, slowdown, and utilization is an important consideration in large supercomputing environments. Since such machines have traditionally used non-preemption strategies to accommodate multiple jobs at the same time, a number of questions remain unanswered regarding the practical effect of preemptive scheduling. In this paper, we first di... View full abstract»

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