Today's central processing unit (CPU) technology makes it possible for a processor to adjust its voltage and clock frequency dynamically depending on its current CPU load, memory load, or operating system requests...
详细信息
ISBN:
(纸本)9781728138855
Today's central processing unit (CPU) technology makes it possible for a processor to adjust its voltage and clock frequency dynamically depending on its current CPU load, memory load, or operating system requests. Higher energy saving is possible if the application's power profile can be estimated or determined fast and accurate. If the application's power profile is completely known prior to execution, then maximum/optimum power saving is possible using off-line dynamic voltage and frequency scaling (DVFS) algorithms. The question is, how to determine full power-profile of an application prior to execution and how much power saving is possible. In this paper, we discuss the methodology to determine full power profile of an application and calculate potential energy savings using off-line DVFS algorithms for randomly generated and real-life cases.
A sequence of online messages for connections is given, each message is important and thide failure of delivering a message is a critical event. The maximum lifetime problem maximizes the total number of messages that...
详细信息
A sequence of online messages for connections is given, each message is important and thide failure of delivering a message is a critical event. The maximum lifetime problem maximizes the total number of messages that can be successfully sent over the network. Given a , this paper presents two new problems on ad hoc networks (called the min-max and min-sum cost online problems), which adjust the initial energies of nodes such that the network can send the first messages. We consider the min-sum and min-max norms for minimizing the cost of adjusting the initial energies. This paper presents an algorithm for these problems and computes upper bounds for the total cost of the min-sum and min-max norms. Mohanoor et al. (Ad hoc Networks 7: 918-931, 2009) presented three algorithms (called SWRP, SFWP and SWCRP algorithms) to online energy aware routing, which, in practice, are better than other algorithms on lifetime in the cases: the effect of session length, transmission radius and node density. This paper modifies these algorithms (the modifies algorithms are called TSWRP, TSFWP and TSWCRP) so that they compute the total cost of the min-sum and min-max norms. Then, we show, in practice, the total cost of the min-sum and min-max norms computed by our algorithm are smaller than the values computed by the TSWRP, TSFWP and TSWCRP algorithms in the cases: the transmission radius and node density. Also, in practice, the lifetime of our algorithm is more than the lifetime of the SWRP, SFWP and SWCRP algorithms in the cases: the effect of session length and node density.
We address the problem of designing efficient solutions for media-on-demand in systems that use stream merging. In a stream merging system, the receiving bandwidth of clients is larger than the playback bandwidth and ...
详细信息
ISBN:
(纸本)9781581136616
We address the problem of designing efficient solutions for media-on-demand in systems that use stream merging. In a stream merging system, the receiving bandwidth of clients is larger than the playback bandwidth and clients can buffer parts of the transmission to be played back later. Intelligent use of these resources allows bandwidth usage to be reduced exponentially over traditional unicast delivery of popular media. We design an off-line algorithm that, in O(n) time, computes an optimal off-line stream merging solution for the case when the time horizon n is known ahead of time. In addition, we describe an on-line delay guaranteed solution that operates without knowledge of the time horizon size, and show that it performs asymptotically close to the optimal off-line algorithm. The on-line algorithm is simpler to implement than previously proposed on-line stream merging algorithms, and empirically performs well when the intensity of client arrivals is high.
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutation on an n-node tree (and thus graph)...
详细信息
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutation on an n-node tree (and thus graph) can be routed in 3/2n + O(log n) steps. This answers an open problem of Alon, Chung, and Graham [SIAM J. Discrete Math., 7 (1994), pp. 516-530].
Optimum off-line algorithms for the list update problem are investigated, The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given...
详细信息
Optimum off-line algorithms for the list update problem are investigated, The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given;these lead to optimum algorithm which runs in time Theta 2(n)(n - 1)!m, where n is the length of the list and m is the number of requests. The previous best algorithm, an adaptation of a more general algorithm due to Manasse et al. (1988), runs in time Theta(n!)(2)m.
暂无评论