Search
Now showing items 91-100 of 169
Application of functional learning to ATPG and design verification for combinational circuits
(Texas A&M University, 1994)
Recently, learning-based techniques have been proposed as an efficient alternative to the traditional branch-and-bound techniques for test generation. The learning techniques have been shown to be extremely effective in ...
Graph algorithms experimentation facility
(Texas A&M University, 1994)
We provide a facility to experiment with graph algorithms. The facility is implemented as a client to XAGE, a software environment developed under the direction of Dr. James Abello. XAGE allows a user to visually animate ...
Scheduling of real-time communication network for parallel processing
(Texas A&M University, 1995)
As real-time applications become more and more complicated their demands of processing capacity can hardly be satisfied. Massively parallel computers, such as Intel Paragon, with their scalable architecture and tremendous ...
Timing analysis of logic=level digital circuits using uncertainty intervals
(Texas A&M University, 1996)
Timing Analysis of Logic-Level Digital Circuits Using Competitive design of modem digital circuits requires high performance at reduced cost and time-to-market. Timing analysis is increasingly used to deal with the more ...
Some applications of pipelining techniques in parallel scientific computing
(Texas A&M University, 1996)
In this thesis, we study the applicability of pipelining techniques to the development of parallel algorithms for scientific computation. General principles for pipelining techniques are discussed and two applications, ...
Software implemented fault-tolernace on distributed-memory MIMD architectures
(Texas A&M University, 1995)
Large multicomputer systems are inherently unreliable because of their enormous complexity. This has a direct impact on distributed computations performed on these systems. As the size and execution time of these distributed ...
A dynamic cache sub-lock design to reduce false sharing
(Texas A&M University, 1995)
Parallel applications suffer from significant bus traffic due to the transfer of shared data. Large block sizes exploit locality and decrease the effective memory access time. It also has a tendency to group data together ...
Developing a cost model for communication on a symmetric multiprocessor
(Texas A&M University, 1998)
Despite numerous advances in hardware design, the full ics. potential of today's parallel processing systems is rarely realized due to the difficulty in predicting how a particular algorithm will utilize the underlying ...
An evaluation of the storage systems based on network-attached disks
(Texas A&M University, 1998)
The emergence of network-attached disks provides the phics. possibility of transferring data between the storage system and the client directly. This offers new possibilities in building a distributed storage system. In ...
Compiler integration of speculative run time parallelization techniques
(Texas A&M University, 1998)
Current parallelizing compilers cannot. identify a raphics. significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently ...