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

Mean flow scheduling and optimal construction of a treelike communication network

โœ Scribed by Yehoshua Perl; Yaacov Yesha

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
322 KB
Volume
11
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

Horn's algorithm for weighted mean flow scheduling with treelike precedence constraints is reexamined. A new analysis of an efficient implementation of Horn's algorithm shows an O(n log n) complexity. This is an improvement on the known O(n^2^) complexity of this algorithm. An application of Horn's algorithm to a problem of optimal scheduling of a treelike communication network is presented.

๐Ÿ“œ SIMILAR VOLUMES

A study of construction of regional PC c
A study of construction of regional PC communication network systems
โœ Kazunari Irie; Yoshiyuki Monma; Gen-ichi Nishio; Norihisa Ohta; Hisao Tsuji ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 397 KB ๐Ÿ‘ 1 views

We have researched a cost-effective regional personal computer (PC) communication network system and its realization. The system supports group communication services that offer communication among the registered members. We have already developed a low-end card that provides an Ethernet interface i

A discussion and test of a communication
A discussion and test of a communication flow optimization approach for business process redesign
โœ Ned Kock; Azim Danesh; Paul Komiak ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 320 KB

## Abstract A vital component of any business process redesign (BPR) project is the depiction and understanding of an organization's processes that are being targeted for redesign. The literature on BPR suggests that the vast majority of past BPR projects have placed emphasis on the use of business