Time-utility function

Known as: TUF, Time utility function, Time-value function 
Time-utility functions (TUFs, also called time-value functions) are needed for real-time computing when a deadline occurs. They were introduced by E… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Cloud computing' service-oriented characteristics advance a new way of service provisioning called utility based computing… (More)
  • figure 3
Is this relevant?
2010
2010
We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called global Multiprocessor… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
2007
2007
In this paper, we consider timeliness and energy optimization in battery-powered dynamic embedded real-time systems, which must… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2006
2006
We propose a secure routing architecture for mobile ad hoc networks (MANETs) called throughput-feedback (TUF) routing, which is… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
We present a utility accrual real-time scheduling algorithm called CIC-VCUA for tasks whose execution times are functions of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2005
Review
2005
We argue that the key underpinning of the current state-of-the real-time practice - the priority artifact - and that of the… (More)
  • figure 2
Is this relevant?
2005
2005
  • IEEE Transactions on Computers
  • 2005
We consider Real-Time CORBA 1.2's distributable threads (DTs), whose time constraints are specified using time/utility functions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
We consider Real­Time CORBA 2.0 (Dynamic Scheduling) distributable threads, whose time constraints are specified using time… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a MAC-layer, soft real-time packet scheduling algorithm called UPA. UPA considers a message model where message… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Finding an appropriate end-to-end congestion control scheme for each type of flow, such as real-time or multicast flows, may be… (More)
  • figure 1
  • figure 5
  • figure 3
  • figure 6
  • figure 7
Is this relevant?