Hettihe P. Dharmasena

Learn More
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2-leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on multiple bus networks (MBNs) in which processors communicate via buses. Every “binary-tree MBN” has a degree (maximum number of buses connected to a processor) of at least 2. There(More)
The objective of this research was to determine whether consultant physicians would consider referring patients with non-malignant disease to a specialist palliative care service, and if so, which patients they would refer. In addition, reasons for referral, expectations of the palliative care team and concerns about the extension of palliative care to(More)
Double-loop networks are widely used in computer networks. In this paper, we present an optimal message routing algorithm and an optimal fault-tolerant message routing algorithm for weighted bidirectional double-loop networks. The algorithms presented are novel, and they do not use routing tables. After a precalculation of O(log N) steps to determine(More)
A Multiple Bus Network (MBN) connects a set of processors via a set of buses. Two important parameters of an MBN are its loading (largest number of connections on a bus) and its degree (largest number of connections to a processor). These parameters determine the cost, speed, and implementability of the MBN. The smallest degree that any useful MBN can have(More)
  • 1