Thesis (Ph. D.)--University of Texas at Austin, 2003. / Supervisors: Martin D.F. Wong and Aloysius K. Mok. Vita. Includes bibliographical references. Available also from UMI Company.

Thesis (M. Phil.)--University of Hong Kong, 1995. / Includes bibliographical references (leaves 120-126).

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 134-144). Available also in a digital version from Dissertation Abstracts.

The electronic design automation (EDA) tools are a specific set of software that play important roles in modern integrated circuit (IC) design. These software automate the design processes of IC with various stages. Among these stages, two important EDA design tools are the focus of this research: floorplanning and global routing. Specifically, the goal of this study is to parallelize these two tools such that their execution time can be significantly shortened on modern multi-core and graphics processing unit (GPU) architectures. The GPU hardware is a massively parallel architecture, enabling thousands of independent threads to execute concurrently. Although a small set of EDA tools can benefit from using GPU to accelerate their speed, most algorithms in this field are designed with the single-core paradigm in mind. The floorplanning and global routing algorithms are among the latter, and difficult to render any speedup on the GPU due to their inherent sequential nature. This work parallelizes the floorplanning and global routing algorithm through a novel approach and results in significant speedups for both tools implemented on the GPU hardware. Specifically, with a complete overhaul of solution space and design space exploration, a GPU-based floorplanning algorithm is able to render 4-166X speedup, while achieving similar or improved solutions compared with the sequential algorithm. The GPU-based global routing algorithm is shown to achieve significant speedup against existing state-of-the-art routers, while delivering competitive solution quality. Importantly, this parallel model for global routing renders a stable solution that is independent from the level of parallelism. In summary, this research has shown that through a design paradigm overhaul, sequential algorithms can also benefit from the massively parallel architecture. The findings of this study have a positive impact on the efficiency and design quality of modern EDA design flow.

The goal of this thesis is the analysis of ways of graphic form of algorithms and their editors, design of editor for making kopenograms from source code and implementation of this editor what will work as part of plugin made for the NetBeans IDE. In the beginning of the thesis will be described a principles of structured programing, enlisted used ways of visualization of source code -- modeling language UML and other possibilities of graphic form of algorithm like flowchart diagrams, Nassi-Shneiderman diagrams, Jackson diagrams and especially not as well-known kopenograms. In the second part of the thesis is described creation of editor used to visualization of kopenograms. In the chapters is described structure of creating of application, the editors what are available for its creation, phase of creating editor and final testing for approve of the success. Part of the thesis is also a user guide for beginning with this program. Application what was made in this thesis is part of the plugin BJ2NB and will be used for education support of programming and algorithms on The University of Economics, Prague.

<p dir="ltr">Autonomous robots can perform dangerous and tedious tasks, eliminating the need for human involvement. To deploy an autonomous robot in the field, a typical planning and control hierarchy is used, consisting of a high-level planner, a mid-level motion planner, and a low-level tracking controller. In applications such as simultaneous localization and mapping, package delivery, logistics, and surveillance, a group of autonomous robots can be more efficient and resilient than a single robot. However, deploying a multi-robot team by directly aggregating each robot's planning hierarchy into a larger, centralized hierarchy faces challenges related to scalability, resilience, and real-time computation. Distributed algorithms offer a promising solution for introducing effective coordination within a network of robots, addressing these issues. This thesis explores the application of distributed algorithms in multi-robot systems, focusing on several essential components required to enable distributed multi-robot coordination, both in general terms and for specific applications.</p>