Browsing by Subject "Multicomputers"

Filter results by typing the first few letters
Now showing 1 - 6 of 6
  • Thumbnail Image
    ItemOpen Access
    Active pixel merging on hypercube multicomputers
    (Springer, Berlin, Heidelberg, 1996) Kurç, Tahsin M.; Aykanat, Cevdet; Özgüç, Bülent
    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 only exchanging local foremost pixels. In order to avoid message fragmentation, local foremost pixels should be stored in consecutive memory locations. An algorithm, called modified seanline z-buffer, is proposed to store local foremost pixels efficiently. This algorithm also avoids the initialization of scanline z-buffer for each scanline on the screen. Good processor utilization is achieved by subdividing the image-space among the processors in pixel merging phase. Efficient algorithms for load balancing in the pixel merging phase are also proposed and presented. Experimental results obtained on a 16-processor Intel's iPSC/2 hypercube multicomputer are presented. © Springer-Verlag Berlin Heidelberg 1996.
  • Thumbnail Image
    ItemOpen Access
    Adaptive source routing and route generation for multicomputers
    (1995) Aydoğan, Yücel
    Scalable multicomputers are based upon interconnection networks that typically provide multiple communication routes between any given pair of processor nodes. In such networks, the selection of the routes is an important problem because of its impact on the communication performance. We propose the adaptive source routing (ASR) scheme which combines adaptive routing and source routing into one which has the advantages of both schemes. In ASR, the degree of adaptivity of each packet is determined at the source processor. Every packet can be routed in a fully adaptive or partially adaptive or nonadaptive manner, all within the same network at the same time. The ASR scheme permits any network topology to be used provided that deadlock constraints are satisfied. We evaluate and compare performance of the adaptive source routing and non-adaptive randomized routing by simulations. Also we propose an algorithm to generate adaptive routes for all pairs of processors in any multistage interconnection network. Adaptive routes are stored in a route table in each processor’s memory and provide high bandwidth and reliable interprocessor communication. We evaluate the performance of the algorithm on IBM SP2 networks in terms of obtained bandwidth, time to fill in the route tables, and efficiency exploited by the parallel execution of the algorithm.
  • Thumbnail Image
    ItemOpen Access
    Efficient parallel spatial subdivision algorithm for object-based parallel ray tracing
    (Pergamon Press, 1994) Aykanat, Cevdet; İşler, V.; Özgüç, B.
    Parallel ray tracing of complex scenes on multicomputers requires the distribution of both computation and scene data to the processors. This is carried out during preprocessing and usually consumes too much time and memory. The paper presents an efficient parallel subdivision algorithm that decomposes a given scene into rectangular regions adaptively and maps the resultant regions to the node processors of a multicomputer. The proposed algorithm uses efficient data structures to identify the splitting planes quickly. Furthermore the mapping of the regions and the objects to the node processors is performed while parallel spatial subdivision proceeds. The proposed algorithm is implemented on an Intel iPSC/2 hypercube multicomputer and promising results have been obtained. © 1994.
  • Thumbnail Image
    ItemOpen Access
    Object-space parallel polygon rendering on hypercubes
    (Pergamon Press, 1998) Kurç, T. M.; Aykanat, Cevdet; Özgüç, B.
    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 message fragmentation by packing local foremost pixels in consecutive memory locations efficiently, and it eliminates the initialization of scanline z-buffer for each scanline. Several algorithms, utilizing different communication strategies and topological embeddings, are proposed for global z-buffering of local foremost pixels during the pixel merging phase. The performance comparison of these pixel merging algorithms are presented based on the communication overhead incurred in each scheme. Two adaptive screen subdivision heuristics are proposed for load balancing in the pixel merging phase. These heuristics utilize the distribution of foremost pixels on the screen for the subdivision. Experimental results obtained on an Intel's iPSC/2 hypercube multicomputer and a Parsytec CC system are presented. Rendering rates of 300K-700K triangles per second are attained on 16 processors of Parsytec CC system in the rendering of datasets from publicly available SPD database. (C) 1998 Elsevier Science Ltd. All rights reserved.
  • Thumbnail Image
    ItemOpen Access
    Parallel mapping and circuit partitioning heuristics based on mean field annealing
    (1992) Bultan, Tevfik
    Moan Field Annealinp; (MFA) aJgoritlim, receñí,ly proposc'd for solving com binatorial optimization problems, combines the characteristics of nenral networks and simulated annealing. In this thesis, MFA is formulated for tlie mapping i)roblcm and the circuit partitioning problem. EHicient implementation schemes, which decrease the complexity of the proposed algorithms by asymptotical factors, are also given. Perlormances of the proposed MFA algorithms are evaluated in comparison with two well-known heuristics: simulated annealing and Kernighan-Lin. Results of the experiments indicate that MFA can be used as an alternative heuristic for the mapping problem and the circuit partitioning problem. Inherent parallelism of the MFA is exploited by designing efficient parallel algorithms for the proposed MFA heuristics. Parallel MFA algorithms proposed for solving the circuit partitioning problem are implemented on an iPS(J/2’ hypercube multicompute.r. Experimental results show that the proposed heuristics can be efficiently parallelized, which is crucial for algorithms that solve such computationally hard problems.
  • Thumbnail Image
    ItemOpen Access
    Parallel processing for progressive refinement radiosity
    (1993) Çapın, Tolga K.
    Progressive refinement radiosity is an increasingly popular method for realistic image synthesis of non-existing environments. The method successfully approximates the light distribution in an environment, however it requires excessive amount of computation. In this thesis, the progressive refinement method is investigated for parallelization on ring and hypercube-connected multicomputers. Two different approaches for parallelization, based on synchronous parallelism witli static task assignment, are proposed, in order to achieve better coherence in parallel light distributions and obtain good performance on simple topologies. Efficient global circulation schemes are proposed in order to decrease the total volume of communication by asymptotical factors. The first scheme for parallelization is a modification of the sequential algorithm in that several patches shoot their energy at a time, while the second scheme is based on the parallelism level of one shooting patch at a time. The proposed parallel algorithms are evaluated theoretically and implemented for ring and hypercube-connected topologies on Intel’s iPSC72 multicomputer. Load balance quality of the proposed schemes are evaluated experimentally