Mapping and FPGA global routing using Mean Field Annealing

Ankara : Department of Computer Engineering and Information Science and Institute of Engineering and Science, Bilkent University, 1994.Thesis (Master's) -- -Bilkent University, 1994.Includes bibliographical references leaves 71-73Haritaoğlu, İsmailM.S

Technology 2002: The Third National Technology Transfer Conference and Exposition, volume 2

Proceedings from symposia of the Technology 2002 Conference and Exposition, December 1-3, 1992, Baltimore, MD. Volume 2 features 60 papers presented during 30 concurrent sessions

High-Performance and Power-Aware Graph Processing on GPUs

Graphs are a common representation in many problem domains, including engineering, finance, medicine, and scientific applications. Different problems map to very large graphs, often involving millions of vertices. Even though very efficient sequential implementations of graph algorithms exist, they become impractical when applied on such actual very large graphs. On the other hand, graphics processing units (GPUs) have become widespread architectures as they provide massive parallelism at low cost. Parallel execution on GPUs may achieve speedup up to three orders of magnitude with respect to the sequential counterparts. Nevertheless, accelerating efficient and optimized sequential algorithms and porting (i.e., parallelizing) their implementation to such many-core architectures is a very challenging task. The task is made even harder since energy and power consumption are becoming constraints in addition, or in same case as an alternative, to performance. This work aims at developing a platform that provides (I) a library of parallel, efficient, and tunable implementations of the most important graph algorithms for GPUs, and (II) an advanced profiling model to analyze both performance and power consumption of the algorithm implementations. The platform goal is twofold. Through the library, it aims at saving developing effort in the parallelization task through a primitive-based approach. Through the profiling framework, it aims at customizing such primitives by considering both the architectural details and the target efficiency metrics (i.e., performance or power)

Parallel implementations of dynamic traffic assignment models and algorithms for dynamic shortest path problems

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2004.Includes bibliographical references (p. 139-144).This thesis aims at the development of faster Dynamic Traffic Assignment (DTA) models to meet the computational efficiency required by real world applications. A DTA model can be decomposed into several sub-models, of which the most time consuming ones are the dynamic network loading model and the user's route choice model. We apply parallel computing technology to the dynamic network loading model to achieve faster implementations. To the best of our knowledge, this concerns the first parallel implementations of macroscopic DTA models. Two loading algorithms are studied: the iterative loading algorithm and the chronological loading algorithm. For the iterative loading algorithm, two parallelization strategies are implemented: decomposition by network topology and by time. For the chronological loading algorithm, the network topology decomposition strategy is implemented. Computational tests are carried out in a distributed-memory environment. Satisfactory speedups are achieved. We design efficient shortest path algorithms to speedup the user's route choice model. We first present a framework for static shortest path algorithms, which prioritize nodes with optimal distance labels in the scan eligible list. Then we apply the framework in dynamic FIFO, strict FIFO, and static networks. Computational tests show significant speedups. We proceed to present two other shortest path algorithms: Algorithm Delta and Algorithm Hierarchy. We also provide the evaluations of the algorithms.by Hai Jiang.S.M

Underwater Vehicles

For the latest twenty to thirty years, a significant number of AUVs has been created for the solving of wide spectrum of scientific and applied tasks of ocean development and research. For the short time period the AUVs have shown the efficiency at performance of complex search and inspection works and opened a number of new important applications. Initially the information about AUVs had mainly review-advertising character but now more attention is paid to practical achievements, problems and systems technologies. AUVs are losing their prototype status and have become a fully operational, reliable and effective tool and modern multi-purpose AUVs represent the new class of underwater robotic objects with inherent tasks and practical applications, particular features of technology, systems structure and functional properties

Graduate catalog, University of Missouri--Columbia, 2001-2003

208 page