The performance of this policy, in terms of parameters such as the time complexity, average delay, and system utilization, is compared with those of the other schemes, demonstrating its effectiveness.ĪB - A processor allocation policy for hypercube computers is presented.
#Hypercube scheme free#
It is shown that the free list policy is statically optimal, as are the other policies, but it gives better subcube recognition ability compared to the previous schemes in a dynamic environment. This new policy is compared with the buddy, the gray code, and the modified buddy allocation policies reported for the hypercubes. The free list policy is different from other hypercube allocation schemes in that it uses a top-down allocation rule in contrast to the bottom-up approach used by all other allocations. An incoming request of dimension k (2k nodes) is allocated by finding a free subcube of dimension k. The allocation policy is called free list since it maintains a list of free subcubes available in the system. N2 - A processor allocation policy for hypercube computers is presented. T1 - Processor allocation scheme for hypercube computers The performance of this policy, in terms of parameters such as the time complexity, average delay, and system utilization, is compared with those of the other schemes, demonstrating its effectiveness.", The analysis indicates that two-dimensional arrays of 512 × 512 nodes interconnected in a hypercube (18-cube) topology could be implemented.Abstract = "A processor allocation policy for hypercube computers is presented. A theoretical analysis of the physical limitations of the implementation method is also presented. We present a space-invariant optical implementation technique for the realization of such networks.
Owing to their totally space-invariant nature, the resulting three-dimensional hypercube networks are highly amenable to optical implementations by use of simple optical hardware such as multiple-imaging components and space-invariant holographic techniques. An example network is provided that illustrates the proposed design method. It is shown that the proposed methodology greatly improves area utilization as compared with previous methods. The methodology permits the construction of larger hypercube networks from smaller networks in a systematic and incremental fashion. Note: Author names will be searched in the keywords field, also, but that may find papers where the person is mentioned, rather than papers they authored.Ī new design methodology for constructing optical space-invariant hypercube interconnection networks for connection of a two-dimensional array of inputs to a two-dimensional array of outputs is presented.Use a comma to separate multiple people: J Smith, RL Jones, Macarthur.Use these formats for best results: Smith or J Smith.For best results, use the separate Authors field to search for author names.Use quotation marks " " around specific phrases where you want the entire phrase only.Question mark (?) - Example: "gr?y" retrieves documents containing "grey" or "gray".Asterisk ( * ) - Example: "elect*" retrieves documents containing "electron," "electronic," and "electricity".Improve efficiency in your search by using wildcards.Example: (photons AND downconversion) - pump.Example: (diode OR solid-state) AND laser.
Note the Boolean sign must be in upper-case.
0 kommentar(er)
