Now showing items 1-20 of 117

    • 1.5D parallel sparse matrix-vector multiply 

      Kayaaslan, E.; Aykanat, Cevdet; Uçar, B. (Society for Industrial and Applied Mathematics, 2018)
      There are three common parallel sparse matrix-vector multiply algorithms: 1D row-parallel, 1D column-parallel, and 2D row-column-parallel. The 1D parallel algorithms offer the advantage of having only one communication ...
    • Active node determination for correlated data gathering in wireless sensor networks 

      Karasabun, E.; Korpeoglu, I.; Aykanat, Cevdet (Elsevier BV, 2013-04-07)
      In wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. Given that the sensor nodes that ...
    • Active pixel merging on hypercube multicomputers 

      Kurç, Tahsin M.; Aykanat, Cevdet; Özgüç, Bülent (Springer, Berlin, Heidelberg, 1996)
      This paper presents algorithms developed for pixel merging phase of object-space parallel polygon rendering on hypercube-connected multicomputers. These algorithms reduce volume of communication in pixel merging phase by ...
    • Adapting iterative-improvement heuristics for scheduling file-sharing tasks on heterogeneous platforms 

      Kaya, Kamer; Uçar, B.; Aykanat, Cevdet (Springer, Berlin, Heidelberg, 2008)
      We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and one or more file repositories. The application consists of a large number of file-sharing, otherwise ...
    • 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 ...
    • Adaptive routing on the new switch chip for IBM SP systems 

      Abali, B.; Stunkel, C. B.; Herring, J.; Banikazemi, M.; Panda, D. K.; Aykanat, Cevdet; Aydogan, Y. (Academic Press, 2001)
      The IBM RS/6000 SP is one of the most successful commercially available multicomputers. SP owes its success partially to the scalable, high bandwidth, low latency network. This paper describes the architecture of Switch2 ...
    • Adaptive source routing in multistage interconnection networks 

      Aydoğan, Yücel; Stunkel, C. B.; Aykanat, Cevdet; Abali, B. (IEEE, 1996-04)
      We describe the adaptive source routing (ASR) method which is a first attempt to combine adaptive routing and source routing methods. In ASR, the adaptivity of each packet is determined at the source processor. Every packet ...
    • Addressing volume and latency overheads in 1d-parallel sparse matrix-vector multiplication 

      Acer, Seher; Selvitopi, Oğuz; Aykanat, Cevdet (Springer, 2017-08-09)
      The scalability of sparse matrix-vector multiplication (SpMV) on distributed memory systems depends on multiple factors that involve different communication cost metrics. The irregular sparsity pattern of the coefficient ...
    • Algorithms for efficient vectorization of repeated sparse power system network computations 

      Aykanat, Cevdet; Özgü, Ö.; Güven, N. (IEEE, 1995)
      Standard sparsity-based algorithms used in power system appllcations need to be restructured for efficient vectorization due to the extremely short vectors processed. Further, intrinsic architectural features of vector ...
    • Architecture of a grid-enabled Web search engine 

      Cambazoglu, B. B.; Karaca, E.; Kucukyilmaz T.; Turk, A.; Aykanat, Cevdet (Elsevier Ltd, 2007)
      Search Engine for South-East Europe (SE4SEE) is a socio-cultural search engine running on the grid infrastructure. It offers a personalized, on-demand, country-specific, category-based Web search facility. The main goal ...
    • Cartesian partitioning models for 2D and 3D parallel SpGEMM algorithms 

      Demirci, Gündüz Vehbi; Aykanat, Cevdet (IEEE, 2020)
      The focus is distributed-memory parallelization of sparse-general-matrix-multiplication (SpGEMM). Parallel SpGEMM algorithms are classified under one-dimensional (1D), 2D, and 3D categories denoting the number of dimensions ...
    • Cascade-aware partitioning of large graph databases 

      Demirci, Gündüz Vehbi; Ferhatosmanoğlu, H.; Aykanat, Cevdet (Springer, 2019)
      Graph partitioning is an essential task for scalable data management and analysis. The current partitioning methods utilize the structure of the graph, and the query log if available. Some queries performed on the database ...
    • Chat mining for gender prediction 

      Küçükyılmaz, Tayfun; Cambazoğlu, B. Barla; Aykanat, Cevdet; Can, Fazlı (Springer, 2006-10)
      The aim of this paper is to investigate the feasibility of predicting the gender of a text document's author using linguistic evidence. For this purpose, term- and style-based classification techniques are evaluated over ...
    • Chat mining: predicting user and message attributes in computer-mediated communication 

      Kucukyilmaz T.; Cambazoglu, B. B.; Aykanat, Cevdet; Can, F. (Elsevier Ltd, 2008-07)
      The focus of this paper is to investigate the possibility of predicting several user and message attributes in text-based, real-time, online messaging services. For this purpose, a large collection of chat messages is ...
    • Circuit partitioning using mean field annealing 

      Bultan, T.; Aykanat, Cevdet (Elsevier, 1995)
      Mean field annealing (MFA) algorithm, proposed for solving combinatorial optimization problems, combines the characteristics of neural networks and simulated annealing. Previous works on MFA resulted with successful mapping ...
    • Clustering spatial networks for aggregate query processing: a hypergraph approach 

      Demir, E.; Aykanat, Cevdet; Cambazoglu, B. B. (Elsevier Ltd, 2008-03)
      In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query processing. For this purpose, different techniques ...
    • CoDet: Sentence-based containment detection in news corpora 

      Varol, Emre; Can, Fazlı; Aykanat, Cevdet; Kaya, Oğuz (ACM, 2011)
      We study a generalized version of the near-duplicate detection problem which concerns whether a document is a subset of another document. In text-based applications, document containment can be observed in exact-duplicates, ...
    • Comparison of two image-space subdivision algorithms for direct volume rendering on distributed-memory multicomputers 

      Tanin, Egemen; Kurç, Tahsin M.; Aykanat, Cevdet; Özgüç, Bülent (Springer, 1995-08)
      Direct Volume Rendering (DVR) is a powerful technique for visualizing volumetric data sets. However, it involves intensive computations. In addition, most of the volumetric data sets consist of large number of 3D sampling ...
    • Constrained min-cut replication for K-way hypergraph partitioning 

      Yazici V.; Aykanat, Cevdet (Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)
      Replication is a widely-used technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning ...
    • Data and model driven hybrid approach to activity scoring of cyclic pathways 

      Işık, Z.; Atalay V.; Aykanat, Cevdet; Çetin-Atalay, Rengül (Springer, Dordrecht, 2010)
      Analysis of large scale -omics data based on a single tool remains inefficient to reveal molecular basis of cellular events. Therefore, data integration from multiple heterogeneous sources is highly desirable and required. ...