FRINK Linked Data Fragments server

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

• W116183744 abstract "This dissertation focuses on the problem of assigning the modules of a program to the processors in a distributed system with the goal of minimizing the overall cost of running the program. The cost depends on the execution times of the modules on the processors and on the cost of communication between modules. This module allocation problem arises in a variety of situations where one is interested in making optimum use of available computer resources. The general module allocation problem is intractable; however it becomes polynomially-solvable when the communication graph is restricted. In this dissertation, we restrict our attention to k-trees.As the first problem, we study parametric module allocation on partial k-trees. We allow the costs, both execution and communication, to vary linearly as functions of a real parameter t. We show that if the number of processors is fixed, the sequence of optimum assignments that are obtained, as t varies from zero to infinity, can be constructed in polynomial time. As an auxiliary result, we develop a linear-time algorithm to find a separator in a k-tree. We discuss the implications of our results for parametric versions of the weighted vertex cover, independent set, and 0-1 quadratic programming problems on partial k-trees.Next, we consider two variants of the assignment problem. The first problem is to find a minimum-cost assignment when one of the processors has a limited memory. The second is to find an assignment that minimizes the maximum processor load. We present exact dynamic programming algorithms for both problems, which lead to approximation schemes for the case where the communication graph is a partial k-tree. Faster algorithms are presented for trees with uniform costs. In contrast to these results, we show that, for arbitrary graphs, no fully polynomial time approximation schemes exist unless P = NP. Both dynamic programming algorithms have been implemented. The implementation details and our experimental results are presented." @default.
• W116183744 created "2016-06-24" @default.
• W116183744 creator A5039271704 @default.
• W116183744 date "2018-08-13" @default.
• W116183744 modified "2023-09-23" @default.
• W116183744 title "The assignment problem in distributed computing" @default.
• W116183744 cites W115135420 @default.
• W116183744 cites W138996762 @default.
• W116183744 cites W1486083926 @default.
• W116183744 cites W1517759690 @default.
• W116183744 cites W1558701214 @default.
• W116183744 cites W1562115776 @default.
• W116183744 cites W1570068679 @default.
• W116183744 cites W1829003113 @default.
• W116183744 cites W1963590617 @default.
• W116183744 cites W1970786950 @default.
• W116183744 cites W1971057413 @default.
• W116183744 cites W1973069886 @default.
• W116183744 cites W1982180670 @default.
• W116183744 cites W1984953641 @default.
• W116183744 cites W1987698099 @default.
• W116183744 cites W1991755800 @default.
• W116183744 cites W1993128470 @default.
• W116183744 cites W1998336350 @default.
• W116183744 cites W2002507586 @default.
• W116183744 cites W2008646959 @default.
• W116183744 cites W2012505264 @default.
• W116183744 cites W2022142019 @default.
• W116183744 cites W2022272738 @default.
• W116183744 cites W2022396748 @default.
• W116183744 cites W2026891055 @default.
• W116183744 cites W2028756065 @default.
• W116183744 cites W2032393881 @default.
• W116183744 cites W2048285065 @default.
• W116183744 cites W2055037276 @default.
• W116183744 cites W2067297441 @default.
• W116183744 cites W2069702698 @default.
• W116183744 cites W2070844878 @default.
• W116183744 cites W2071122929 @default.
• W116183744 cites W2071636055 @default.
• W116183744 cites W2077197575 @default.
• W116183744 cites W2077340723 @default.
• W116183744 cites W2085412609 @default.
• W116183744 cites W2085550081 @default.
• W116183744 cites W2093577856 @default.
• W116183744 cites W2093979815 @default.
• W116183744 cites W2097084988 @default.
• W116183744 cites W2113195911 @default.
• W116183744 cites W2115666768 @default.
• W116183744 cites W2127005563 @default.
• W116183744 cites W2138494264 @default.
• W116183744 cites W2149065651 @default.
• W116183744 cites W2150235218 @default.
• W116183744 cites W2151297797 @default.
• W116183744 cites W2151617868 @default.
• W116183744 cites W2157952725 @default.
• W116183744 cites W2159199413 @default.
• W116183744 cites W2166034077 @default.
• W116183744 cites W2169528473 @default.
• W116183744 cites W2231883621 @default.
• W116183744 cites W2914443076 @default.
• W116183744 cites W43570251 @default.
• W116183744 cites W63468529 @default.
• W116183744 doi "https://doi.org/10.31274/rtd-180813-9550" @default.
• W116183744 hasPublicationYear "2018" @default.
• W116183744 type Work @default.
• W116183744 sameAs 116183744 @default.
• W116183744 citedByCount "0" @default.
• W116183744 crossrefType "dissertation" @default.
• W116183744 hasAuthorship W116183744A5039271704 @default.
• W116183744 hasBestOaLocation W1161837442 @default.
• W116183744 hasConcept C11413529 @default.
• W116183744 hasConcept C126255220 @default.
• W116183744 hasConcept C311688 @default.
• W116183744 hasConcept C33923547 @default.
• W116183744 hasConcept C40687702 @default.
• W116183744 hasConcept C41008148 @default.
• W116183744 hasConcept C85044808 @default.
• W116183744 hasConceptScore W116183744C11413529 @default.
• W116183744 hasConceptScore W116183744C126255220 @default.
• W116183744 hasConceptScore W116183744C311688 @default.
• W116183744 hasConceptScore W116183744C33923547 @default.
• W116183744 hasConceptScore W116183744C40687702 @default.
• W116183744 hasConceptScore W116183744C41008148 @default.
• W116183744 hasConceptScore W116183744C85044808 @default.
• W116183744 hasLocation W1161837441 @default.
• W116183744 hasLocation W1161837442 @default.
• W116183744 hasOpenAccess W116183744 @default.
• W116183744 hasPrimaryLocation W1161837441 @default.
• W116183744 hasRelatedWork W1590399153 @default.
• W116183744 hasRelatedWork W1600034714 @default.
• W116183744 hasRelatedWork W1989289072 @default.
• W116183744 hasRelatedWork W2000278241 @default.
• W116183744 hasRelatedWork W2011232221 @default.
• W116183744 hasRelatedWork W2035296187 @default.
• W116183744 hasRelatedWork W2114689831 @default.
• W116183744 hasRelatedWork W2133734164 @default.
• W116183744 hasRelatedWork W2179031489 @default.
• W116183744 hasRelatedWork W2401192975 @default.
• W116183744 hasRelatedWork W2439379691 @default.

• next