FRINK Linked Data Fragments server

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

• W3087835688 abstract "Author(s): Shadloo, Maryam | Advisor(s): Im, Sungjin | Abstract: This dissertation focuses on the design and analysis of approximation and online algorithms for scheduling problems arising in large datacenters and cloud computing environments.The recent advancement of science and engineering crucially relies on computing platforms processing large data sets, and modern datacenters provide such platforms. We address four different scheduling settings motivated by modern computing environments; speed scaling setting, co-flow setting, batch scheduling setting, and unrelated machines setting.Speed scaling setting: Modern processors typically allow dynamic speed-scaling offering an effective trade-off between high throughput and energy efficiency. In a classical model, a processor/machine runs at speed s when consuming power s^α where αg1 is a constant. We study the problem of completing all jobs before their deadlines non-preemptively with the minimum energy on parallel machines with dynamic speed-scaling capabilities. This problem is crucial in datacenters that are estimated to use energy as much as a city.Co-flow setting: Coflow has recently been introduced to abstract communication patterns that are widely observed in the cloud and massively parallel computing frameworks. Coflow consists of several flows that each represent data communication from one machine to another. A coflow is completed when all of its flows are completed. We consider coflow for the objective of maximizing partial throughput. This objective seeks to measure the progress made for partially completed coflows before their deadlines. Batch scheduling setting: This setting is used to model client-server systems like multiuser operating systems, web servers, etc. In this setting, there is a server that stores different pages of information and receives requests from clients over time for specific pages. The server can transmit at most one page at each time to satisfy a batch of requests for that page, up to a certain capacity. We study the maximum flow time minimization problem in this setting, which is a capacitated version of broadcast scheduling.Unrelated machines setting: The unrelated machines setting is one of the most general and versatile scheduling models. It captures the heterogeneity of jobs and machines, which is widely observed in cloud computing environments and server clusters. We consider the classic scheduling problem of minimizing total weighted completion time on unrelated parallel machines. Machines are unrelated in the sense that each job can have different processing times on different machines.We use the standard worst-case analysis to measure the quality of the algorithms we develop for the underlying scheduling problems. Approximation ratio and competitive ratio are two popular quantities that measure the worst-case performance of offline and online algorithms, respectively. An offline algorithm is said to be α-approximation if its objective is within a multiplicative factor α of the optimal scheduler's objective for any input instance. Roughly speaking, an algorithm with a small approximation ratio performs well compared to the optimal scheduler, even on a worst-case input. To evaluate the worst-case performance of an online algorithm, we compute the worst ratio between the objective value of the online algorithm and the optimal offline scheduler's objective for any input instance." @default.
• W3087835688 created "2020-10-01" @default.
• W3087835688 creator A5071922030 @default.
• W3087835688 date "2020-01-01" @default.
• W3087835688 modified "2023-09-26" @default.
• W3087835688 title "New Online and Approximate Scheduling Algorithms" @default.
• W3087835688 hasPublicationYear "2020" @default.
• W3087835688 type Work @default.
• W3087835688 sameAs 3087835688 @default.
• W3087835688 citedByCount "0" @default.
• W3087835688 crossrefType "journal-article" @default.
• W3087835688 hasAuthorship W3087835688A5071922030 @default.
• W3087835688 hasConcept C111919701 @default.
• W3087835688 hasConcept C11413529 @default.
• W3087835688 hasConcept C119599485 @default.
• W3087835688 hasConcept C120314980 @default.
• W3087835688 hasConcept C126255220 @default.
• W3087835688 hasConcept C127413603 @default.
• W3087835688 hasConcept C153740404 @default.
• W3087835688 hasConcept C157742956 @default.
• W3087835688 hasConcept C173608175 @default.
• W3087835688 hasConcept C190475519 @default.
• W3087835688 hasConcept C196921405 @default.
• W3087835688 hasConcept C206729178 @default.
• W3087835688 hasConcept C2524010 @default.
• W3087835688 hasConcept C2742236 @default.
• W3087835688 hasConcept C2780165032 @default.
• W3087835688 hasConcept C33923547 @default.
• W3087835688 hasConcept C41008148 @default.
• W3087835688 hasConcept C79974875 @default.
• W3087835688 hasConcept C93996380 @default.
• W3087835688 hasConcept C99844830 @default.
• W3087835688 hasConceptScore W3087835688C111919701 @default.
• W3087835688 hasConceptScore W3087835688C11413529 @default.
• W3087835688 hasConceptScore W3087835688C119599485 @default.
• W3087835688 hasConceptScore W3087835688C120314980 @default.
• W3087835688 hasConceptScore W3087835688C126255220 @default.
• W3087835688 hasConceptScore W3087835688C127413603 @default.
• W3087835688 hasConceptScore W3087835688C153740404 @default.
• W3087835688 hasConceptScore W3087835688C157742956 @default.
• W3087835688 hasConceptScore W3087835688C173608175 @default.
• W3087835688 hasConceptScore W3087835688C190475519 @default.
• W3087835688 hasConceptScore W3087835688C196921405 @default.
• W3087835688 hasConceptScore W3087835688C206729178 @default.
• W3087835688 hasConceptScore W3087835688C2524010 @default.
• W3087835688 hasConceptScore W3087835688C2742236 @default.
• W3087835688 hasConceptScore W3087835688C2780165032 @default.
• W3087835688 hasConceptScore W3087835688C33923547 @default.
• W3087835688 hasConceptScore W3087835688C41008148 @default.
• W3087835688 hasConceptScore W3087835688C79974875 @default.
• W3087835688 hasConceptScore W3087835688C93996380 @default.
• W3087835688 hasConceptScore W3087835688C99844830 @default.
• W3087835688 hasLocation W30878356881 @default.
• W3087835688 hasOpenAccess W3087835688 @default.
• W3087835688 hasPrimaryLocation W30878356881 @default.
• W3087835688 hasRelatedWork W1705148050 @default.
• W3087835688 hasRelatedWork W1789899005 @default.
• W3087835688 hasRelatedWork W2032664015 @default.
• W3087835688 hasRelatedWork W2036954866 @default.
• W3087835688 hasRelatedWork W2051607127 @default.
• W3087835688 hasRelatedWork W2098037768 @default.
• W3087835688 hasRelatedWork W2104061553 @default.
• W3087835688 hasRelatedWork W2132067977 @default.
• W3087835688 hasRelatedWork W2198789929 @default.
• W3087835688 hasRelatedWork W2309616738 @default.
• W3087835688 hasRelatedWork W2430994543 @default.
• W3087835688 hasRelatedWork W2581511519 @default.
• W3087835688 hasRelatedWork W2783412189 @default.
• W3087835688 hasRelatedWork W2784202640 @default.
• W3087835688 hasRelatedWork W2886321214 @default.
• W3087835688 hasRelatedWork W2894677423 @default.
• W3087835688 hasRelatedWork W2995558816 @default.
• W3087835688 hasRelatedWork W3008773625 @default.
• W3087835688 hasRelatedWork W310480992 @default.
• W3087835688 hasRelatedWork W3169897135 @default.
• W3087835688 isParatext "false" @default.
• W3087835688 isRetracted "false" @default.
• W3087835688 magId "3087835688" @default.
• W3087835688 workType "article" @default.