By Topic

2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming

Date 9-11 Dec. 2011

Filter Results

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

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

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

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

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

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

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

    Publication Year: 2011, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (105 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

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

    Publication Year: 2011, Page(s):xiv - xv
    Request permission for commercial reuse | PDF file iconPDF (118 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s):xvi - xvii
    Request permission for commercial reuse | PDF file iconPDF (115 KB)
    Freely Available from IEEE
  • Sliding Mode Control Algorithm Design for a Class of Unmatched Uncertain System

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

    An Integral sliding mode control algorithm for a class of unmatched uncertain system is proposed in this paper. In order to make that the perturbation is minimal, the perturbation is provided into two parts by projection matrix--the matched and unmatched perturbation. It is also shown that when the minimum is attained and the resulting perturbation is not amplified. The controller design uses inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Optimization of Top-k Queries on GPU

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

    With the development of web search engines, the concern on real-time performance of Top-k queries has attracted more and more attention. The author studies implement of classic algorithm - No Random Access Algorithm in order to optimize performance of Top-k queries on GPU. We give a novel GPU algorithm by using the features of CUDA's programming model. Experiment results show that an implementatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Efficiency and Parametric Optimization in CASTEP

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

    Parallel efficiency is always a fundamental research field in high performance computing. This paper focuses on parallel computing at high performance computing cluster with CASTEP program, discusses multi-core parallel efficiency in CASTEP, and analyses the influence of the main calculation parameters upon total CPU time and memory usage in case study, such as CPU cores(CPUs), cutoff energy, k-po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Option Pricing on the GPU with Backward Stochastic Differential Equation

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

    In this paper, we develop acceleration strategies for option pricing with non-linear Backward Stochastic Differential Equation (BSDE), which appears as a robust and valuable tool in financial markets. An efficient binomial lattice based method is adopted to solve the BSDE numerically. In order to reduce the global memory access frequency, the kernel invocation is avoided to be performed on each ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DHFS: A High-Throughput Heterogeneous File System Based on Mainframe for Cloud Storage

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

    The file system for the Cloud Storage usually use the distributed structure which store the metadata and the user data respectively. The I/O nodes get the management information of file from the specific metadata server through the networks. Under this mode, the metadata server should be the performance bottleneck of the whole system when huge number nodes or the heavy workloads in Cloud Storage. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security-Driven Fault Tolerant Scheduling Algorithm for High Dependable Distributed Real-Time System

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

    Critical real time system must run under high dependable environment which guarantees a high level of reliability and security. Fault tolerance and security technique has played an important role in building such environment. In this paper, we provide an improved technique to schedule such tasks with high reliability and security requirement on high dependable distributed real time system. First, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Thread-Level Parallel Algorithm for Sorting Integer Sequence on Multi-core Computers

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

    According to the characteristics of multi-core architectures and binary storage property of integer sequence, this paper proposes an efficient thread-level parallel algorithm for sorting integer sequence on multi-core computers. The algorithm divides the input integer sequence to several data blocks in main memory and distributes these blocks into the shared L2 cache and private L1 cache respectiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Thread-Level Parallel Generating Inter-class Test Cases

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

    A complicated class-cluster is transformed into several test blocks, and these test blocks are assigned to the processing cores on multi-core computer. Each processing core executes in parallel multiple threads to handle some test blocks. The relationship among classes in each block is represented by relational pairs, and the mutation program for each relational pair is generated by applying ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs

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

    The Min-Min problem of finding a disjoint-path pair with the length of the shorter path minimized is known to be NP-hard in general graphs. However, it remains an open problem whether the Min-Min problem is NP-hard in some special graph such as planar graphs. In this paper, for an st-outerplanar graph G = (V, E) which is a special planar graph that can be drawn in the plane with source vertex s an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes

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

    Multiple independent spanning trees have applications to fault tolerance and data broadcasting in distributed networks. There is a conjecture on independent spanning trees: any n-connected graph has n independent spanning trees rooted at an arbitrary vertex. The conjecture has been confirmed only for n-connected graphs with n=4, and it is still open for arbitrary n-connected graphs when n ≥... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Parallel FDTD Method Performance Using SSE Instructions

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

    Electromagnetic researchers are often faced with long execution time and therefore algorithmic and implementation-level optimization can dramatically increase the overall performance of electromagnetism simulation using FDTD method. In this paper, we focus on acceleration implementation of 3D parallel FDTD method by taking advantage of the extended instruction sets found in modern processors, in p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel K-Means Clustering Algorithm with MPI

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

    Clustering is one of the most popular methods for data analysis, which is prevalent in many disciplines such as image segmentation, bioinformatics, pattern recognition and statistics etc. The most popular and simplest clustering algorithm is K-means because of its easy implementation, simplicity, efficiency and empirical success. However, the real-world applications produce huge volumes of data, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective Methods to Avoid the Internet Censorship

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

    We speculated the techniques used by Internet censorship and compared the general methods to break through, including VPN, SSH, IPV6, proxy tools, hosts file modify and web proxy. A new method we called Proxy Pool was put forward in this paper. All our experiments were done under Internet censorship. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication-Aware Design Space Exploration for Efficient Run-Time MPSoC Management

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

    Real-time multi-media applications are increasingly mapped on modern embedded systems based on Multiprocessor Systems-on-Chip (MPSoCs). Tasks of the applications need to be mapped on the MPSoC resources efficiently in order to satisfy their performance constraints. Exploring all the mappings, i.e. tasks to resources combinations exhaustively may take days or weeks. Additionally, the exploration is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended Folded Cube: A Improved Hierarchical Interconnection Network

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

    In this paper we present and analyze a new interconnection network, Extended Folded Cube. We prove that this topology has better properties than other variations of the basic Hypercube: smaller diameter, lower cost factor and constant node degree. Furthermore, it maintains several attractive properties including symmetry, hierarchical, expansive, recursive, etc. For this new design, optimal routin... View full abstract»

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