Andere Kunden interessierten sich auch für
![Forwarding Strategies and Optimal Power Allocation for Relay Networks]( "Forwarding Strategies and Optimal Power Allocation for Relay Networks")
Forwarding Strategies and Optimal Power Allocation for Relay Networks32,99 €![Efficient broadcasting for multi-radio mesh networks]( "Efficient broadcasting for multi-radio mesh networks")
Efficient broadcasting for multi-radio mesh networks52,99 €![Data Allocation Strategies in Distributed Database Systems]( "Data Allocation Strategies in Distributed Database Systems")
Data Allocation Strategies in Distributed Database Systems58,99 €![Cross-Layer Routing and Mobility Management In Wireless Mesh Networks]( "Cross-Layer Routing and Mobility Management In Wireless Mesh Networks")
Cross-Layer Routing and Mobility Management In Wireless Mesh Networks38,99 €![Routing and Scheduling in Wireless Mesh Networks]( "Routing and Scheduling in Wireless Mesh Networks")
Routing and Scheduling in Wireless Mesh Networks32,99 €![Dynamic Extent-Based Allocation Technique for Multimedia File Systems]( "Dynamic Extent-Based Allocation Technique for Multimedia File Systems")
Dynamic Extent-Based Allocation Technique for Multimedia File Systems51,99 €![Performance of Wireless Mesh Networks]( "Performance of Wireless Mesh Networks")
Performance of Wireless Mesh Networks38,99 €
We have identified the limitations of the existing
work in the area of processor allocation in mesh-
connected multicomputers. These limitations form the
motives behind undertaking such a research. We can
summarise the main contributions of this research
into three main points. The first part of this
research presents an efficient contiguous processor
allocation algorithm, referred to as Turning Busy
List (or TBL for short), for 3D mesh-connected
multicomputers that overcome the limitations of the
existing strategies suggested previously for the 3D
mesh networks. The second part of this research
proposes a new non-contiguous processor allocation
algorithm, referred to as Greedy Available Busy List
(or GABL for short), for the 2D mesh-connected
multicomputer. And finally, we study the impact of
heavy-tailed job execution times on the performance
of the existing contiguous allocation strategies for
3D mesh-connected multicomputers, including the ones
proposed in this research.
work in the area of processor allocation in mesh-
connected multicomputers. These limitations form the
motives behind undertaking such a research. We can
summarise the main contributions of this research
into three main points. The first part of this
research presents an efficient contiguous processor
allocation algorithm, referred to as Turning Busy
List (or TBL for short), for 3D mesh-connected
multicomputers that overcome the limitations of the
existing strategies suggested previously for the 3D
mesh networks. The second part of this research
proposes a new non-contiguous processor allocation
algorithm, referred to as Greedy Available Busy List
(or GABL for short), for the 2D mesh-connected
multicomputer. And finally, we study the impact of
heavy-tailed job execution times on the performance
of the existing contiguous allocation strategies for
3D mesh-connected multicomputers, including the ones
proposed in this research.