Browsing by Subject "Communication overheads"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Hypergraph-theoretic partitioning models for parallel web crawling
    (Springer, London, 2012) Türk, Ata; Cambazoğlu, B. Barla; Aykanat, Cevdet
    Parallel web crawling is an important technique employed by large-scale search engines for content acquisition. A commonly used inter-processor coordination scheme in parallel crawling systems is the link exchange scheme, where discovered links are communicated between processors. This scheme can attain the coverage and quality level of a serial crawler while avoiding redundant crawling of pages by different processors. The main problem in the exchange scheme is the high inter-processor communication overhead. In this work, we propose a hypergraph model that reduces the communication overhead associated with link exchange operations in parallel web crawling systems by intelligent assignment of sites to processors. Our hypergraph model can correctly capture and minimize the number of network messages exchanged between crawlers. We evaluate the performance of our models on four benchmark datasets. Compared to the traditional hash-based assignment approach, significant performance improvements are observed in reducing the inter-processor communication overhead. © 2012 Springer-Verlag London Limited.
  • Thumbnail Image
    ItemOpen Access
    Memory resident parallel inverted index construction
    (Springer, London, 2012) Küçükyılmaz, Tayfun; Türk, Ata; Aykanat, Cevdet
    Advances in cloud computing, 64-bit architectures and huge RAMs enable performing many search related tasks in memory.We argue that term-based partitioned parallel inverted index construction is among such tasks, and provide an efficient parallel framework that achieves this task. We show that by utilizing an efficient bucketing scheme we can eliminate the need for the generation of a global index and reduce the communication overhead without disturbing balancing constraint. We also propose and investigate assignment schemes that can further reduce communication overheads without disturbing balancing constraints. The conducted experiments indicate promising results. © 2012 Springer-Verlag London Limited.
  • Thumbnail Image
    ItemOpen Access
    PSAR: Power-source-aware routing in ZigBee networks
    (2012) Tekkalmaz, M.; Korpeoglu I.
    ZigBee is a recent wireless networking technology built on IEEE 802.15.4 standard and designed especially for low-data rate and low-duty cycle applications such as home and building automation and sensor networks. One of the primary goals of ZigBee is low power consumption and therefore long-living networks. Despite this goal, current network formation and routing protocols described in the ZigBee specification do not fully address power consumption issues. In this work, we propose a distributed routing algorithm to reduce power consumption of battery-powered devices by routing the communication through mains-powered devices whenever possible and consequently increasing the overall network lifetime. The proposed algorithm works on tree topologies supported by ZigBee and requires only minor modifications to the current specification. Our ns-2 simulation results showed that the algorithm is able to reduce the power consumption of battery-powered devices significantly with minimal communication overhead. © Springer Science+Business Media, LLC 2012.