Now showing items 1-8 of 8

    • Active pixel merging on hypercube multicomputers 

      Kurç, T. M.; Aykanat, C.; Özgüç, B. (Springer, 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 ...
    • Balanced parallel sort on hypercube multiprocessors 

      Abali, B.; Özgüner, F.; Bataineh, A. (IEEE, 1993)
      A parallel sorting algorithm for sorting n elements evenly distributed over Zd = p nodes of a d-dimensional hypercube is presented. The average running time of the algorithm is O( (n log n)/p + p log2 n). The algorithm ...
    • Efficient fast hartley transform algorithms for hypercube-connected multicomputers 

      Aykanat, C.; Derviş, A. (IEEE, 1995)
      Although fast Hartley transform (FHT) provides efficient spectral analysis of real discrete signals, the literature that addresses the parallelization of FHT is extremely rare. FHT is a real transformation and does not ...
    • Efficient overlapped FFT algorithms for hypercube-connected multicomputers 

      Aykanat, C.; Dervis, A. (1994)
      In this work, we propose parallel FFT algorithms, for medium-to-coarse grain hypercube-connected multicomputers, which are more elegant and efficient than the existing ones. The proposed algorithms achieve perfect load-balance ...
    • Efficient parallel digital signal processing algorithms for hypercube-connected multicomputers 

      Derviş, Argun (Bilkent University, 1992)
      In this thesis, efficient parallelization of Digital Signal Processing (DSP) algorithms, (FFT, FHT and FCT), on multicomputers implementing the hypercube interconnection topology are investigated. The proposed ...
    • Iterative algorithms for solution of large sparse systems of linear equations on hypercubes 

      Aykanat, C.; Özgüner, F.; Ercal, F.; Sadayappan, P. (IEEE, 1988)
      Finite-element discretization produces linear equations in the form Ax=b, where A is large, sparse, and banded with proper ordering of the variables x. The solution of such equations on distributed-memory message-passing ...
    • A new mapping heuristic based on mean field annealing 

      Bultan, T.; Aykanat, C. (Academic Press, 1992)
      A new mapping heuristic is developed, based on the recently proposed Mean Field Annealing (MFA) algorithm. An e cient implementation scheme, which decreases the complexity of the proposed algorithm by asymptotical factors, ...
    • Object-space parallel polygon rendering on hypercubes 

      Kurç, T. M.; Aykanat, C.; Özgüç, B. (Pergamon Press, 1998)
      This paper presents algorithms for object-space parallel polygon rendering on hypercube-connected multicomputers. A modified scanline z-buffer algorithm is proposed for local rendering phase. The proposed algorithm avoids ...