Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Fat-trees (2)
- Parallel computation (2)
- Randomized routing (2)
- Area-universal networks (1)
- Attribute Relationship (1)
-
- Automatic Reasoning for Schema Integration (1)
- CANDIDE (1)
- Finite-state machines. (1)
- Information Semantics (1)
- Interconnection networks (1)
- KL-ONE (1)
- Layout algorithms (1)
- Message routing (1)
- Multilayer channel routing (1)
- Object Class Relationship (1)
- Real World Semantics (1)
- Routing algorithms (1)
- Routing networks (1)
- Schema Integration (1)
- Semantic Cluster (1)
- Semantic Space (1)
- Single-layer routing (1)
- Supercomputers (1)
- Universality (1)
- VLSI (1)
Articles 1 - 4 of 4
Full-Text Articles in OS and Networks
Attribute Relationships: An Impediment In Automating Schema Integration, Amit P. Sheth, Sunit K. Gala
Attribute Relationships: An Impediment In Automating Schema Integration, Amit P. Sheth, Sunit K. Gala
Kno.e.sis Publications
Success in schema integration depends on understanding the semantics of schema components (e.g., entity sets, relationship sets, attributes), and the ability to capture and reason about these semantics. An important objective of our work on schema integration is to automate the reasoning as much as possible, and when not possible, depend on the human input and guidance. A key results of comparing the semantics associated with schema objects is that of determining attribute relationship. Once attribute relationships are determined, the task of object class(e.g., entity sets and relationship sets) integration becomes simpler and can e automated to a great extent. …
Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg
Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first case, the goal is to construct efficient interconnection networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a final part of this thesis provides lower bounds on the area required for VLSI implementations of finite-state machines. This thesis shows that networks based on Leiserson's fat-tree architecture are nearly as good as any network built in a comparable amount of physical space. It shows that these "universal" networks …
Fault Tolerance In A Very Large Database System: A Strawman Analysis, Amit P. Sheth
Fault Tolerance In A Very Large Database System: A Strawman Analysis, Amit P. Sheth
Kno.e.sis Publications
A simple model is used to study the effect of fault-tolerance techniques and system design on system availability. A generic multiprocessor architecture is used that can be configured in different ways to study the effect of system architectures. Important parameters studied are different system architectures and hardware fault-tolerance techniques, mean time to failure of basic components, database size and distribution, interconnect capacity, etc. Quantitative analysis compares the relative effect of different parameter values. Results show that the effect of different parameter values on system availability can be very significant. System architecture, use of hardware fault tolerance (particularly mirroring), and data …
Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson
Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson
Computer Science: Faculty Publications and Other Works
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda + lg n lg lg n) with probability 1-O(1/n). The best previous …