2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies

9-11 Dec. 2014

Filter Results

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

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

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

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

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

    Publication Year: 2014, Page(s):v - viii
    Request permission for reuse | PDF file iconPDF (136 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2014, Page(s): ix
    Request permission for reuse | PDF file iconPDF (89 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Organizing Committee

    Publication Year: 2014, Page(s): x
    Request permission for reuse | PDF file iconPDF (109 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2014, Page(s): xi
    Request permission for reuse | PDF file iconPDF (93 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2014, Page(s): xii
    Request permission for reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Keynote Talk: Efficiency of Resource Abundant Clouds by Albert Y. Zomaya

    Publication Year: 2014, Page(s): xiii
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (80 KB) | HTML iconHTML

    Summary form only given: The cloud is well known for its elasticity by leveraging abundant resources. Cloud data centres easily host thousands or even millions of multicore servers. Further, these servers are increasingly virtualized for the sake of data centre efficiency. However, the reality is that these resources are often relentlessly exploited particularly to improve applications performance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Invited Talk: Future Distributed Applications Based on Mobile Cloud Computing and Software-Defined Networks by Sergei Gorlatch

    Publication Year: 2014, Page(s): xiv
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (82 KB) | HTML iconHTML

    We consider an emerging class of challenging networked applications called Real-Time Online Interactive Applications (ROIA). ROIA are networked applications connecting a potentially very high number of users who interact with the application and with each other in real time, i.e., a response to a user's action happens virtually immediately. Typical representatives of ROIA are multiplayer online co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Density Based Clustering Algorithm and its Parallelization

    Publication Year: 2014, Page(s):1 - 6
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (364 KB) | HTML iconHTML

    K-Means, a simple but effective clustering algorithm, is widely used in data mining, machine learning and computer vision community. K-Means algorithm consists of initialization of cluster centers and iteration. The initial cluster centers have a great impact on cluster result and algorithm efficiency. More appropriate initial centers of k-Means can get closer to the optimum solution, and even muc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Segmentation Pattern Based Approach to Automated Protocol Identification

    Publication Year: 2014, Page(s):7 - 12
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    In-depth understanding of network traffic is important for a variety of applications, such as network management and network security. In this paper, we propose a novel protocol identification system PSKS, which relies on the statistical signatures of network packet payloads. The proposed approach is based on the key insight that message segmentation patterns can be leveraged for accurate applicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access-Efficient QoS-Aware Data Replication to Maximize User Satisfaction in Cloud Computing Environments

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

    Cloud computing infrastructures capable of providing scalable storage and computing resources can efficiently be used for big data storage and processing. There are growing trends in developing data-intensive (big data) applications in this computing environment that need to access massive datasets. Hence, effective data management such as data availability and efficient accesses has become critic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth Modeling in Large Distributed Systems for Big Data Applications

    Publication Year: 2014, Page(s):21 - 27
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (494 KB) | HTML iconHTML

    The emergence of Big Data applications provides new challenges in data management such as processing and movement of masses of data. Volunteer computing has proven itself as a distributed paradigm that can fully support Big Data generation. This paradigm uses a large number of heterogeneous and unreliable Internet-connected hosts to provide Peta-scale computing power for scientific projects. With ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benchmarking and Analysis of Variations of Work Stealing Scheduler on Clustered System

    Publication Year: 2014, Page(s):28 - 35
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    Classical work stealing is an efficient dynamic load-balancing technique in shared memory multiprocessor or multicore system. But the performance of the same classical work scheduling on cluster chip multicore is not appreciable. So modification to this is necessary to improve performance. In this paper, we have discussed many earlier proposed modifications, and also proposed some simplistic modif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict-Free Code Block Scheduling to Hide SpMT Inter-Core Register Sync Delay

    Publication Year: 2014, Page(s):36 - 41
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (191 KB) | HTML iconHTML

    Speculative Multi-Threading (SpMT) is a promising technology to harness the growing number of cores in modern CPUs by exploiting the available parallelism out of sequential threads. And with SpMT, the inter-dependent fine-grain threads on different cores need to sync their input and output registers. Inter-core register sync is quite expensive, and heavily impacts the overall performance. We propo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dealing with Skewed Data in Structured Overlays Using Variable Hash Functions

    Publication Year: 2014, Page(s):42 - 48
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1424 KB) | HTML iconHTML

    Storing highly skewed data in a distributed system has become a very frequent issue, in particular with the emergence of semantic Web and Big Data. This often leads to biased data dissemination among nodes. Addressing load imbalance is necessary, especially to minimize response time and avoid workload being handled by only one or few nodes. Our contribution aims at dynamically managing load imbala... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributive Interoperable Executive Library (DIEL) for Systems of Multiphysics Simulation

    Publication Year: 2014, Page(s):49 - 55
    Cited by:  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1307 KB) | HTML iconHTML

    As HPC capability and software adaptability continues to expand, the interest to perform complex system-wide simulations involving multiple interacting components grows. In this paper, we present a novel integrative software platform -- the Distributive Interoperable Executive Library (DIEL) - to facilitate the collaboration, exploration, and execution of multiphysics modeling projects suited for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Shallow-Light Steiner Tree Problem

    Publication Year: 2014, Page(s):56 - 60
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (189 KB) | HTML iconHTML

    Let G = (V, E) be a given graph with nonnegative integral edge cost and delay, S ⊆ V be a terminal set and r ∈ S be the selected root. The shallow-light Steiner tree (SLST) problem is to compute a minimum cost tree spanning the terminals of S, such that the delay between r and every other terminal is bounded by a given delay constraint D ∈ ℤ0+. It is known that the SLST probl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Aware Scheduling for Sensor Node Platforms

    Publication Year: 2014, Page(s):61 - 68
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    This paper primarily presents a technique to integrate energy-aware real-time scheduling into battery-powered sensor node platforms. The proposed scheduling technique attempts to achieve energy savings while meeting timing requirements of real-time tasks as well as improving the response time of non-real-time tasks. The proposed energy-aware real-time scheduling technique is addressed from two per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast ICA on Modern GPU Architectures

    Publication Year: 2014, Page(s):69 - 75
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (3417 KB) | HTML iconHTML

    Blind Signal Separation is an algorithmic problem class that deals with the restoration of original signal data from a signal mixture. Implementations, such as Fast ICA, are optimized for parallelization on CPU or first-generation GPU hardware. With the advent of modern, compute centered GPU hardware with powerful features such as dynamic parallelism support, these solutions no longer leverage the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs

    Publication Year: 2014, Page(s):76 - 81
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    In a parallel processing system, a pancake graph is one of the superior topologies for interconnection network because of the small diameter and the high degree. In previous research, fault-tolerant routing using restricted global information called safety levels in a pancake graph was proposed. But there are some rooms for improvement. Therefore, we propose a fault-tolerant routing algorithm base... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improve LLC Bypassing Performance by Memory Controller Improvements in Heterogeneous Multicore System

    Publication Year: 2014, Page(s):82 - 89
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    The shared last-level cache (SLLC) in heterogeneous multicore system is an important memory component that shared and competitive between multiple cores, so how to improve the SLLC performance has become an important research area. Last-level cache (LLC) bypassing technique that bypasses the LLC a part of memory requests is one of the most effective methods. The bypassed requests are sent directly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of Binding Approaches of Scheduled Multiphase Application onto Linear Multicore Architecture

    Publication Year: 2014, Page(s):90 - 97
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    As almost all applications run-time characteristics exhibit time varying phase behavior. So scheduling and binding strategy considering this behavior of applications plays an important role in achieving high throughput and less power consumption. In this paper, we have considered binding of already scheduled multiphase application on to linear multicore architecture. This approaches bind the sched... View full abstract»

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