9921396
MASCO: The Design of a Microprogrammed Processor
{PG,1 A chrysanthemum cultivar particularly characterized as to uniqueness by the combined characteristics of flat capitulum form; daisy capitulum type; white ray floret color; diameter across face of capitulum ranging from 100 to 120 mm. at maturity; uniform 7 week photoperiodic flowering response to short days; tall plant height when grown as a single stem cut spray; and semi-upright branching pattern.
40935363
Beacon Signals: What, Why, How, and Where?
Beacons are primarily radio, ultrasonic, optical, laser or other types of signals that indicate the proximity or location of a device or its readiness to perform a task. Beacon signals also carry several critical, constantly changing parameters, such as power-supply information, relative address, location, timestamp, signal strength, available bandwidth resources, temperature and pressure. Although transparent to the user community, beacon signals have made wireless systems more intelligent and human-like. They are an integral part of numerous scientific and commercial applications, ranging from mobile networks to search-and-rescue operations and location-tracking systems. Beacon signals help synchronize, coordinate and manage electronic resources using miniscule bandwidth. Researchers continue to improve their functionality by increasing signal coverage while optimizing energy consumption. Beacon signals' imperceptibility and usefulness in minimizing communication delays and interference are spurring exploratory efforts in many domains, ranging from the home to outer space.
12069872
A Pipelined Pseudoparallel System Architecture for Real-Time Dynamic Scene Analysis
In this paper we introduce the concept of pseudoparallelism, in which the serial algorithm is partitioned into several noninteractive independent subtasks so that parallelism can be used within each subtask level. This approach is illustrated by applying it to a real-time dynamic scene analysis. Complete details of such a pseudoparallel architecture with an emphasis to avoid interprocessor communications have been worked out. Problems encountered in the course of designing such a system with a distributed operating system (no master control) have been outlined and necessary justifications have been provided. A scheme indicating various memory modules, processing elements, and their data-path requirements is included and ways to provide continuous flow of partitioned information in the form of a synchronized pipeline are described.
206573169
A Task Duplication Based Scalable Scheduling Algorithm for Distributed Memory Systems
One of the major limitations of distributed memory systems (DMSs) is the high cost for interprocessor communication, which can be minimized by having an efficient task partitioning and scheduling algorithm. It is well known that scheduling the tasks of a directed acyclic graph (DAG) to obtain an optimal solution is a strong NP-hard problem. This paper presents a scalable task duplication based scheduling (STDS) algorithm which can schedule the tasks of a DAG onto the processors of a DMS with a worst case complexity ofO(|V|2), where |V| is the number of nodes of the DAG. This algorithm generates an optimal schedule for DAGs provided a cost relationship is satisfied and if the required number of processors are available. The STDS algorithm generates a schedule for the number of processors available in the system. The performance of the STDS algorithm has been observed by comparing the parallel execution times for practical DAGs with the theoretical lowerbound.
40094538
A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
This paper introduces a generic methodology for defining deadlock-free wormhole routing schemes in any arbitrary network. The basic strategy is to partition a graph into subdigraphs with no cyclic dependencies and selectively assign virtual channels. The usefulness of our scheme is shown for the n-dimensional hypercube, the n-dimensional mesh, and the k-ary n-cube torus by identifying subdigraph characteristics that ensure acyclic routing. Further generalization which allows partial cyclic dependencies without deadlock is achieved by our extended generic methodology. We also illustrate how to identify shortest fixed path and nonminimal adaptive routing schemes using minimum required channels.
5450203
Guest Editors' Introduction: Challenges in Designing Fault-Tolerant Routing in Networks
+I INRE arc several means nf intercomiecting the compoT nents of a computer system. Components can be connccted through direct or indirect connections. In a direct network, channels directly connect each processor. Neighboring nodes communicate with each other by scnding messages across the channcls. In an indirect network, processors are cnnnccted through switches and/or buses. Depending on how components are connected, we have bus-based networks, router-based networks, switcli-bascd networks, and cluster-based (hybrid of the other thrce networks) nctworks. Nctworks can also be classified bascd on topologies, which cau be either replnr or irregulnr. Anothcr classification is based on applications-there are local arca networks (LANs), networks of workstations (NOWs), multiprocessors, and mobilc networks. In a computer network, the efficiency of a routing process is critical to the system performance. A routing process deals with moving data between processors in a given network. When a routing process involves oiic source and onc destination, it is called unicnst or poirit-lopoint communication. When such a proccss involves more than one source and/or one destination, it is called a collective comrnlrnicntion process. Examples of collective communication include iirulticnst (one-to-many, one source and many destinations), brundcnst (one-to-all), and gossip (all-to-all).
26743853
Design and Analysis of a Class of Highly Scalable Hierarchical Networks: PdBCube
Abstract A class of hierarchical networks called the dBCube, that provides cost-effective and high-performance communication in large multicomputer systems, has recently been introduced. Such a compound graph of a hypercube and a de Bruijn (dB) graph utilizes every node of the hypercube as a gateway for intercluster communication. This paper presents a partially connected dBCube subclass (PdBCube), wherein the use of fewer nodes as gateways makes the PdBCube highly scalable in terms of both the hypercube and the dB size. This enhancement in scalability can be achieved by two different approaches to assigning gateways. Performance degradation of the proposed PdBCube is illustrated in terms of diameter and average distance. Improvement in track efficiency and reduction in cost are observed to be directly related to a decrease in the number of remote links.