๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A broadcasting algorithm in star graph interconnection networks

โœ Scribed by Jang-Ping Sheu; Wen-Hwa Liaw; Tzung-Shi Chen

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
464 KB
Volume
48
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Migration of Tasks in Interconnection Ne
Migration of Tasks in Interconnection Networks Based on the Star Graph
โœ S. Latifi ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 603 KB

The hierarchy of the star graph allows the assignment of its special subgraphs (substars), which have the same topological features as the original graph, to a sequence of incoming tasks. The procedure for task allocation in the star graph can be done using the star code and the allocation tree cons

Broadcast scheduling in wireless multiho
Broadcast scheduling in wireless multihop networks using a neural-network-based hybrid algorithm
โœ Haixiang Shi; Lipo Wang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 173 KB

In wireless multihop networks, the objective of the broadcast scheduling problem is to find a conflict free transmission schedule for each node at different time slots in a fixed length time cycle, called TDMA cycle. The optimization criterion is to find an optimal TDMA schedule with minimal TDMA cy

A Genetic Algorithm for Finding the Page
A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks
โœ Nidhi Kapoor; Mark Russell; Ivan Stojmenovic; Albert Y. Zomaya ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 151 KB

A ''book-embedding'' of a graph G comprises embedding the graph's nodes along the spine of a book and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The ''pagenumber'' of a graph is the thickness of the small