By Topic

Networking and Computing (ICNC), 2012 Third International Conference on

Date 5-7 Dec. 2012

Filter Results

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

    Publication Year: 2012 , Page(s): C4
    Save to Project icon | Request Permissions | PDF file iconPDF (1045 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2012 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (39 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2012 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (89 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2012 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (114 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2012 , Page(s): v - x
    Save to Project icon | Request Permissions | PDF file iconPDF (159 KB)  
    Freely Available from IEEE
  • Message from the Organizers

    Publication Year: 2012 , Page(s): xi - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (77 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • ICNC 2012 Organization

    Publication Year: 2012 , Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (72 KB)  
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2012 , Page(s): xiv - xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (103 KB)  
    Freely Available from IEEE
  • Workshop Organizers

    Publication Year: 2012 , Page(s): xvii - xix
    Save to Project icon | Request Permissions | PDF file iconPDF (105 KB)  
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2012 , Page(s): xx - xxii
    Save to Project icon | Request Permissions | PDF file iconPDF (78 KB)  
    Freely Available from IEEE
  • Reversible Computing Systems, Logic Circuits, and Cellular Automata

    Publication Year: 2012 , Page(s): 1 - 8
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (288 KB) |  | HTML iconHTML  

    Reversible computing is a paradigm of computation that reflects physical reversibility, and will become important when we develop future computing systems that directly utilize microscopic physical phenomena for logical operations. In this survey we discuss, from a theoretical point of view, how a reversible computer is implemented as a reversible logic circuit, how a reversible logic circuit is c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Algorithms for Survivable Network Design

    Publication Year: 2012 , Page(s): 9 - 18
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (247 KB) |  | HTML iconHTML  

    Along with the rapid development of network communication technology and the explosive growth of the internet applications, network reliability appears increasingly important to both traditional areas such as defense, finance and power industry, and emerging areas such as trusted computing, cloud computing and next-generation Internet. An interesting subject that has attracted great effort is how ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems

    Publication Year: 2012 , Page(s): 19 - 20
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (97 KB) |  | HTML iconHTML  

    The paper shows summary of the author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted because of space limitation. They will be given at presentation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The K Computer and its Application

    Publication Year: 2012 , Page(s): 21 - 22
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (249 KB) |  | HTML iconHTML  

    The K computer is a distributed memory super-computer system with 82,944 compute nodes and 5,184 I/O nodes that was jointly developed by RIKEN and Fujitsu as a Japanese national project. Its development began in 2006 and was completed in June, 2012. By achieving the LINPACK performance of 10.51 peta-FLOPS, the K computer ranked first for two consecutive TOP500 list in June and November 2011. Durin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-overhead Routing Algorithm for 3D Network-on-Chip

    Publication Year: 2012 , Page(s): 23 - 32
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (687 KB) |  | HTML iconHTML  

    Despite the higher scalability and parallelism integration offered by Network-on-Chip (NoC) over the traditional shared-bus based systems, it is still not an ideal solution for future large scale Systems-on-Chip (SoCs), due to some limitations such as high power consumption and high cost communication. Recently, extending 2D-NoC to the third dimension (3D-NoC) has been proposed to deal with these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Algorithm for Set K-Cover Problem and its Worst Case Analysis

    Publication Year: 2012 , Page(s): 33 - 40
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (216 KB) |  | HTML iconHTML  

    In this paper, we consider the problem of partitioning a given collection of subsets of nodes into k collections such that the average size of each collection is the largest, where the size of a collection is defined as the size of the union of the subsets contained in the collection. At first, we give an upper bound on the performance ratio of Abrams et al.'s approximation algorithm which is know... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HiCrypt: C to CUDA Translator for Symmetric Block Ciphers

    Publication Year: 2012 , Page(s): 41 - 48
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (304 KB) |  | HTML iconHTML  

    Many-core computer systems with GPUs are coming into mainstream use from high-end computing, including supercomputers, to embedded processors. Consequently, the implementation of cryptographic methods on GPGPU is also becoming popular because of such systems' performance. However, many factors affect the performance of GPUs. To cope with this problem, we developed a new translator, HiCrypt, which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Speed-up Technique for an Auto-Memoization Processor by Reusing Partial Results of Instruction Regions

    Publication Year: 2012 , Page(s): 49 - 57
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (635 KB) |  | HTML iconHTML  

    We have proposed an auto-memoization processor based on computation reuse. The auto-memoization processor dynamically detects functions and loop iterations as reusable blocks, and memoizes them automatically. In the past model, computation reuse cannot be applied if the current input sequence even differs by only one input value from the past input sequences, since processing results will differ. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous Memory Machine Models with Barrier Synchronization

    Publication Year: 2012 , Page(s): 58 - 67
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (235 KB) |  | HTML iconHTML  

    The Discrete Memory Machine (DMM) and the Unified Memory Machine (UMM) are theoretical parallel computing models that capture the essence of the shared memory and the global memory of GPUs. It was assumed that warps (i.e. groups of threads) on the DMM and the UMM work synchronously in the round-robin manner. However, warps work asynchronously in the actual GPUs, in the sense that warps may be rand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Implementation of Matrix-matrix Product in Double-double Precision on NVIDIA C2050 and Application to Semidefinite Programming

    Publication Year: 2012 , Page(s): 68 - 75
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (246 KB) |  | HTML iconHTML  

    We have implemented a fast double-double precision (has approx. 32 decimal significant digits) version of matrix-matrix multiplication routine called "Rgemm" of MPACK (http://mplapack.sourceforge.net/) on NVIDIA C2050 GPU. This routine is a higher precision version of gdgemmh in the BLAS (Basic Linear Algebra Subprograms) library. Our implementation is the fastest to date using NVIDIA C2050 and mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-Performance Visualization of Multi-Dimensional Gene Expression Data

    Publication Year: 2012 , Page(s): 76 - 84
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (508 KB) |  | HTML iconHTML  

    Previous application of Kohonen's self organizing map to common visualizations has yielded promising results. In this research, we extend the classic two-dimensional scatter plot visualization algorithm into the third dimension by permitting competition to occur within a three-dimensional search space. This approach takes advantage of spatial memory and increases the intrinsic dimensionality of a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Empirical Analysis of Periodically Bookmarked Web Pages in Social Bookmarking Systems

    Publication Year: 2012 , Page(s): 85 - 93
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (697 KB) |  | HTML iconHTML  

    There are enormous amount of pages on web. We consider that there are many web pages periodically viewed by users. For example, we can imagine that pages about the illustration of New Year's cards are generally viewed near the end of each year. In this paper, we investigate the property of such periodically viewed web pages using social book marking systems. Specifically, we will confirm that how ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient GPU Implementation of Ant Colony Optimization for the Traveling Salesman Problem

    Publication Year: 2012 , Page(s): 94 - 102
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (321 KB) |  | HTML iconHTML  

    Graphics Processing Units (GPUs) are specialized microprocessors that accelerate graphics operations. Recent GPUs, which have many processing units connected with an off-chip global memory, can be used for general purpose parallel computation. Ant Colony Optimization (ACO) approaches have been introduced as ature-inspired heuristics to find good solutions of the Traveling Salesman Problem (TSP). I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile Agent Rendezvous on a Probabilistic Edge Evolving Ring

    Publication Year: 2012 , Page(s): 103 - 112
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (366 KB) |  | HTML iconHTML  

    Rendezvous problem, which requires all mobile agents to gather on a single vertex, is one of the crucial methods for mobile agent systems. In previous studies on the rendezvous problem, mobile agents move on a static environment where the network topology does not change during the execution. However, in dynamic networks such as wireless mobile ad-hoc networks, the network continuously changes bec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameter Identification of Nonlinear Systems Using a Particle Swarm Optimization Approach

    Publication Year: 2012 , Page(s): 113 - 117
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (155 KB) |  | HTML iconHTML  

    This paper applies a particle swarm optimization (PSO) approach to the parameter identification for a class of nonlinear systems. In the PSO optimization process, the unknown system parameters are arranged in the form of a parameter vector (i.e. a particle), and the PSO algorithm employs the velocity updating and position updating formulas to an initial population, which is constituted by a great ... View full abstract»

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