Browsing by Keywords "Distributed computer systems"

Now showing items 21-30 of 30

    • An O(n1/3) algorithm for distributed mutual exclusion 

      Chaudhuri, P.; Karaata, M. H. (Elsevier, 1998)
      In this paper, a distributed algorithm is proposed that realizes mutual exclusion among n nodes in a computer network. No common or global memory is shared by the nodes and there is no global controller. The nodes of the ...

    • Parallel pruning for k-means clustering on shared memory architectures 

      Gürsoy, Attila; Cengiz, Ilker (Springer Verlag, 2001)
      We have developed and evaluated two parallelization schemes for a tree-based k-means clustering method on shared memory machines. One scheme is to partition the pattern space across processors. We have determined that ...

    • A path-quality-aware peer-to-peer file sharing protocol for mobile ad-hoc networks: Wi-Share 

      Karasabun, Efe; Ertemür, Doğuş; Sarıyıldız, Seyhun; Tekkalmaz, Metin; Körpeoğlu, İbrahim (IEEE, 2009-09)
      Peer-to-peer networks are rather well-studied and currently there are numerous systems based on peer-to-peer principles running on the Internet. On the other hand peer-to-peer networks for mobile ad-hoc networks have ...

    • A peer-to-peer file search and download protocol for wireless ad-hoc networks 

      Sözer, H.; Tekkalmaz, M.; Korpeoglu, I. (Elsevier BV, 2009-01)
      Deployment of traditional peer-to-peer file sharing systems on a wireless ad-hoc network introduces several challenges. Information and workload distribution as well as routing are major problems for members of a wireless ...

    • PetaShare: A reliable, efficient and transparent distributed storage management system 

      Kosar, T.; Akturk I.; Balman, M.; Wang X. (2011)
      Modern collaborative science has placed increasing burden on data management infrastructure to handle the increasingly large data archives generated. Beside functionality, reliability and availability are also key factors ...

    • PHR: A parallel hierarchical radiosity system with dynamic load balancing 

      Sinop, A.; Abacı, T.; Akkuş Ü.; Gürsoy, A.; Güdükbay, Uğur (Springer, 2005)
      In this paper, we present a parallel system called PHR for computing hierarchical radiosity solutions of complex scenes. The system is targeted for multi-processor architectures with distributed memory. The system evaluates ...

    • Query-log aware replicated declustering 

      Turk, A.; Oktay, K. Y.; Aykanat, Cevdet (Institute of Electrical and Electronics Engineers, 2013)
      Data declustering and replication can be used to reduce I/O times related with processing of data intensive queries. Declustering parallelizes the query retrieval process by distributing the data items requested by queries ...

    • Research issues in peer-to-peer data management 

      Ulusoy, Özgür (IEEE, 2007-11)
      Data management in Peer-to-Peer (P2P) systems is a complicated and challenging issue due to the scale of the network and highly transient population of peers. In this paper, we identify important research problems in P2P ...

    • Safe data parallelism for general streaming 

      Schneider S.; Hirzel M.; Gedik, B.; Wu, Kun-Lung (Institute of Electrical and Electronics Engineers, 2015)
      Streaming applications process possibly infinite streams of data and often have both high throughput and low latency requirements. They are comprised of operator graphs that produce and consume data tuples. General streaming ...

    • Selective replicated declustering for arbitrary queries 

      Oktay, K. Yasin; Türk, Ata; Aykanat, Cevdet (Springer, 2009-08)
      Data declustering is used to minimize query response times in data intensive applications. In this technique, query retrieval process is parallelized by distributing the data among several disks and it is useful in ...