2015 Seventh International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

12-14 Dec. 2015

Filter Results

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

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

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

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

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

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

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

    Publication Year: 2015, Page(s): x
    Request permission for reuse | PDF file iconPDF (123 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organization

    Publication Year: 2015, Page(s): xi
    Request permission for reuse | PDF file iconPDF (119 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2015, Page(s):xii - xiii
    Request permission for reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2015, Page(s): xiv
    Request permission for reuse | PDF file iconPDF (117 KB)
    Freely Available from IEEE
  • Keynotes

    Publication Year: 2015, Page(s):xv - xxi
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (339 KB) | HTML iconHTML

    These keynote discusses the following: Parallel and Interactive Computing of Big Data; Approximation Algorithms: Methodologies, Applications and Empirical Evaluation. View full abstract»

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

    Publication Year: 2015, Page(s): xxii
    Request permission for reuse | PDF file iconPDF (105 KB)
    Freely Available from IEEE
  • Efficient Heuristic for Placing Monitors on Flow Networks

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

    Network flow monitoring is a crucial procedure for optimizing the network infrastructure for better application performance or security issue. In this paper, we address the problem of Flow Edge-Monitoring (denoted as FEM), for which we need to find k (k > 0) edges in an undirected graph G = (V, E), so that if we place k flow monitors on these edges to measure the flow along them, we can max... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Implementation of Genetic Algorithms on GP-GPU with Scheduled Persistent CUDA Threads

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

    In this paper we present a heavily exploration oriented implementation of genetic algorithms to be executed on graphic processor units (GPUs) that is optimized with our novel mechanism for scheduling GPU-side synchronized jobs that takes inspiration from the concept of persistent threads. Persistent Threads allow an efficient distribution of work loads throughout the GPU so to fully exploit the CU... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Pure Superword Level Parallelism for Array Indirections

    Publication Year: 2015, Page(s):13 - 19
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (197 KB) | HTML iconHTML

    SIMD (Single Instruction Multiple Data) extension units are ubiquitous in modern processors. Array indirections raise several challenges for SIMD vectorization including disjoint memory access, unknown alignment and dependence cycle. Existing SIMD automatic vectorization methods fail to handle these challenges very well. This paper presents a new method exploiting Pure SLP (Superword Level Paralle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling Binary Oriented Software Buffer-Overflow Vulnerability in Process Algebra

    Publication Year: 2015, Page(s):20 - 25
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (209 KB) | HTML iconHTML

    Software is ubiquitous in numerous industries, such as financial and commercial industries and military industries, playing the manager role to manipulate the data and equipment. Consequently, its vulnerabilities become great insecurity factors. To prevent the exploit of vulnerabilities, it is essential to study the characteristic of vulnerabilities, and a model to describe them is prerequisite. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OpenISMA: An Approach of Achieving a Scalable OpenFlow Network by Identifiers Separating and Mapping

    Publication Year: 2015, Page(s):26 - 33
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (545 KB) | HTML iconHTML

    Scalability is always a serious issue influencing the development of Software-Defined Network (SDN). Identifiers Separating and Mapping Architecture (ISMA) is a promising solution to the current Internet scaling problems by dividing the network into edge network and core network. In this paper, we adopt the idea of identity and locator splitting with SDN to aggregate flow table entries in the core... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDNI: A Distributed Framework for NFV Infrastructure

    Publication Year: 2015, Page(s):34 - 40
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    Network Function Virtualization (NFV) is an attempt to help operators more effectively manage their networks by implementing traditional network functions embedded in specialized hardware platforms in term of virtualized software instances. And, existing NFV infrastructure solutions are always architected on a general-purpose x86 server, which makes the performance of NFs limited by the hosted sin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Tolerant-Anisotropic Localization for Large-Scale Wireless Sensor Network

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

    Multi-hop localization is a common method which is suitable for large-scale application. However, it is usually influenced by the network anisotropy, leading to the instability of the localization performance. In order to reduce the influence of the network anisotropy on the localization accuracy, this paper regards the localization as a regression forecasting process by constructing the mapping r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Processing of Approximate Range Queries in Wireless Sensor Networks

    Publication Year: 2015, Page(s):45 - 51
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (381 KB) | HTML iconHTML

    In Wireless Sensor Networks (WSNs), the large amount of high-dimensional sensed data play a key role in many emerging WSN applications. Existing approaches to similarity search rely on the assumption that sensed data are centralized to deal with, or sensed data are simple enough to be stored in a relational database. In this article, we propose a distributed approximate similarity search (DASS) al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector Localization Algorithm Based on Signal Strength in Wireless Sensor Network

    Publication Year: 2015, Page(s):52 - 58
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (413 KB) | HTML iconHTML

    To deal with the inaccuracy and the uniform distribution of the DV-Hop algorithm, it is necessary to put forward a new optimization algorithm based on DV-Hop and RSSI for the two-dimensional planar node location called RSDV-Hop. The algorithm is based on the shortest hop distance with RSSI algorithm and gets the position between the nodes and the anchors according to the difference of signal stren... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel and Improvement of Pre-computation Technique for Approximation Shortest Distance Query

    Publication Year: 2015, Page(s):59 - 64
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (190 KB) | HTML iconHTML

    With the development of mobile Internet, more and more applications are associated with location. There are many applications just care about shortest distance of two points and do not care about the paths, such as take-away applications. The problem of shortest distance query of objects has caught many researchers' attention in recent years. One of solutions is pre-computation. We can select repr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Generalized Function Projective Lag Synchronization and Parameter Identification of Hyperchaotic Systems

    Publication Year: 2015, Page(s):65 - 67
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (156 KB) | HTML iconHTML

    Generalized function projective lag synchronization (GFPLS) is characterized by the output of the drive system proportionally lagging behind the output of the response system and ratio of the two systems is desired function scaling matrix. In this paper, GFPLS between different hyper chaotic systems with uncertain parameters, i.e. GFPLS between Lorenz-Stenflo (LS) and Lü hyper chaotic system, is s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Generalized Function Projective Lag Synchronization of Time-Delay Systems with Uncertain Parameters

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

    In this paper, we consider generalized function projective lag synchronization of time-delay systems using adaptive control methods, and system parameters are uncertain. By means of the Lyapunov stability theory, an adaptive controller and parameter update rule are designed for achieving generalized function projective lag synchronization between two time-delay systems and estimating all the unkno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Minimal Exposure Path in Mobile Wireless Sensor Network

    Publication Year: 2015, Page(s):73 - 79
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (267 KB) | HTML iconHTML

    Target traversing is an important research topic in wireless sensor networks. Most works in this area consider the coverage issues of the target's moving paths. The minimal exposure path problem is to find a path among sensors so that the target's total exposure to the sensors is minimized. Most existing traversal algorithms ensure the target to stay as far as possible from static sensors. In this... View full abstract»

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