FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2772039599> ?p ?o ?g. }

• W2772039599 endingPage "33" @default.
• W2772039599 startingPage "1" @default.
• W2772039599 abstract "We introduce and study a general scheduling problem that we term the Polytope Scheduling problem (PSP). In this problem, jobs can have different arrival times and sizes, and the rates assigned by the scheduler to the jobs are subject to arbitrary packing constraints. The PSP framework captures a variety of scheduling problems, including the classical problems of unrelated machines scheduling, broadcast scheduling, and scheduling jobs of different parallelizability. It also captures scheduling constraints arising in diverse modern environments ranging from individual computer architectures to data centers. More concretely, PSP models multidimensional resource requirements and parallelizability, as well as network bandwidth requirements found in data center scheduling. We show a surprising result—there is a single algorithm that is O (1) competitive for all PSP instances when the objective is total completion time, and O (1) competitive for a large sub-class of PSP instances when the objective is total flow time. This algorithm simply uses the well-known Proportional Fairness (PF) algorithm to perform allocations each time instant. Though P F has been extensively studied in the context of maximizing fairness in resource allocation, we present the first analysis in adversarial and general settings for optimizing job latency. Further, P F is non-clairvoyant, meaning that the algorithm doesn’t need to know jobs sizes until their completion. We establish our positive results by making novel connections with Economics, in particular, the notions of market clearing, Gross Substitutes, and Eisenberg-Gale markets. We complement these positive results with a negative result: We show that for the total flow time objective, any non-clairvoyant algorithm for general PSP has a strong lower bound on the competitive ratio unless given a poly-logarithmic speed augmentation. This motivates the need to consider sub-classes of PSP when studying flow time. The sub-class for which we obtain positive results not only captures several well-studied models, such as scheduling with speedup curves and related machine scheduling, but also captures as special cases hitherto unstudied scheduling problems, such as single source flow routing, routing multicast (video-on-demand) trees, and resource allocation with substitute resources." @default.
• W2772039599 created "2017-12-22" @default.
• W2772039599 creator A5006392819 @default.
• W2772039599 creator A5043137436 @default.
• W2772039599 creator A5047351951 @default.
• W2772039599 date "2017-12-11" @default.
• W2772039599 modified "2023-09-24" @default.
• W2772039599 title "Competitive Algorithms from Competitive Equilibria" @default.
• W2772039599 cites W1498726528 @default.
• W2772039599 cites W1528157682 @default.
• W2772039599 cites W1563776668 @default.
• W2772039599 cites W165387623 @default.
• W2772039599 cites W1804511434 @default.
• W2772039599 cites W1806207712 @default.
• W2772039599 cites W1854885336 @default.
• W2772039599 cites W195867136 @default.
• W2772039599 cites W1964506478 @default.
• W2772039599 cites W1965378629 @default.
• W2772039599 cites W1971326463 @default.
• W2772039599 cites W1972868674 @default.
• W2772039599 cites W1974754122 @default.
• W2772039599 cites W1974874470 @default.
• W2772039599 cites W1975378045 @default.
• W2772039599 cites W2006109604 @default.
• W2772039599 cites W2007479771 @default.
• W2772039599 cites W2007604989 @default.
• W2772039599 cites W2017334559 @default.
• W2772039599 cites W2017990047 @default.
• W2772039599 cites W2018043895 @default.
• W2772039599 cites W2057738769 @default.
• W2772039599 cites W2077339343 @default.
• W2772039599 cites W2084765981 @default.
• W2772039599 cites W2090986925 @default.
• W2772039599 cites W2096036254 @default.
• W2772039599 cites W2100283019 @default.
• W2772039599 cites W2102252987 @default.
• W2772039599 cites W2112288559 @default.
• W2772039599 cites W2114725112 @default.
• W2772039599 cites W2119738171 @default.
• W2772039599 cites W2123945791 @default.
• W2772039599 cites W2124402683 @default.
• W2772039599 cites W2129391890 @default.
• W2772039599 cites W2151527192 @default.
• W2772039599 cites W2170045213 @default.
• W2772039599 cites W2218828582 @default.
• W2772039599 cites W2295130467 @default.
• W2772039599 cites W2395177313 @default.
• W2772039599 cites W2397558994 @default.
• W2772039599 cites W2568156492 @default.
• W2772039599 cites W3005451364 @default.
• W2772039599 cites W3121701465 @default.
• W2772039599 cites W4205585032 @default.
• W2772039599 cites W4231139262 @default.
• W2772039599 cites W4240896209 @default.
• W2772039599 cites W4250589301 @default.
• W2772039599 cites W784580495 @default.
• W2772039599 doi "https://doi.org/10.1145/3136754" @default.
• W2772039599 hasPublicationYear "2017" @default.
• W2772039599 type Work @default.
• W2772039599 sameAs 2772039599 @default.
• W2772039599 citedByCount "16" @default.
• W2772039599 countsByYear W27720395992018 @default.
• W2772039599 countsByYear W27720395992019 @default.
• W2772039599 countsByYear W27720395992021 @default.
• W2772039599 countsByYear W27720395992022 @default.
• W2772039599 countsByYear W27720395992023 @default.
• W2772039599 crossrefType "journal-article" @default.
• W2772039599 hasAuthorship W2772039599A5006392819 @default.
• W2772039599 hasAuthorship W2772039599A5043137436 @default.
• W2772039599 hasAuthorship W2772039599A5047351951 @default.
• W2772039599 hasBestOaLocation W27720395991 @default.
• W2772039599 hasConcept C102408133 @default.
• W2772039599 hasConcept C107568181 @default.
• W2772039599 hasConcept C11413529 @default.
• W2772039599 hasConcept C126255220 @default.
• W2772039599 hasConcept C134306372 @default.
• W2772039599 hasConcept C206729178 @default.
• W2772039599 hasConcept C31258907 @default.
• W2772039599 hasConcept C33923547 @default.
• W2772039599 hasConcept C41008148 @default.
• W2772039599 hasConcept C5119721 @default.
• W2772039599 hasConcept C77553402 @default.
• W2772039599 hasConceptScore W2772039599C102408133 @default.
• W2772039599 hasConceptScore W2772039599C107568181 @default.
• W2772039599 hasConceptScore W2772039599C11413529 @default.
• W2772039599 hasConceptScore W2772039599C126255220 @default.
• W2772039599 hasConceptScore W2772039599C134306372 @default.
• W2772039599 hasConceptScore W2772039599C206729178 @default.
• W2772039599 hasConceptScore W2772039599C31258907 @default.
• W2772039599 hasConceptScore W2772039599C33923547 @default.
• W2772039599 hasConceptScore W2772039599C41008148 @default.
• W2772039599 hasConceptScore W2772039599C5119721 @default.
• W2772039599 hasConceptScore W2772039599C77553402 @default.
• W2772039599 hasFunder F4320306076 @default.
• W2772039599 hasFunder F4320338281 @default.
• W2772039599 hasIssue "1" @default.
• W2772039599 hasLocation W27720395991 @default.
• W2772039599 hasOpenAccess W2772039599 @default.

• next