A maximum entropy priority approximation for a stable G/G/1 Queue
Acta Informatica
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
IEEE Transactions on Parallel and Distributed Systems
A fault-tolerant broadcasting algorithm for hypercubes
Information Processing Letters
Broadcasting in hypercubes and star graphs with dynamic faults
Information Processing Letters
Embedding of binomial trees in hypercubes with link faults
Journal of Parallel and Distributed Computing
Optimal broadcasting in hypercubes with dynamic faults
Information Processing Letters
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Broadcasting schemes for hypercubes with background traffic
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
| Hi-index | 0.00 |
A novel one-to-all broadcasting scheme is proposedfor hypercube interconnection networks with bursty backgroundtraffic having head-of-line priorities, completebuffer sharing and repetitive service blocking with randomdestination. The scheme facilitates inter-process communicationamongst hypercube computers and it is applicable toa single-port mode of message passing communication. Thescheme utilizes a queue-by-queue decomposition algorithmfor arbitrary open queueing network models, based on theprinciple of maximum entropy, in conjunction with binomialtrees and graph theoretic concepts. Evidence basedon empirical studies indicates the suitability of the schemefor achieving an optimal one-to-all broadcasting cost.