2014 IEEE 13th International Symposium on Parallel and Distributed Computing

24-27 June 2014

Filter Results

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

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

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

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

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

    Publication Year: 2014, Page(s):v - vii
    Request permission for reuse | PDF file iconPDF (137 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2014, Page(s): viii
    Request permission for reuse | PDF file iconPDF (64 KB) | HTML iconHTML
    Freely Available from IEEE
  • Symposium Organization

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

    Publication Year: 2014, Page(s):x - xi
    Request permission for reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • Actors Programming for the Mobile Cloud

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

    Actor programming languages provide the kind of inherent parallelism that is needed for building applications in the mobile cloud. This is because the Actor model provides encapsulation (isolation of local state), fair scheduling, location transparency, and locality of reference. These properties facilitate building secure, scalable concurrent systems. Not surprisingly, very large-scale applicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Implementation of Constrained Systems Based on Knowledge

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

    Building correct distributed systems is challenging, and any attempt for providing a direct, global proof of correctness of a distributed system is bound to fail. An interesting alternative approach consists in starting from a specification or program of the system under construction, verifying all properties of interest on it - which has a much lower complexity than the verification on a distribu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel and Distributed Computing: Memories of Time Past and a Glimpse at the Future

    Publication Year: 2014, Page(s):14 - 15
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (94 KB)

    We propose to look at the evolution of ideas related to parallel systems, algorithms, and applications during the past three decades and then glimpse at the future. The journey starts with massively parallel systems of the early nineties, transitions gently to computing for the masses on the clouds of the first decade of the new millennium, and continues with what we could expect from quantum comp... View full abstract»

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

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

    Broadcast communication between computers became common with the Ethernet, which inspired the first, "wired", broadcast calculi. Here, senders choose what to send and when, reception is instantaneous to everyone connected to the (local) Ethernet, and contention among senders is arbitrarily resolved. These calculi were easily embedded into programming languages to express concurrent and parallel pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Systems from 1979 to 2014: 35 Years of Progress?

    Publication Year: 2014, Page(s): 23
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Summary form only given. In 1979 I started working in a world where semiconductor technology was advancing rapidly. The world was expecting that very shortly there would be a chip available which could store 64 kilobits (65,536 bits) of data, and already microprocessor based computers were available at a price where they could be bought by individuals. The semiconductor industry saw that there was... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A DSL for Integrative Parallel Programming

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

    Parallel programming is commonly done through a library approach, as in the Message Passing Interface (MPI), directives, as in OpenMP, language extensions, as in High Performance Fortran (HPF), or whole new languages, as in Chapel. However, we argue that the concepts underlying these different programming systems show great commonality. Hence, we propose a Domain-Specific Language (DSL) that expre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fair Comparison of VM Placement Heuristics and a More Effective Solution

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

    Data center optimization, mainly through virtual machine (VM) placement, has received considerable attention in the past years. A lot of heuristics have been proposed to give quick and reasonably good solutions to this problem. However it is difficult to compare them as they use different datasets, while the distribution of resources in the datasets has a big impact on the results. In this paper w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agent-Based Memory Access for Many-Core CMPs

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

    The trend of increasing on-chip core counts and integrating memory controllers (MCs) makes core-to-memory communication a major obstacle in scaling memory access performance for many-core CMPs. Unmanaged on-chip traffic for long-distance memory accesses, combined with information asymmetry between cores and remote MCs may lead to serious inefficiency in processing massive parallel memory accesses.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A GPU Framework for Sparse Matrix Vector Multiplication

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

    The hardware and software evolutions related to Graphics Processing Units (GPUs), for general purpose computations, have changed the way the parallel programming issues are addressed. Many applications are being ported onto GPU for achieving performance gain. The GPU execution time is continuously optimized by the GPU programmers while optimizing pre-GPU computation overheads attracted the researc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Task-Based Approach to Linear Algebra

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

    Processors with large numbers of cores are becoming commonplace. In order to take advantage of the available resources in these systems, the programming paradigm has to move towards increased parallelism. However, increasing the level of concurrency in the program does not necessarily lead to better performance. Parallel programming models have to provide flexible ways of defining parallel tasks a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applicability of the Imprecise Computation Approach for the QoS Enhancement in Distributed RTDBMS

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

    Large amounts of real-time data is used by geographically distributed real-time applications. Using DRTDBMS1 is more and more needed to better manage the large amount of real-time data. In order to take account of unpredictable workload, Quality of Service (QoS) based approaches are the most appropriate. In the case of distributed real-time applications, it is necessary to take into account the pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bid-Centric Cloud Service Provisioning

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

    Bid-centric service descriptions have the potential to offer a new cloud service provisioning model that promotes portability, diversity of choice and differentiation between providers. A bid matching model based on requirements and capabilities is presented that provides the basis for such an approach. In order to facilitate the bidding process, tenders should be specified as abstractly as possib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Commodity hardware performance in AES processing

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

    Specialized encryption processors offer both low latency and high throughput at the expense of higher cost. A modern x86 system that encompasses several compute architectures (SISD/SIMD) might be able to perform well compared to a dedicated encryption unit at the fraction of the cost. This paper presents how one might accelerate AES ECB 128 bit using modern commodity hardware found in today's x86 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dataflow Programming Using AGAPIA

    Publication Year: 2014, Page(s):87 - 94
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (185 KB) | HTML iconHTML

    As distributed applications became more commonplace and more sophisticated, new programming languages and models for distributed programming were created. In the context of continuously increasing data flows in parallel applications, there is a renewed interest in the dataflow paradigm. This paper shows why AGAPIA language is suitable for dataflow programming. AGAPIA is capable of expressing massi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining the Optimal Redistribution for a Given Data Partition

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

    The classical redistribution problem aims at optimally scheduling communications when moving from an initial data distribution to a target distribution where each processor will host a subset of data items. However, modern computing platforms are equipped with a powerful interconnection switch, and the cost of a given communication is (almost) independent of the location of its sender and receiver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing Throughput of Scalable Distributed Two -- Layer Data Structures

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

    Scalability of data and throughput are important features of modern applications designed for distributed and loosely-coupled computer systems. In the paper, throughput scalable two-layer structures, called Throughput Scalability for SD2DS (TS2DS), are introduced. For maximum efficiency, the structures are stored in a distributed RAM of a multicomputer. Every data unit of TS2DS (a component) is sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From MultiTask to MultiCore: Design and Implementation Using an RTOS

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

    Practice has shown that programming a new multicore system is a greater challenge than previously thought. The challenge is to produce the resulting system in a way, which is as easy as sequential programming. This new trend has changed the way we think about the whole development process. The aim of this work is to show that it is possible to develop a multicore embedded system application using ... View full abstract»

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