Now showing items 1-20 of 30

    • Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids 

      Aykanat, Cevdet; Cambazoglu, B. B.; Findik, F.; Kurc, T. (Academic Press, 2007-01)
      Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph ...
    • AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing 

      Alparslan O.; Akar, N.; Karasan, E. (Springer, 2004)
      With this paper, we propose a distributed online traffic engineering architecture for MPLS networks. In this architecture, a primary and secondary MPLS LSP are established from an ingress LSR to every other egress LSR. We ...
    • Architecture framework for mapping parallel algorithms to parallel computing platforms 

      Tekinerdogan, Bedir; Arkin, E. (CEUR-WS, 2013)
      Mapping parallel algorithms to parallel computing platforms requires several activities such as the analysis of the parallel algorithm, the definition of the logical configuration of the platform, and the mapping of the ...
    • Capacity region of multi-resolution streaming in peer-to-peer networks 

      Karagöz, B.; Yavuz, Semih; Ho, T.; Effros, M. (IEEE, 2013)
      We consider multi-resolution streaming in fully-connected peer-to-peer networks, where transmission rates are constrained by arbitrarily specified upload capacities of the source and peers. We fully characterize the capacity ...
    • A connection management protocol for promoting cooperation in Peer-to-Peer networks 

      Karakaya, M.; Körpeoǧlu, I.; Ulusoy, Özgür (Elsevier BV, 2008-02-05)
      The existence of a high degree of free riding in Peer-to-Peer (P2P) networks is an important threat that should be addressed while designing P2P protocols. In this paper we propose a connection-based solution that will ...
    • Counteracting free riding in Peer-to-Peer networks 

      Karakaya, M.; Körpeoǧlu, I.; Ulusoy, O. (Elsevier BV, 2008-03)
      The existence of a high degree of free riding is a serious threat to Peer-to-Peer (P2P) networks. In this paper, we propose a distributed framework to reduce the adverse effects of free riding on P2P networks. Our solution ...
    • Detecting user types in object ranking decisions 

      Lu, X.; Schaal, Markus; Adalı, S.; Raju, A. K. (ACM, 2009-10)
      With the emergence of Web 2.0 applications, where information is not only shared across the internet, but also syndicated, evaluated, selected, recombined, edited, etc., quality emergence by collaborative effort from many ...
    • A distributed and measurement-based framework against free riding in peer-to-peer networks 

      Karakaya, Murat; Korpeoglu, İbrahim; Ulusoy, Özgür (IEEE, 2004)
      In this paper, we propose a distributed and measurement-based method to reduce the degree of free riding in P2P networks. We primarily focus on developing schemes to locate free riders and on determining policies that can ...
    • Distributed construction and maintenance of bandwidth-efficient bluetooth scatternets 

      Tekkalmaz, Metin; Sözer, Hasan; Körpeoǧlu, İbrahim (IEEE, 2005-05)
      Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet ...
    • Energy cost model for frequent item set discovery in unstructured P2P networks 

      Cem, E.; Demirkaya, Ender; Esiner, E.; Ozaydin, B.; Ozkasap O. (Springer, London, 2012)
      For large scale distributed systems, designing energy efficient protocols and services has become as significant as considering conventional performance criteria like scalability, reliability, fault-tolerance and security. ...
    • Fault-tolerant irregular topology design method for network-on-chips 

      Tosun, S.; Ajabshir V.B.; Mercanoglu O.; Öztürk, Özcan (IEEE, 2014)
      As the technology sizes of integrated circuits (ICs) scale down rapidly, current transistor densities on chips dramatically increase. While nanometer feature sizes allow denser chip designs in each technology generation, ...
    • Fault-tolerant topology generation method for application-specific network-on-chips 

      Tosun, S.; Ajabshir, V. B.; Mercanoglu, O.; Ozturk, O. (Institute of Electrical and Electronics Engineers, 2015)
      As the technology sizes of integrated circuits (ICs) scale down rapidly, current transistor densities on chips dramatically increase. While nanometer feature sizes allow denser chip designs in each technology generation, ...
    • Flexible test-bed for unusual behavior detection 

      Petrás I.; Beleznai, C.; Dedeolğu, Yiğithan; Pards, M.; Kovács L.; Szlávik, Z.; Havasi L.; Szirányi, T.; Töreyin, B. Uğur; Güdükbay, Uğur; Çetin, A.hmet Enis; Canton-Ferrer, C. (ACM, 2007-07)
      Visual surveillance and activity analysis is an active research field of computer vision. As a result, there are several different algorithms produced for this purpose. To obtain more robust systems it is desirable to ...
    • Free riding in peer-to-peer networks 

      Karakaya, M.; Korpeoglu, I.; Ulusoy, Özgür (Institute of Electrical and Electronics Engineers, 2009)
      Free riding in peer-to-peer (P2P) networks poses a serious threat to their proper operation. Here, the authors present a variety of approaches developed to overcome this problem. They introduce several unique aspects of ...
    • Graph aware caching policy for distributed graph stores 

      Aksu, Hidayet; Canım, M.; Chang, Y.-C.; Körpeoğlu, İbrahim; Ulusoy, Özgür (IEEE, 2015-03)
      Graph stores are becoming increasingly popular among NOSQL applications seeking flexibility and heterogeneity in managing linked data. Conceptually and in practice, applications ranging from social networks, knowledge ...
    • Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories 

      Kaya, K.; Uçar, B.; Aykanat, Cevdet (Academic Press, 2007)
      We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and data repositories. The application consists of a large number of file-sharing otherwise independent ...
    • Minimum maximum-degree publish-subscribe overlay network design 

      Onus, Melih; Richa, A.W. (IEEE, 2011)
      Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to ...
    • Model-driven transformations for mapping parallel algorithms on parallel computing platforms 

      Arkin, E.; Tekinerdoğan, Bedir (MDHPCL, 2013)
      One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be implemented. ...
    • Multi-resolution social network community identification and maintenance on big data platform 

      Aksu, Hidayet; Canım, M.; Chang, Y.-C.; Körpeoğlu, İbrahim; Ulusoy, Özgür (IEEE, 2013-06-07)
      Community identification in social networks is of great interest and with dynamic changes to its graph representation and content, the incremental maintenance of community poses significant challenges in computation. ...
    • Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components 

      Ilkhechi, A. R.; Korpeoglu, I.; Ulusoy, Özgür (Elsevier BV, 2015)
      Following a shift from computing as a purchasable product to computing as a deliverable service to consumers over the Internet, cloud computing has emerged as a novel paradigm with an unprecedented success in turning utility ...