Ee-Chien Chang and Chee Yap. Competitive online scheduling with level of service. In Proc. 7th Annual International Computing and Combinatorics Conference, volume 2108 of Lecture Notes in Computer Science, pages 453{ 462. Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Preemptive Scheduling in Overloaded Systems (Extended .. - Chrobak, Epstein.. (2002) (Correct)
....d j = r j p j . For this case, Koo et al. 5] give a 1 competitive algorithm with speed up 14, and Lam et al. 7] show that in order to achieve 1 competitiveness the speed up must be at least 1:618. The metered model. This version was introduced (in a di erent terminology) by Chang and Yap [3] in the context of thinwire visualization. In their application, a user viewing a low resolution image moves the cursor across the screen, generating requests for higher resolution data at the cursor 1 positions. Due to limited bandwidth not all requests can be fully satis ed. However, even ....
....Thus the pro t represents overall quality of service. Chang and Yap proved that two online algorithms called FirstFit and EndFit have competitive ratio 2. They also proved that no online algorithm can achieve a competitive ratio better than 2(2 p 2) 1:17. In addition to the application in [3], metered preemptive tasks provide a natural model for various decision making processes where an entity with limited resources needs to choose between engaging in several pro table activities. Our results. We rst focus on the metered pro t model. In Section 3, we consider o ine algorithms. We ....
[Article contains additional citation context not shown here]
Ee-Chien Chang and Chee Yap. Competitive online scheduling with level of service. In Proc. 7th Annual International Computing and Combinatorics Conference, volume 2108 of Lecture Notes in Computer Science, pages 453-462. Springer, 2001.
A Responsive Architecture for Thinwire Visualization - Been, Yap (2002) Self-citation (Yap) (Correct)
No context found.
Ee-Chien Chang and Chee Yap. Competitive online scheduling with level of service. Journal of Scheduling, October 2000.
Responsive, Scalable Thinwire Visualization: Application to.. - Yap, Been, Du Self-citation (Yap) (Correct)
No context found.
E.-C. Chang and C. Yap, "Competitive online scheduling with level of service," J. of Scheduling , Oct. 2000. To appear, Proc. 7th Ann. Intl. Computing and Combinatorics Conf. (COCOON), August 20-23, 2001, Guilin, China. To appear, Special Issue of J. of Scheduling on Online Algorithms.
Preemptive Scheduling in Overloaded Systems - Chrobak, Epstein, Noga, Sgall, .. (2003) (9 citations) (Correct)
No context found.
Ee-Chien Chang and Chee Yap. Competitive online scheduling with level of service. In Proc. 7th Annual International Computing and Combinatorics Conference, volume 2108 of Lecture Notes in Computer Science, pages 453{ 462. Springer, 2001.
Preemptive Scheduling in Overloaded Systems - Chrobak, Epstein, Noga, Sgall, .. (2002) (9 citations) (Correct)
No context found.
Ee-Chien Chang and Chee Yap. Competitive online scheduling with level of service. In Proc. 7th Annual International Computing and Combinatorics Conference, volume 2108 of Lecture Notes in Computer Science, pages 453{ 462. Springer, 2001.
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