Dynamic processor scheduling with client resources for fast multi-resolution WWW image browsing

In an image browsing environment there is need for progressively viewing image subregions at various resolutions. We describe a storage scheme that accomplishes good image compression, while supporting fast image subregion retrieval. We evaluate analytically and experimentally the compression performance of our algorithm. We also provide results on the speed of the algorithm to demonstrate its e ectiveness, and present an extension to a client=server environment.

show abstract

“…Eq. (3) does not seem promising for simpliÿcation or appropriate for computation, and nor does (2). Passing to expected values,…”

Section: Probability Distribution Of a Lmentioning

confidence: 98%

Image compression for fast wavelet-based subregion retrieval

Poulakidas

Srinivasan

Eğecioǧlu

et al. 2000

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The model of computation and communication described in [6,21] uses the chain of tasks depicted in Fig. 5: (1) Fetching compressed wavelet data and extracting the subregion.…”

Section: Multiresolution Image Browsingmentioning

confidence: 99%

Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance

Andresen

Yang

Ibarra

et al. 1998

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…Similarly we can show that with a very slow Internet connection, D3 is the optimum choice while D2 is the best choice if B is reasonably large. 5 Experimental Results…”

Section: Wecanshow That Expectedmentioning

confidence: 99%

“…Thus dynamic scheduling strategies must be adaptive to variations of client/server resources in multiple aspects and we conducted a case study for the WWW-based image browsing application is in [5].…”

Section: Introductionmentioning

confidence: 99%

Multiprocessor scheduling with client resources to improve the response time of WWW applications

Andresen

Yang

1997

Proceedings of the 11th International Conference on Supercomputing - ICS '97

View full text Add to dashboard Cite

WWW-based information service has grown enormously during the last few years, and major performance bottlenecks have been caused by WWW server and Internet bandwidth inadequacies. Augmenting a server with multiprocessor support and shifting computation to client-site machines can substantially improve system response times and for some applications, it may also reduce network bandwidth requirements. In this paper, we propose adaptive scheduling techniques that optimize the use of a multiprocessor server with client resources by predicting demands of requests on I/O, CPU and network capabilities.We also provide a performance analysis under simplified assumptions for understanding the impact of system loads and network bandwidth when using our scheduling strategy. Finally we report preliminary experimental results to examine the system performance and verify the usefulness of the analytic model.

show abstract

Dynamic processor scheduling with client resources for fast multi-resolution WWW image browsing

Cited by 8 publications

References 11 publications

Image compression for fast wavelet-based subregion retrieval

Image compression for fast wavelet-based subregion retrieval

Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance

Multiprocessor scheduling with client resources to improve the response time of WWW applications

Contact Info

Product

Resources

About