2012 Fifth International Symposium on Parallel Architectures, Algorithms and Programming

17-20 Dec. 2012

Filter Results

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

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

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

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

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

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

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

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

    Publication Year: 2012, Page(s):xiii - xiv
    Request permission for reuse | PDF file iconPDF (89 KB)
    Freely Available from IEEE
  • Parallel Monte Carlo Search for Imperfect Information Game Daihinmin

    Publication Year: 2012, Page(s):3 - 6
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    Computer games, such as chess, have recently become an important research topic in the field of computation intelligence. Monte Carlo massive searching is very successful in the game of GO as it has a huge intractable search space and no good partial evaluation heuristics. Imperfect information games also have intractable properties, such as large scale search space, less heuristics, and unknown s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduce Data Coherence Cost with an Area Efficient Double Layer Counting Bloom Filter

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

    The snoopy protocol is a widely used scheme to maintain cache coherence. However, the protocol requires a broadcast scheme and forces substantial unnecessary data searches at the local cache. This paper proposes a novel Double Layer Counting Bloom Filter (DLCBF) to significantly reduce the redundant data searches and transmission. The DLCBF implements an extra layer of hash function and the counti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronization-Aware Dynamic Thread Scheduling for Improving Performance and Saving Energy in Multi-core Embedded Systems

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

    Nowadays, chip multi-processors (CMP) are being widely used in embedded systems due to their superior performance for parallel computing. However, they also incur significantly large power consumption. To solve this issue, designers of embedded operating system must provide an efficient thread scheduling algorithm, which not only maximizes the system performance, but also minimizes the energy cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient and Secure Trust Negotiation over the Internet

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

    Trust management can be applied to deal with a number of security issues in virtual networks. In internet communications, efficient and secure trust negotiation between virtual individuals/organizations is very important because it can achieve resource sharing, collaborative computing and communication security. This investigation aims to strengthen the efficiency and security of trust negotiation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design a Low-Power Scheduling Mechanism for a Multicore Android System

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

    Nowadays, multicore processors are widely adopted in the hand-held systems. Since the hand-held systems are powered by battery, the battery life will become the dominated limitation. An efficient low power scheduling mechanism for hand-held multicore system is become important today. This paper propose a novel low power scheduling mechanism, called Bounded-Power Multicore Dynamic Frequency Scaling... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Aware Scheduling for Weakly-Hard Real-Time System with I/O Device

    Publication Year: 2012, Page(s):31 - 38
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (457 KB) | HTML iconHTML

    In addition to processors, embedded systems also have some peripheral devices (such as: memory, flash memory, wireless interface). These devices will also consume energy. Dynamic power management (DPM) technology is often used to minimize the energy consumption of peripheral devices with the timeout mechanism in which the device is switched to the idle state for a specific time interval. Because t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparse Matrix-Vector Multiplication Based on Network-on-Chip: On Data Mapping

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

    Sparse Matrix-Vector Multiplication (SMVM) on parallel hardware is a very sophisticated problem because of the irregular data communication requirements. The communication volume in the parallel hardware is determined by how data is distributed among the processing elements. In this paper we introduce two methods of data mapping for SMVM based on Network-on-Chip (NoC) in order to spread the load a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Particle Swarm Optimization Algorithm in Multimedia CDN Content Placement

    Publication Year: 2012, Page(s):45 - 51
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (449 KB) | HTML iconHTML

    Multimedia Content Delivery Networks (CDN) is used to improve the performance and reliability on Internet. In CDN architecture, the multimedia contents are replicated from the origin server to replica servers in order to improve the performance and minimize the use of network bandwidth. Efficient placing the multimedia contents in CDN is a challenging problem. There are five factors that can be us... View full abstract»

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

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

    A new scheme of monoecism watermarking algorithm based on the bionics idea, is presented in this paper. We gave out the key concepts about the monoecism watermarking algorithm. We also described the process of monoecism watermark signal embedding and watermark detection in detail. At last, through the experiments we proved the validity of this algorithm. Monoecism watermarking algorithm can protec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Address-Based Compiling Optimization for FFT on Multi-cluster DSP

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

    This paper presents a compiling optimization for FFT program on multi-cluster DSP based on analysis of memory address. We transform the loops in order to reduce the number of instructions in the innermost loop. The interrelationship between each two memory access operations can be acquired via analysis of the base address and offset of every load or store instruction in the basic block. After the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Piecewise Chaotic Mapping and Its Application in Image Secure Communication

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

    Traditional Logistic chaotic sequence as well as its modified sequence is not ideal in terms of ergodicity and randomness. To solve this problem, a new piecewise Logistic chaotic was presented based on the analysis of the randomness, correlation, initial sensitivity and Lyapunov exponents of the referred chaotic sequences. Then the corresponding spread spectrum communication algorithm was proposed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formulistic Detection of Malicious Fast-Flux Domains

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

    Botnet creates harmful network attacks nowadays. Lawbreaker may implant malware into victim machines using botnets and, furthermore, he employs fast-flux domain technology to improve the lifetime of botnets. To circumvent the detection of command and control server, a set of bots are selected to redirect malicious communication and hides botnet communication within normal user traffic. As the dyna... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task Scheduling Prediction Algorithms for Dynamic Hardware/Software Partitioning

    Publication Year: 2012, Page(s):80 - 85
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (337 KB) | HTML iconHTML

    Significant research work has been done in recent years for dynamic HW/SW partitioning and the researches are focused on the aspects of partitioning algorithm and implementation. As for the aspects of task scheduling prediction, no in-depth study has been done and no efficient prediction algorithm has been proposed. In the paper, the importance of task scheduling prediction is analyzed and the mat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Two-Step Topology Reconfiguration Algorithm for Core-Level Fault Tolerance in NoCs

    Publication Year: 2012, Page(s):86 - 92
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (353 KB) | HTML iconHTML

    With the rapid increase in the number of processor cores integrated on Network-on-Chips (NoCs) and higher requirements for system reliability, fault tolerance is becoming a great challenge in the design process. In this paper, a fast two-step topology reconfiguration (FTTR) algorithm is proposed to solve the reconfiguration mapping problem in NoCs for core-level fault tolerance. By defining mappin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Triggering Cascades on Strongly Connected Directed Graphs

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

    Consider the following process of activation on a directed graph G(V,E). In round zero, a set of vertices, called the seeds, are active. Thereafter, a vertex is activated in a round if at least a ρ ∈ (0,1] fraction of its in-neighbors are active in the previous round. Once a vertex is activated, it remains active. Assuming the strong connectivity of G, this paper proves the existence of O([ρ|V|]) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prediction of Infectious Disease Spread Using Twitter: A Case of Influenza

    Publication Year: 2012, Page(s):100 - 105
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (386 KB) | HTML iconHTML

    Nowadays, detecting the disaster phenomena and predicting the final stage become very important in the risk analysis view-point. The statistical methods provide accurate estimates of parameters when the data are completely given. However, when the data are incomplete, the accuracy of the estimates becomes poor. Therefore, statistical methods are weak in predicting the future trends. The SIR method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Diagnosis in the Locally Twisted Cube

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

    Adaptive diagnosis in the locally twisted cube is studied in this paper. Let LTQn, denote the n-dimensional locally twisted cube. We prove that for any integer n ≥ 3, LTQn, can be adaptively diagnosed using at most 4 parallel testing rounds, with at most n faulty nodes, where each node participates in at most one test in each round. The proof and algorithm of adaptive diagnos... View full abstract»

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