Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (5)
- Engineering (4)
- Theory and Algorithms (4)
- Chemistry (2)
- Computer Engineering (2)
-
- Computer and Systems Architecture (2)
- Electrical and Computer Engineering (2)
- Operations Research, Systems Engineering and Industrial Engineering (2)
- Other Operations Research, Systems Engineering and Industrial Engineering (2)
- VLSI and Circuits, Embedded and Hardware Systems (2)
- Programming Languages and Compilers (1)
- Systems Architecture (1)
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Modeling And Comparison Of Wormhole Routed Mesh And Torus Networks, Ronald I. Greenberg, Lee Guan
Modeling And Comparison Of Wormhole Routed Mesh And Torus Networks, Ronald I. Greenberg, Lee Guan
Computer Science: Faculty Publications and Other Works
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel computers. In addition, wormhole routing has increasingly been advocated as a method of reducing latency. Most analysis of wormhole routed networks, however, has focused on the torus and the broader class of k-ary n-cubes to which it belongs. This paper presents a performance model for the wormhole routed mesh, and it compares the performance of the mesh and torus based on theoretical and empirical analyses.
Serotonin 5-Ht4 Agonist Activity Of A Series Of Meso-Azanoradamantane Benzamides, Daniel Becker, Roger Nosal, Clara I. Villamil, Gary Gullikson
Serotonin 5-Ht4 Agonist Activity Of A Series Of Meso-Azanoradamantane Benzamides, Daniel Becker, Roger Nosal, Clara I. Villamil, Gary Gullikson
Chemistry: Faculty Publications and Other Works
A series of meso-amino(methyl)azanoradamantane benzamides has been prepared and evaluated for 5-HT4agonism activity in the rat tunica muscularis mucosae (TMM) assay. Compound 8i is the most potent 5-HT4agonist in the series, with an EC50 of 217 nM.
An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan
An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan
Computer Science: Faculty Publications and Other Works
A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.
Technologies For Ubiquitous Supercomputing: A Java Interface To The Nexus Communication System, Ian Foster, George K. Thiruvathukal, Steven Tuecke
Technologies For Ubiquitous Supercomputing: A Java Interface To The Nexus Communication System, Ian Foster, George K. Thiruvathukal, Steven Tuecke
Computer Science: Faculty Publications and Other Works
We use the term ubiquitous supercomputing to refer to systems that integrate low- and mid-range computing systems, advanced networks and remote high-end computers with the goal of enhancing the computational power accessible from local environments. Such systems promise to enable new applications in areas as diverse as smart instruments and collaborative environments. However, they also demand tools for transporting code between computers and for establishing flexible, dynamic communication structures. In this article, we propose that these requirements be satisfied by introducing Java classes that implement the global pointer and remote service request mechanisms defined by a communication library called Nexus. …
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Computer Science: Faculty Publications and Other Works
We give algorithms to minimize density for VLSI channel routing problems with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, we improve previous results for running time and space by a factor of L/\lgn and L, respectively, where L is the channel length, and n is the number of terminals.
Synthetic Strategies For The Construction Of Enantiomeric Azanoradamantanes, Daniel Becker, Roger Nosal, Daniel L. Zabrowski, Daniel Flynn
Synthetic Strategies For The Construction Of Enantiomeric Azanoradamantanes, Daniel Becker, Roger Nosal, Daniel L. Zabrowski, Daniel Flynn
Chemistry: Faculty Publications and Other Works
The amino azanoradamantane hexahydro-2,5b-methano-IH-3aS,3aa,6aa-cyclopenta-[clpyrrole-4a-amine 1and the corresponding enantiomer ent-1 have been prepared along with benzamide derivatives SC-52491and SC-52490, respectively, which are of pharmaceutical interest. The key meso-azabicyclo[3.3.0] intermediate 3 was prepared via three separate routes: a [3+2] cycloaddition route, a radical cyclization/ionic cyclization route, and a reductive Pauson-Khand route.
Parallel Algorithms For Single-Layer Channel Routing, Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih
Parallel Algorithms For Single-Layer Channel Routing, Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih
Computer Science: Faculty Publications and Other Works
We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We consider all the variations of these problems that are known to have linear- time sequential solutions rather than limiting attention to the "river-routing" context, where single-sided connections are disallowed. For the minimum separation problem, we obtain O(lgN) time on a CREW PRAM or O(lgN / lglgN) time on a (common) CRCW PRAM, both with optimal work (processor- time product) of O(N), where N is the number of terminals. For the offset range problem, we obtain the same time and processor …