2015 Third International Symposium on Computing and Networking (CANDAR)

8-11 Dec. 2015

Filter Results

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

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

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

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

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

    Publication Year: 2015, Page(s):v - xiv
    Request permission for commercial reuse | PDF file iconPDF (149 KB)
    Freely Available from IEEE
  • Message from Organizers

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

    Publication Year: 2015, Page(s):xvi - xvii
    Request permission for commercial reuse | PDF file iconPDF (101 KB)
    Freely Available from IEEE
  • Program Committees

    Publication Year: 2015, Page(s):xviii - xxiii
    Request permission for commercial reuse | PDF file iconPDF (151 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2015, Page(s):xxiv - xxviii
    Request permission for commercial reuse | PDF file iconPDF (115 KB)
    Freely Available from IEEE
  • TPLCR: Time-Bound, Pre-copy Live Checkpointing and Parallel Restart of Virtual Machines Using Distributed Memory Servers

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

    Live checkpointing of virtual machines is the ability to save the state of a virtual machine to storage while the machine is running. This paper presents a novel Time-bound, Pre-Copy Live Checkpointing and parallel Re-start mechanism (TPLCR) that implements live checkpointing based on a time-bounded, pre-copy live migration algorithm. The performance improvements of TPLCR rely on the use of multip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient GPU Implementations for the Conway's Game of Life

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

    The Conway's Game of Life is the most well-known cellular automaton. The universe of the Game of Life is a 2-dimensional array of cells, each of which takes two possible states, alive or dead. The state of every cell is repeatedly updated according to those of eight neighbors. A cell will be alive if exactly three neighbors are alive, or if it is alive and two or three neighbors are alive. The mai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power Optimization Considering the Chip Temperature of Low Power Reconfigurable Accelerator CMA-SOTB

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

    For low power yet high performance processing in battery driven devices, a coarse grained reconfigurable accelerator called Cool Mega Array (CMA)-SOTB is implemented by using Silicon on Thin BOX (SOTB), a new process technology developed by the Low-power Electronics Association & Project (LEAP). This chip has three voltages for controlling power and performance, supply voltage, PE-Array bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelization Techniques for Error Diffusion with GPU Implementations

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

    Error diffusion is a classical but still popular method for generating a binary image that reproduces an original gray-scale image. In error diffusion, pixel values are rounded to binary in raster scan order and the rounding error is distributed to neighboring pixels that have not yet been processed. The main contribution of this paper is to show several parallel algorithms and implementation tech... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy Throttling: Towards Global Congestion Control of Interconnection Networks

    Publication Year: 2015, Page(s):40 - 49
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB) | HTML iconHTML

    Importance of interconnection networks is continuously increasing as the number of processing elements in massively parallel computers grows. Wide spectrum of efforts in research and development for effective and practical interconnection network methods are reported, however, the problem is still open. This paper focuses discussions on congestion control, which intends to minimize congestion in o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Practical Algorithm for Embedding Graphs on Torus

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

    Embedding graphs on the torus is a problem with both theoretical and practical importance. It is required to embed a graph on the torus for solving many application problems such as VLSI design, graph drawing and etc. Polynomial time and exponential time algorithms for embedding graphs on the torus are known. However, the polynomial time algorithms are very complex and their implementation has bee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Portable Implementation of Lattice-Based Cryptography Using JavaScript

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

    Lattice-based cryptography has attracted a high degree of attention in the cryptologic research community. It is expected to be in wide use in the foreseeable future once large quantum computers are in sight. In addition, JavaScript is a standard programming language for Web applications. It is now supported on a wide variety of computing platforms and devices with immense efficiency improvement i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized-Star Cube: A New Class of Interconnection Topology for Massively Parallel Systems

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

    In this paper, another version of the star cube called the generalized-star cube, GSC(n, k, m), is presented as a three level interconnection topology. GSC(n, k, m) is a product graph of the (n, k)-star graph and the m-dimensional hypercube (m-cube). It can be constructed in one of two ways: to replace each node in an m-cube with an (n, k)-star graph, or to replace each node in an (n, k)-star grap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accelerating Reachability Analysis on Petri Net for Mutual Exclusion-Based Deadlock Detection

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

    Petri Net (PN) is a frequently-used model for deadlock detection. Among various detection methods on PN, reachability analysis is the most accurate one since it never produces any false positive or false negative. Although suffering from the well-known state space explosion problem, reachability analysis is appropriate for small-and medium-scale programs. In order to mitigate the explosion problem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the I/O Performance in the Reduce Phase of Hadoop

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

    Hadoop is a popular open-source MapReduce implementation. In the cases of jobs wherein all the output files of all the relevant Map tasks are transmitted and consolidated into a single Reduce task, such as in TeraSort, the single Reduce task is the bottleneck task and is I/O bounded for processing many large output files. In most cases, including TeraSort, the intermediate data, which include the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Revisiting Authentication with Shoulder-Surfing Resistance for Smartphones

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

    A challenge/response authentication scheme with a hidden challenge is useful authentication against a shoulder-surfing attack. This scheme allows a user in authentication with secret information to receive a challenge securely as a nonce and to input the response obtained from the secret information and the challenge, and hence, to prevent impersonation by an adversary as long as the challenge inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Warp-Synchronous Implementation for Multiple-Length Multiplication on the GPU

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

    If we process large-integers on the computer, they are represented by multiple-length integer. Multiple-length multiplication is widely used in areas such as scientific computation and cryptography processing. However, the computation cost is very high since CPU does not support a multiple-length integer. In this paper, we present a GPU implementation of bulk multiple-length multiplications. The i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Hamiltonian Property of Linear-Convex Supergrid Graphs

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

    A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle problem for grid and triangular grid graphs was known to be NP-complete. Recently, we have proved the Hamiltonian cycle problem for supergrid graphs to be NP-complete. The Hamilton... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AP-assisted CTS-blocking for WiFi-ZigBee Coexistence

    Publication Year: 2015, Page(s):110 - 114
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1081 KB) | HTML iconHTML

    WiFi interference is one of the big problems in ZigBee-based sensor networks. In this paper, we present a new WiFi-ZigBee coexistence scheme named AP-assisted CTS-blocking (AA CTS-blocking). The AA CTS-blocking uses an RTS/CTS (request to send, clear to send) mechanism to prevent WiFi transmissions during ZigBee communications. An RTS/CTS mechanism is defined in the IEEE 802.11 standard and is sup... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of WiFi AP-RSS Monitoring System Using Sensor Nodes

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

    Sensor localization is one of the big problems when building large scale indoor sensor networks because GPS is unavailable in indoor environments. In this paper, we propose a sensor localization system using WiFi APs as anchors. WiFi APs are largely installed in indoor environments and are managed by a network system manager. Using WiFi APs as anchors, we can localize sensor nodes with neither new... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem

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

    Elliptic curve discrete logarithm problem (ECDLP) is the base of the security of elliptic curve cryptography (ECC). The verification of the security of ECC has been studied by solving an ECDLP. However, we need a large amount of computational resources for the verification. Then, this paper proposes a method gathering computational resources with Web-based Volunteer Computing (Web-based VC). This ... View full abstract»

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