English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Shortest Remaining Processing Time (SRPT) is a well known preemptivescheduling algorithm for uniprocessor and multiprocessor systems. SRPT findsapplications in the emerging areas such as scheduling of client's requests thatare submitted to a web server for accessing static web pages, managing theaccess requests to files in multiuser database systems and routing of packetsacross several links as per bandwidth availability in data communications. SRPThas been proved to be optimal for the settings, where the objective is tominimize the mean response time of a list of jobs. According to our knowledge,there is less attention on the study of online SRPT with respect to theminimization of makespan as a performance criterion. In this paper, we studythe SRPT algorithm for online scheduling in multiprocessor systems withmakespan minimization as an objective. We obtain improved constantcompetitiveness results for algorithm SRPT for special classes of online jobsequences based on practical real life applications.

Results on Competitiveness of Online Shortest Remaining Processing Time(SRPT) Scheduling with Special Classes of Inputs