Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg
The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more …
A Macro Extension For The Woody Assembly Language, Lewis Barnett Iii
A Macro Extension For The Woody Assembly Language, Lewis Barnett Iii
Department of Math & Statistics Technical Report Series
We discuss an extension to the Woody Assembly Language [Cha94] which allows new instructions to be defined. The mechanism is similar to the C language's #define macros, allowing a name to be supplied for a piece of code which will be expanded in line. Provisions are made for writing new non-destructive branching instructions as well as instructions which are simply new names for commonly used bits of code.
An Algorithmic Palette Tool, Gary R. Greenfield
An Algorithmic Palette Tool, Gary R. Greenfield
Department of Math & Statistics Technical Report Series
Our algorithmic tool follows the model of RGB percentage curves, but now the control of these curves is though algorithms that indirectly, and more abstractly, create, evolve, and modify such curves. To fully explain our methods we must first introduce the topic "mutating expressions." This is done in Section Two. In Section Three we document the user-interface problems we dealt with, and finally in Section Four discuss conclusions and suggest ideas for future exploration. Before commencing with the technical details however, we wish to emphasize the nature of the "colorization" problem that led to the conception and development of our …
Merlin's Magic Square Enhanced, Gary R. Greenfield
Merlin's Magic Square Enhanced, Gary R. Greenfield
Department of Math & Statistics Technical Report Series
This paper first considers questions about games related to Merlin's Magic Square from the point of view of group actions. At this juncture, little beyond the formal model is new, but the exposition sets the stage for considering certain "enhanced" versions of these games. The analysis of enhanced games, with the aid of semigroup actions, is carried out in complete detail for an ostensibly simpler (k = 3) game before turning to a Merlin ( k = 4) game. Concluding sections discuss various ways to generalize our games.
To review the solution to Merlin's Magic Square, we begin by introducing …
Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd
Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd
Faculty Publications
Fast computer simulation is an essential tool in the design of large parallel computers. We discuss the design and performance of our Fast Accurate Simulation Tool, FAST. We start by summarizing the tradeoffs made in the designs of this and other simulators. The key ideas used in this simulator involve execution driven simulation techniques that modify the object code of the application program being studied. This produces an augmented version of the code that is directly executed and performs much of the work of the simulation. We extend the previous work in execution driven simulation by introducing several new uses …
Distributed Memo: A Heterogeneously Distributed And Parallel Software Development Environment, William T. O'Connell, George K. Thiruvathukal, Thomas W. Christopher
Distributed Memo: A Heterogeneously Distributed And Parallel Software Development Environment, William T. O'Connell, George K. Thiruvathukal, Thomas W. Christopher
Computer Science: Faculty Publications and Other Works
Heterogeneously distributed and parallel computing environments are highly dependent on hardware, data migration, and protocols. The result is significant difficulty in software reuse, portability across platforms, and an increased overall development effort. The appearance of a shared directory of unordered queues can be provided by integrating heterogeneous computers transparently. This integration provides a conducive environment for parallel and distributed application development, by abstracting the issues of hardware and communication. Object oriented technology is exploited to provide this seamless environment.