FRINK Linked Data Fragments server

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

• W2006732289 endingPage "500" @default.
• W2006732289 startingPage "471" @default.
• W2006732289 abstract "A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program. In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length. In this paper we study a subclass of dynamic process graphs called PAR -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is NEXPTIME -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a NEXPTIME -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion." @default.
• W2006732289 created "2016-06-24" @default.
• W2006732289 creator A5001544783 @default.
• W2006732289 creator A5053904278 @default.
• W2006732289 creator A5089868014 @default.
• W2006732289 date "2004-12-01" @default.
• W2006732289 modified "2023-10-14" @default.
• W2006732289 title "Approximating schedules for dynamic process graphs efficiently" @default.
• W2006732289 cites W1563172155 @default.
• W2006732289 cites W1736318725 @default.
• W2006732289 cites W1982538209 @default.
• W2006732289 cites W1983770018 @default.
• W2006732289 cites W1989582918 @default.
• W2006732289 cites W2021380921 @default.
• W2006732289 cites W2065939997 @default.
• W2006732289 cites W2074762232 @default.
• W2006732289 cites W2138462400 @default.
• W2006732289 doi "https://doi.org/10.1016/j.jda.2004.04.007" @default.
• W2006732289 hasPublicationYear "2004" @default.
• W2006732289 type Work @default.
• W2006732289 sameAs 2006732289 @default.
• W2006732289 citedByCount "0" @default.
• W2006732289 crossrefType "journal-article" @default.
• W2006732289 hasAuthorship W2006732289A5001544783 @default.
• W2006732289 hasAuthorship W2006732289A5053904278 @default.
• W2006732289 hasAuthorship W2006732289A5089868014 @default.
• W2006732289 hasBestOaLocation W20067322891 @default.
• W2006732289 hasConcept C126255220 @default.
• W2006732289 hasConcept C199360897 @default.
• W2006732289 hasConcept C33923547 @default.
• W2006732289 hasConcept C41008148 @default.
• W2006732289 hasConcept C98045186 @default.
• W2006732289 hasConceptScore W2006732289C126255220 @default.
• W2006732289 hasConceptScore W2006732289C199360897 @default.
• W2006732289 hasConceptScore W2006732289C33923547 @default.
• W2006732289 hasConceptScore W2006732289C41008148 @default.
• W2006732289 hasConceptScore W2006732289C98045186 @default.
• W2006732289 hasIssue "4" @default.
• W2006732289 hasLocation W20067322891 @default.
• W2006732289 hasOpenAccess W2006732289 @default.
• W2006732289 hasPrimaryLocation W20067322891 @default.
• W2006732289 hasRelatedWork W1566919151 @default.
• W2006732289 hasRelatedWork W1974891317 @default.
• W2006732289 hasRelatedWork W1979597421 @default.
• W2006732289 hasRelatedWork W2007980826 @default.
• W2006732289 hasRelatedWork W2370652759 @default.
• W2006732289 hasRelatedWork W2748952813 @default.
• W2006732289 hasRelatedWork W2899084033 @default.
• W2006732289 hasRelatedWork W4225152035 @default.
• W2006732289 hasRelatedWork W4245490552 @default.
• W2006732289 hasRelatedWork W831794578 @default.
• W2006732289 hasVolume "2" @default.
• W2006732289 isParatext "false" @default.
• W2006732289 isRetracted "false" @default.
• W2006732289 magId "2006732289" @default.
• W2006732289 workType "article" @default.