loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'04)
Vienna, Austria
May 12-May 14
ISBN: 0-7695-2124-X
Karthik Channakeshava, Virginia Tech
Binoy Ravindran, Virginia Tech
We consider Real-Time CORBA 2.0 (Dynamic Scheduling) distributable threads operating in multihop networks. When distributable threads are subject to time/utility function-time constraints and utility accrual optimality criteria, utility accrual real-time channels must be established. Such channels transport inter-node messages of distributable threads in a way that maximizes system-wide, message-level accrued utility. We present a utility accrual channel establishment algorithm called Local Decision for Utility accrual Channel Establishment (or Loc-DUCE) that heuristically computes channels. Our experimental measurements using a prototype implementation reveal that LocDUCE accrues significantly higher utility than the Open Shortest Path First routing algorithm.
Citation:
Karthik Channakeshava, Binoy Ravindran, "On Utility Accrual Real-Time Channel Establishment in Multi-Hop Networks," isorc, pp.277-284, Seventh IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.