A. Fiat, Y. Mansour, A. Rosen, and O. Waarts. Competitive Access Time via Dynamic Storage Rearrangement. In Proc. 36th Ann. Symp. on Foundations of Computer Science. pp. 392--403, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... The result implies first deterministic algorithms for k page migration by using k server [MMS88] algorithms, and for network leasing by using generalized Steiner tree algorithms [AAB96] as well as providing solutions for natural generalizations of other problems (e.g. storage rearrangement [FMRW95] We further study some special cases of the k page migration problem and get optimal deterministic algorithms. For the classical page migration problem we present a deterministic algorithm that achieves a competitive ratio of 4:086, improving upon the previously best competitive ratio of 7 ....

....bought, and we need to decide when edge links should be bought. For such problems our results yield algorithms for the 1 rent or buy problem out of algorithms for the corresponding buy only problem. Other examples for applications are the generalizations of the storage rearrangement problem [FMRW95] and distributed job scheduling [AKP92] to the case where a configuration change is D times larger than the distance (note that in both these problems this is a natural parameter) 1.1 Relaxed Task Systems In this section we provide formal definitions of relaxed task systems and description of ....

[Article contains additional citation context not shown here]

A. Fiat, Y. Mansour, A. Rosen, and O. Waarts. Competitive Access Time via Dynamic Storage Rearrangement. In Proc. of the 36th Ann. IEEE Symp. on Foundations of Computer Science, pages 392--403, October 1995.

....algorithmic approach. The technique presented is of particular interest in the context of on line computation. A large number of on line algorithmic problems, including metrical task systems [BLS87] server problems [MMS88] distributed paging [BFR92] and dynamic storage rearrangement [FMRW95], are defined in terms of some metric space. Typically for these problems, there are linear lower bounds on the competitive ratio of deterministic algorithms. Although randomization against an oblivious adversary has the potential of overcoming these high ratios, very little progress has been ....

.... The performance ratio in this case is known as the competitive ratio, proposed by Sleator and Tarjan [ST85] A large number of on line algorithmic problems, including metrical task systems [BLS87] server problems [MMS88] distributed paging [BFR92] and dynamic storage rearrangement [FMRW95], are defined in terms of metric spaces. Such problems address issues concerning with various fields such as resource management, communication networks, and dynamic data structures. While the study of deterministic algorithms for these problems has been quite successful, the competitive ratio 1 ....

[Article contains additional citation context not shown here]

A. Fiat, Y. Mansour, A. Ros'en, and O. Waarts. Competitive Access Time via Dynamic Storage Rearrangement. In Proc. of the 36th Ann. IEEE Symp. on Foundations of Computer Science, pages 392--403, October 1995. 15

....partially inconsistent manner. Modern distributed systems allow not only migrating data along the network, but also the migration of processes. The process allocation problem can be defined as the dynamic re allocation of processes as to minimize the sum of communication costs between them (see [FMRW95] Perhaps the most promising avenue of research is to attempt to implement some or all of the ideas presented here in real systems. Here, there are additional practical considerations and constraints that have to be addressed. It seems that in practice the issues of distributed control over ....

A. Fiat, Y. Mansour, A. Ros'en, and O. Waarts. Competitive Access Time via Dynamic Storage Rearrangement. In Proc. of the 36th Ann. IEEE Symp. on Foundations of Computer Science, pages 392--403, October 1995.

....system. The result implies deterministic algorithms for k page migration by using k server [MMS90] algorithms, and for network leasing by using generalized Steiner tree algorithms [AAB96] as well as providing solutions for natural generalizations of other problems (e.g. storage rearrangement [FMRW95] We further study some special cases of the k page migration problem and get optimal deterministic algorithms. For the classical page migration problem we present a deterministic algorithm that achieves a competitive ratio of 4:086, improving upon the previously best competitive ratio of ....

....or bought, and we need to decide when edge links should be bought. For such problems our results yield algorithms for the rent or buy problem using algorithms for the corresponding buy only problem. Other examples for applications are the generalizations of the storage rearrangement problem [FMRW95] and distributed job scheduling [AKP92] to the case where the cost of a con guration change is D times larger than the distance (note that in both these problems this is a natural parameter) 1.1 Relaxed Task Systems In this section we provide formal de nitions of relaxed task systems and a ....

[Article contains additional citation context not shown here]

A. Fiat, Y. Mansour, A. Rosen, and O. Waarts, Competitive Access Time via Dynamic Storage Rearrangement, in Proc. of the 36th Ann. IEEE Symp. on Foundations of Computer Science, pages 392-403, October 1995.

....spaces are simple in two different ways: 1) they are tree (or additive) metrics. 2) they invite the possibility of a divide and conquer approach for optimization problems. The first property improves upon a previous result of this type [AKPW91] and thus applies to its applications (e.g. [FMRW95]) The technique presented is of particular interest in the context of on line computation. A large number of on line algorithmic problems, including metrical task systems [BLS87] server problems [MMS88] distributed paging [BFR92] and dynamic storage rearrangement [FMRW95] are defined in ....

....applications (e.g. FMRW95] The technique presented is of particular interest in the context of on line computation. A large number of on line algorithmic problems, including metrical task systems [BLS87] server problems [MMS88] distributed paging [BFR92] and dynamic storage rearrangement [FMRW95], are defined in terms of some metric space. While the study of deterministic algorithms for these problems has been quite successful, the competitive ratio is typically linear. Although randomization against oblivious adversaries has the potential of overcoming these high ratios, very little ....

[Article contains additional citation context not shown here]

A. Fiat, Y. Mansour, A. Ros'en, and O. Waarts. Competitive Access Time via Dynamic Storage Rearrangement. In Proc. of the 36th Ann. IEEE Symp. on Foundations of Computer Science, pages 392--403, October 1995.

No context found.

A. Fiat, Y. Mansour, A. Rosen, and O. Waarts. Competitive Access Time via Dynamic Storage Rearrangement. In Proc. 36th Ann. Symp. on Foundations of Computer Science. pp. 392--403, 1995.

No context found.

A. Fiat, Y. Mansour, A. Rosen, and O. Waarts. Competitive Access Time via Dynamic Storage Rearrangement. In Proc. 36th Ann. Symp. on Foundations of Computer Science. pp. 392--403, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC