Accepted Papers

  • Propagation Problem - A variant of Power Domination Problem
    Paul Manuel1,2, Bharati Rajan2,3, Thomas Kalinowski2, Sudeep Stephen4, R. Sundara Rajan4, and N. Parthiban4, 1Kuwait University, Safat, Kuwait, 2The University of Newcastle, Australia, 3Loyola College, Chennai, India and 4VIT University, Chennai, India
    Power domination problem arose in the context of monitoring electric power system by placing minimum phase measurement units (PMUs) as possible. Under broadcasting protocol, an informed processor propagates a message to one uninformed adjacent processor in a time unit. The broadcasting problem is to broadcast a message to all processors in the network in minimum time. Propagation problem is a variation of power domination problem and similar to broadcasting problem. In this paper, we study the propagation problem for certain graphs including Circulant graphs.
  • Efficient Failure Processing Architecture in Regular Expression Processor
    SangKyun Yun, Yonsei University, Korea

    Regular expression matching is a computational intensive task. Regular expression matching processors such as ReCPU have been proposed to solve the problem that full hardware solutions require resynthesis of hardware whenever the patterns are updated. However, ReCPU has inefficient failure processing due to data backtracking. In this paper, we propose an efficient failure processing architecture for regular expression processor. The proposed architecture uses the failure bit included in instruction format and provides efficient failure processing by removing unnecessary data backtracking.

  • BootTorrent: peer-to-peer fast network boot
    Andrea Trentini, University of Milan, Italy
    Network booting is widely used today: for thin-client computing, cluster computing, operating system installation and context switching in classrooms (i.e., for exams or di erent lessons). Currently available netboot protocols are the \trivial le transfer protocol" (TFTP) and \hypertext transfer protocol" (HTTP).
    When a group of machines need to simultaneously boot, the boot server becomes a bottleneck and it is very easy to reach the server network capacity, thus grinding the whole system to a halt.
    P2P network booting could relieve the server burden and some solution already \exists", but they are either too complicated, very O.S. speci c or even \described in a paper but unavailable".
    This paper proposes a Free Software BitTorrent based two-phase downloading system, implemented in a less-than-a-hundred-lines script achieving an almost at boot time with respect to the number of nodes booting together.