By Topic

2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming

Date 18-20 Dec. 2010

Filter Results

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

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

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

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

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

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

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

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

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

    Publication Year: 2010, Page(s):xv - xvi
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE
  • An Efficient Video Program Delivery Algorithm in Tree Networks

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

    As the proportion of video programs is expected to grow significantly, video services will require a huge amount of Internet bandwidth in the future. In this paper, we model the video program placement (VPP) problem in tree networks which sends video programs to the requesting (demand) nodes using a broadcast method. The model considers the cost for both assigning programs to nodes and broadcastin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Content Delivery Algorithm for Intermittently Connected Mobile Ad Hoc Networks

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

    The content dissemination among mobile users can be solved by self-facilitated mobile ad hoc networks (MANET) in an infrastructure environment. But the devices used to make up the mobile ad hoc networks usually have a limited radio transmission range, sporadic node density and power limitation, which makes MANET become intermittently connected. In this paper we focus on the content delivery proble... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One-Hop Neighbor Transmission Coverage Information Based Distributed Algorithm for Connected Dominating Set

    Publication Year: 2010, Page(s):15 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB) | HTML iconHTML

    Broadcast is very important for delivering messages in wireless sensor networks. In order to improve the efficiency of broadcast and reduce energy consumption, it is necessary to construct a virtual backbone within the entire network. Constructing a virtual backbone is identical with calculating connected dominating set. 1-hop neighbor node transmission coverage information is used to calculate th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel P2P Identification Algorithm Based on Genetic Algorithm and Particle Swarm Optimization

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

    Peer-to-Peer technology is one of the most popular techniques nowadays, and it brings some security issues, so the recognition and management of P2P applications on the internet is becoming much more important. The selection of protocol attributes is significant to the problem of P2P identification. To overcome the shortcomings of current methods, a new P2P identification algorithm based on geneti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • iZone: A Location-Based Mobile Social Networking System

    Publication Year: 2010, Page(s):33 - 38
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB) | HTML iconHTML

    The rapid development of wireless technology, the extensive use of mobile phones and the availability of location information are facilitating personalized location-based applications. Easy to carry, easy to use and easy to buy, smart phones with certain software are of great advantage. Consequently, mobile social networking (MSN) systems have emerged rapidly, being a revolution for our everyday l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Run-Time Partitioning of Hybrid Distributed Shared Memory on Multi-core Network-on-Chips

    Publication Year: 2010, Page(s):39 - 46
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1499 KB) | HTML iconHTML

    On multi-core Network-on-Chips (NoCs), memories are preferably distributed and supporting Distributed Shared Memory (DSM) is essential for the sake of reusing huge amount of legacy code and easy programming. However, the DSM organization imports the inherent overhead of translating virtual memory addresses into physical memory addresses, resulting in negative performance. We observe that, in paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Type of Parallel Computing Architecture and Its Parallel Computer Based on N+1 Programs

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

    This paper introduces a new type of parallel computer based on N+1 programs (hereinafter, N+1 computer), as well as its features. A new concept of parallel computing architecture based on N+1 programs is also presented at same time. We studied the essential problems and inherent laws on parallel systems, and analyzed the operate ability, the computability, and the compilability of the system, as w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accelerating Reconfiguration for Degradable Mesh-Connected Processor Arrays

    Publication Year: 2010, Page(s):55 - 58
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    This paper proposes a fast reconfiguration algorithm for the two-dimensional degradable mesh-connected processor arrays. The proposed algorithm simplifies a dynamic programming approach to construct logical columns. For each processing element lying in the logical columns, the calculation is reduced from five operations (one assignment, two additions and two comparisons) that are taken in the stat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Approach for Multilevel Fixed Outline Floorplanning

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

    Multilevel strategy is one of the most popular methods for fixed outline floor planning. It partitions an original circuit into some sub-circuits and then merges them into relatively big ones. In this paper, we propose a novel evaluation approach and integrate it into the simulated annealing framework in the merging stage. Moreover, a novel search technique, which can almost keep away from the loc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling Multiple Multithreaded Applications on Asymmetric and Symmetric Chip Multiprocessors

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

    This paper evaluates new techniques to improve performance, fairness and jitter of workloads consisting of multiple multithreaded applications running on Chip MultiProcessors (CMP). Current thread assignment techniques which are tailored for single-thread applications result in sub-optimal usage of the multiprocessor resources, unfairness between applications and jitter in execution runtimes when ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GTFTTS: A Generalized Tit-for-Tat Based Corporative Game for Temperature-Aware Task Scheduling in Multi-core Systems

    Publication Year: 2010, Page(s):81 - 88
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB) | HTML iconHTML

    Temperature-constraint computing environments are emerging those years, especially in embedding computing. A game theoretic temperature-aware scheduling algorithm for multi-core systems is proposed in this paper, namely, GTFTTS (Generalized Tit-For-Tat Temperature-aware Scheduling). GTFTTS is designed to work in a resource-rich environment where resources always compete for tasks. A generalized Ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Scheduling Strategy on Load Balancing of Virtual Machine Resources in Cloud Computing Environment

    Publication Year: 2010, Page(s):89 - 96
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    The current virtual machine(VM) resources scheduling in cloud computing environment mainly considers the current state of the system but seldom considers system variation and historical data, which always leads to load imbalance of the system. In view of the load balancing problem in VM resources scheduling, this paper presents a scheduling strategy on load balancing of VM resources based on genet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Refined Jacobi-Davidson Method for Quadratic Eigenvalue Problems

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

    This paper presents a parallel refined Jacobi-Davidson method for computing extreme eigenpairs of quadratic eigenvalue problems. The method directly computes the refined Ritz pairs in the projection subspace, and expands the subspace by the solution of the correction equation. Combining with the restarting scheme, the method can solve several eigenpairs of quadratic eigenvalue problems. The numeri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Point-Multiplication for Conic Curves Cryptosystem

    Publication Year: 2010, Page(s):116 - 120
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    Cryptosystem on conic curves, which is a new developing cryptography, becomes more widespread in these days. It is important to explore fast parallel algorithms to both encrypt and decrypt information in conic curves cryptosystem. Point-multiplication is the key operation for constructing security protocol in conic curves cryptosystem. There is no existing research focused on paralleling point-mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Case Study of SWIM: Optimization of Memory Intensive Application on GPGPU

    Publication Year: 2010, Page(s):123 - 129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    Recently, GPGPU has been adopted well in the High Performance Computing (HPC) field. The limited global memory bandwidth poses a great challenge to many GPGPU programmers trying to exploit parallelism within the CPU-GPU heterogeneous platform. In this paper, we choose SWIM, a typical memory intensive application from the SPEC OMP 2001 benchmark suite, for case study. We attempt to optimize the per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Translation Framework for Virtual Execution Environment on CPU/GPU Architecture

    Publication Year: 2010, Page(s):130 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (542 KB) | HTML iconHTML

    GPUs are many-core processors with tremendous computational power. However, as automatic parallelization has not been realized yet, developing high-performance parallel code for GPUs is still very challenging. The paper presents a novel translation framework designed for virtual execution environment based on CPU/GPU architecture. It addresses two major challenges of taking advantage of general pu... View full abstract»

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