A. Despain and D. Patterson. X-tree: A tree structured multi-processor computer architecture, 1978.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....technology. In [19] the impact of pipelining the channels in ary cube is studied. SOENets are tree like networks. Many variations on hierarchical, tree topologies have been proposed over the years. Clos networks [6] and Benes networks [5] are nonblocking hierarchical networks. An X tree [11] is a tree architecture with all nodes at a given level of the tree connected by a set of channels. A fat tree [15] is a tree network where the width or number of channels at each level of the tree is increased to reduce congestion near the root of the tree. A fat tree without dilation at each ....

A. Despain and D. Patterson. X-tree: A tree structured multi-processor computer architecture, 1978.

....34, 12, 35] Likewise the idea of intelligent disk has also been covered by di erent research groups. The workloads considered for this technology consist of Decision Support Systems [13, 14, 15, 17] data mining and multimedia applications [16] Related to our research, the X Tree architecture [36, 37], looks at a multiprocessor organization, where processors are connected using a binary tree. This topology facilitates the design of high bandwidth systems as the average distance between the nodes increases logarithmically with the number of nodes in the system. However, the emphasis in the ....

A. M. Despain and D. A. Patterson, \X-TREE: A tree structured multi-processor computer architecture, " in Proceedings of the 5th Annual International Symposium on Computer Architecure, (Palo Alto, CA, USA), pp. 144-151, Apr. 3-5 1978.

....compressed tree machines can be embedded into an optimal size hypercube with dilation at most 2. 1 Introduction Parallel machines interconnecting up to thousands of processors have been proposed and recently built. One of the earliest and the most prominent one is a complete binary tree machine [4, 7, 9]. Many algorithms Research supported in part by a Fellowship from the Faculty Research and Creative Activities Support Funds WMU FRCASF 90 15, WMU 89 225274, and by the National Science Foundation under grant USE 90 52346. can be naturally programmed on complete binary tree machines (e.g. ....

A. M. Despain and D. A. Patterson. X-tree: A tree structured multi-processor computer architecture. In the Proc. of the 5 th Annual Symposium on Computer Architecture, pages 144--151, 1978.

....enters the picture. If such programs are to be run in an efficient manner on large scale multiprocessors, then efficient run time thread placement and scheduling techniques are needed. This thesis examines the problems faced by an on line thread management system and presents XTM, an X Tree based [25, 6] Thread Management system that attempts to overcome these problems. The general thread management problem is NP hard [7] The standard problem has the following characteristics: precedence relations are considered, the communications network is flat and infinitely fast, tasks take differing ....

....Guided by the design principles given above, we have developed XTM, a thread management system that is sound from both a theoretical and a practical perspective. XTM solves the sub problems identified above as follows: 1. Global information is collected and disseminated using an X Tree [25, 6] data structure embedded in the communications network (see Figures 4 1 and 4 2) Each node in the tree contains a presence bit whose value indicates whether there are any runnable threads in the sub tree headed by that node. We show that on a machine with a sufficiently high, balanced workload, ....

[Article contains additional citation context not shown here]

Alvin M. Despain and David A. Patterson. X-TREE: A Tree Structured MultiProcessor Computer Architecture. In Proceedings of the Fifth International Symposium on Computer Architecture, 1978.

....can think of messages as being divided up into packets of standard size and henceforth treat message as synonymous with packet . Uhr) 25, p. 3] The addition of mesh connections to the fat tree is also similar to the introduction of brother connections in trees to obtain the X Tree network [8, 23]. The term fat pyramid should not be confused with a recent independent use of the term by other authors. It is also convenient to assume that operation of competing networks is divided into separate (alternating) phases of intraprocessor computation and interprocessor communication. Thus, ....

A. M. Despain and D. A. Patterson. X-Tree: A tree structured multi-processor computer architecture. In Proceedings of the 5th Annual International Symposium on Computer Architecture, pages 144--151. ACM/IEEE, 1978.

....containing pre , post and in has a historical background in ordered binary trees. In fact, there is a connection between ordered natural cycletrees and threaded binary trees [24] Some types of threaded trees, to be used as interconnection graphs, have been studied by Despain and Patterson [11] and are illustrated in Figure 16. 6 Natural cycletrees as interconnection graphs We have so far studied some basic properties of natural cycletrees. Let us now turn to the more practical issue of using natural cycletrees as in18 terconnection graphs in the MP RAM model, see for example Almasi ....

....given in Example 6.2, the algorithm produces the natural cycletree as shown in Figure 11. The dashed lines correspond to the edge set E in the algorithm. 7 Embedding of binary tree based networks Embedding of circular and linear arrays, binary trees and binary tree based networks, like X trees [11], leap trees [20] back to back trees [13] de Bruijn networks [42] and completely linked trees, in other networks such as hypercubes [20, 35, 37, 48, 49] meshes [28, 43, 54] rings [23] pyramids [12] butterflies [40] and VLSI arrays [18, 22, 41, 53] have been studied extensively. Several of ....

[Article contains additional citation context not shown here]

Despain, A. M. and Patterson, D. A., X-tree: A Tree Structured Multiprocessor Computer, SIGARCH Newsletters, 6(7):144--151 (1978).

....were equal to one, the result would be a network which has been called the pyramid by Tanimoto (and earlier a recognition cone by Uhr) 15, p. 3] The addition of mesh connections to the fat tree is also similar to the introduction of brother connections in trees to obtain the X Tree network [5, 14]. f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f Figure 1: A fat pyramid. This network is obtained by superposing hierarchical mesh connections on a butterfly fat tree. The original fat tree connections are ....

Alvin M. Despain and David A. Patterson. X-Tree: A tree structured multi-processor computer architecture. In Proceedings of the 5th Annual Symposium on Computer Architecture, pages 144--151. ACM/IEEE, 1978.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC