Adaptive resource scheduling for network services

Byoung Dai Lee, Jon B. Weissman

Research output: Contribution to journalArticle

Abstract

Recently, there has been considerable interest in providing high performance codes as network services. In particular, high performance network services provide improved performance by executing complex and time-consuming applications (or part of an application) on remote high performance resources. However, since service providers resources are limited, without effective resource scheduling, end-users will not experience performance improvement. In this paper, we propose adaptive resource harvesting algorithms to schedule multiple concurrent service requests within network services. The preliminary results show that our approach can achieve service time improvement up to 40% for a prototypical parallel service.

Original languageEnglish (US)
Pages (from-to)207-218
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2536
DOIs
StatePublished - Jan 1 2002

Fingerprint Dive into the research topics of 'Adaptive resource scheduling for network services'. Together they form a unique fingerprint.

  • Cite this