This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dec. 1985 (vol. 34 no. 12)
pp. 1185-1190
Miron Livny, Department of Computer Science, University of Wisconsin, Madison, WI 53706
Udi Manber, Department of Computer Science, University of Wisconsin, Madison, WI 53706
We propose in this paper an extension to the token ring protocol that allows a special type of arithmetic, called shift arithmetic, to be performed directly on the nodes interfaces. The new protocol is based on the approach that the communication channel together with the interfaces can form an environment in which simple commands can be executed. Each command operates on operands located at the interfaces, and places the result at the interface that initiated the command. The commands utilize the mandatory 1 bit delay of the token ring protocol to implement arithmetic and logical operations on the operands without further delay. The goal of this protocol is to enhance the performance of distributed algorithms on ring networks by performing many simple tasks in the lowest possible level. We show that this protocol is especially useful for load sharing in local area networks since information such as minimal, average, and maximal loads can be easily found. Other potential application areas include parallel algorithms, distributed simulation, distributed operating systems, distributed databases, and real-time computations.
Index Terms:
token ring network,Distributed algorithms,distributed computing,load balancing,local area networks,network protocols,shift arithmetic
Citation:
Miron Livny, Udi Manber, "Distributed computation via active messages," IEEE Transactions on Computers, vol. 34, no. 12, pp. 1185-1190, Dec. 1985, doi:10.1109/TC.1985.6312217
Usage of this product signifies your acceptance of the Terms of Use.