Search
Now showing items 1-10 of 13
Parallel discrete event simulation with predictors
(Texas A&M University, 1995)
The motivation for this research has been its applicability in sequence checking in a spacecraft's control commands. Spacecrafts are controlled by sequences of time-tagged control commands which are essentially onboard ...
Implicit function modeling of neuron morphology
(Texas A&M University, 1995)
Implicit functions are used to develop solid models of individual neurons as viewed at the limit of optical resolution. Stick models generated by the L-system grammars for several neuron types (pyramidal, stellate and motor ...
Scheduling on the MasPar SIMD parallel computer
(Texas A&M University, 1995)
This thesis studies the feasibility of a task scheduler for a parallel operating system. After analyzing several task scheduling algorithms, the highest level first algorithm was chosen. This algorithm has been empirically ...
Real-time communication in FDDI-based networks
(Texas A&M University, 1995)
The Fiber Distributed Data Interface (FDDI) is recommended as a candidate for many hard real-time local-area communication systems. The Timed-Token Medium Access Control (MAC) Protocol of FDDI is capable of guaranteeing ...
Transparent process rollback recovery: some new techniques and a portable implementation
(Texas A&M University, 1995)
Processes in a distributed system can be made transparently recoverable through the use of process checkpointing, which periodically introduces a relatively large but temporary overhead, or message logging, which introduces ...
Providing ordered message delivery in communication network systems
(Texas A&M University, 1995)
Many previous papers about network protocols have focused their attention on totally non-FIFO networks where packets may be delivered arbitrarily out of order relative to their sending order. More realistic networks have ...
A hybrid of the genetic algorithm and concurrent simplex
(Texas A&M University, 1995)
Not available
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 ...
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 ...