Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Distributed Computing Systems Workshops (ICDCSW), 2012 32nd International Conference on

Date 18-21 June 2012

Filter Results

Displaying Results 1 - 25 of 115
  • [Cover art]

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

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

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

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

    Publication Year: 2012 , Page(s): v - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (178 KB)  
    Freely Available from IEEE
  • Message from the Workshops Co-Chairs

    Publication Year: 2012 , Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (95 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Welcome message from the DCPerf 2012 Program Chairs

    Publication Year: 2012 , Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (102 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • DCPerf 2012 Committees

    Publication Year: 2012 , Page(s): xv - xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (112 KB)  
    Freely Available from IEEE
  • Welcome message from the PhoneCom 2012 Chairs

    Publication Year: 2012 , Page(s): xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (112 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • PhoneCom 2012 Committees

    Publication Year: 2012 , Page(s): xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (111 KB)  
    Freely Available from IEEE
  • Welcome message from the HotPOST 2012 Chairs

    Publication Year: 2012 , Page(s): xix
    Save to Project icon | Request Permissions | PDF file iconPDF (89 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • HotPOST 2012 Committees

    Publication Year: 2012 , Page(s): xx
    Save to Project icon | Request Permissions | PDF file iconPDF (113 KB)  
    Freely Available from IEEE
  • Welcome message from the WWASN 2012 Chairs

    Publication Year: 2012 , Page(s): xxi
    Save to Project icon | Request Permissions | PDF file iconPDF (99 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • WWASN 2012 Committees

    Publication Year: 2012 , Page(s): xxii
    Save to Project icon | Request Permissions | PDF file iconPDF (125 KB)  
    Freely Available from IEEE
  • Welcome from the CPNS 2012 Chairs

    Publication Year: 2012 , Page(s): xxiii
    Save to Project icon | Request Permissions | PDF file iconPDF (120 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • CPNS 2012 Committees

    Publication Year: 2012 , Page(s): xxiv - xxv
    Save to Project icon | Request Permissions | PDF file iconPDF (123 KB)  
    Freely Available from IEEE
  • Welcome from the ADSN 2012 Chairs

    Publication Year: 2012 , Page(s): xxvi
    Save to Project icon | Request Permissions | PDF file iconPDF (116 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • ADSN 2012 Committees

    Publication Year: 2012 , Page(s): xxvii - xxviii
    Save to Project icon | Request Permissions | PDF file iconPDF (136 KB)  
    Freely Available from IEEE
  • Welcome from the SPCC 2012 Chairs

    Publication Year: 2012 , Page(s): xxix
    Save to Project icon | Request Permissions | PDF file iconPDF (123 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • SPCC 2012 Committees

    Publication Year: 2012 , Page(s): xxx
    Save to Project icon | Request Permissions | PDF file iconPDF (121 KB)  
    Freely Available from IEEE
  • Welcome message from the NFSP 2012 Chairs

    Publication Year: 2012 , Page(s): xxxi
    Save to Project icon | Request Permissions | PDF file iconPDF (97 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • NFSP 2012 Committees

    Publication Year: 2012 , Page(s): xxxii
    Save to Project icon | Request Permissions | PDF file iconPDF (123 KB)  
    Freely Available from IEEE
  • A Comparison Study of Energy Proportionality of Data Center Network Architectures

    Publication Year: 2012 , Page(s): 1 - 7
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (225 KB) |  | HTML iconHTML  

    Today's data center networks consume a great amount of energy, which significantly aggravates the operational cost of data centers and the carbon footprint. It is an ideal objective for operators to make the power consumption of data center networks proportional to the amount of network loads they carry. To this end, many recent researches are focusing on two representative methods: device-level sleeping technology and network-wide energy aware routing. It is important for operators to understand what effects these energy conservation methods have on improving the network energy proportionality. In the paper, we make a comparison study on the energy proportionality of data center networks, based on regular routing and energy-aware routing. Specifically, we first choose several typical data center network architectures and equalize their network performance. Afterwards, we analyze the maximum power consumption of data center networks without using any energy conservation strategy, and compare their energy proportionality when employing the sleeping technology and energy-aware routing respectively. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Poincaré: A Hyperbolic Data Center Architecture

    Publication Year: 2012 , Page(s): 8 - 16
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (824 KB) |  | HTML iconHTML  

    Current trends in cloud computing suggest that both large, public clouds and small, private clouds will proliferate in the near future. Operational requirements, such as high bandwidth, dependability and smooth manageability, are similar for both types of clouds and their underlying data center architecture. Such requirements can be satisfied with utilizing fully distributed, low-overhead mechanisms at the algorithm level, and an efficient layer 2 implementation at the practical level. Adding to this, owners of evolving private data centers are in dire need of an incrementally upgradeable architecture which supports a small roll-out and continuous expansion in small quanta. In order to satisfy both requirements, we propose Poincare, a data center architecture inspired by hyperbolic tessellations, which utilizes low-overhead, greedy routing. On one hand, we show that Poincare scales to support large data centers with low diameter, high bisection bandwidth, inherent multipath and multicast capabilities, and efficient error recovery. On the other hand, Poincare supports incremental plug & play upgradability with regard to both servers and switches. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Random Access for Hadoop Distributed File System

    Publication Year: 2012 , Page(s): 17 - 22
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (501 KB) |  | HTML iconHTML  

    Recently, Hadoop Distributed File System (HDFS) has been widely used to manage the large-scale data due to its high scalability. HDFS can natively support sequential queries, which are the most common queries in the applications. However, there still exist many applications that need to apply random queries of large-scale data. So the random queries in large-scale data are becoming more and more important. Unfortunately, the HDFS is not optimized for random reads, hence there are many disadvantages in random access to HDFS. In this paper, we present three methods to solve these issues, which can optimize the random accesses to HDFS and guarantee the sequential access performance at the same time. The methods are as follows: 1) proposing dynamic methods to set the size of data packet in transmission, 2) reusing the TCP connections in localized random accesses, 3) transferring the random accesses to the same server to make full use of the TCP connections. Experimental evaluations based on real world data show that our works are effective and our solutions efficiently support sequential access and random access compared to the original methods. View full abstract»

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