Search results for "Fair-share scheduling"

showing 4 items of 14 documents

Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling

2009

Hierarchical scheduling has recently been used to provide temporal isolation to embedded virtualised systems. Response time analysis is a common way to derive a schedulability test for these systems. This paper points out that response time analysis for hierarchical fixed-priority scheduling found in the literature is only exact for tasks of the highest priority domain. For the rest of the tasks is an upper bound. In our work, we provide the exact analysis and we compare it with previously published works.

Rate-monotonic schedulingTheoretical computer scienceComputer scienceServerResponse timeDynamic priority schedulingParallel computingTemporal isolationUpper and lower boundsFair-share schedulingScheduling (computing)2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
researchProduct

HEURISTIC PROCEDURES FOR GROUP SCHEDULING

1989

ABSTRACT The group scheduling problem is investigated, solving numerous small and large sized examples with eight sequencing algorithms. A new approach, basically consisting in the definition of real machines' idles for each group, utilizing allowed shifting of non critical activities, is proposed. Moreover the CDS multi-shot algorithm is extended to group scheduling.

Rate-monotonic schedulingTheoretical computer scienceHeuristic (computer science)Computer scienceGroup (mathematics)Two-level schedulingDynamic priority schedulingFlow shop schedulingFair-share schedulingGroup scheduling
researchProduct

Simulation-Based Performance Study of e-Commerce Web Server System – Results for FIFO Scheduling

2013

The chapter concerns the issue of overloaded Web server performance evaluation using a simulation-based approach. We focus on a Business-to-Consumer (B2C) environment and consider server performance both from the perspective of computer system efficiency and e-business profitability. Results of simulation experiments for the Web server system under First-In-First-Out (FIFO) scheduling are discussed. Much attention has been paid to the analysis of the impact of a limited server system capacity on business-related performance metrics.

Web serverComputer sciencebusiness.industryE-commercecomputer.software_genreFair-share schedulingScheduling (computing)Operating systemProfitability indexbusinessServer systemWeb server performancecomputerSimulation based
researchProduct

Computer aided scheduling and routing of vehicle-carrier fleet—a case study

2016

This paper presents a case study of development of an information system for a large enterprise from vehicle-transport industry. A novel optimization model and algorithms developed to solve scheduling and routing of vehicle-carrier fleet are presented and discussed. Carried out qualitative experiments confirmed the usability of developed user-guided search paradigm and high performance of autonomous algorithmic solution search methods.

time windowsalgorithmComputer sciencebusiness.industryDistributed computingPolicy-based routingUsabilityFair-share schedulingScheduling (computing)Link-state routing protocolTwo-level schedulingVehicle routing problemvehicle routing problemRouting (electronic design automation)business
researchProduct