Matches in SemOpenAlex for { <https://semopenalex.org/work/W2088332251> ?p ?o ?g. }
Showing items 1 to 64 of
64
with 100 items per page.
- W2088332251 endingPage "208" @default.
- W2088332251 startingPage "198" @default.
- W2088332251 abstract "We present a polynomial time algorithm for precedence-constrained scheduling problems in which the task graph can be partitioned into large disjoint parts by removing edges with high float , where the float of an edge is defined as the difference between the length of the longest path in the graph and the length of the longest path containing the edge. Our algorithm guarantees schedules within a factor 1.875 of the optimal independent of the number of processors. The best-known factor for this problem and in general is 2− 2 p , where p is the number of processors, due to Coffman–Graham. Our algorithm is unusual and considerably different from that of Coffman–Graham and other algorithms in the literature." @default.
- W2088332251 created "2016-06-24" @default.
- W2088332251 creator A5023011448 @default.
- W2088332251 date "2003-08-01" @default.
- W2088332251 modified "2023-09-24" @default.
- W2088332251 title "Scheduling loosely connected task graphs" @default.
- W2088332251 cites W1973538756 @default.
- W2088332251 cites W1994739878 @default.
- W2088332251 cites W2027077493 @default.
- W2088332251 cites W2040558879 @default.
- W2088332251 cites W2092333800 @default.
- W2088332251 cites W2150446509 @default.
- W2088332251 doi "https://doi.org/10.1016/s0022-0000(03)00071-0" @default.
- W2088332251 hasPublicationYear "2003" @default.
- W2088332251 type Work @default.
- W2088332251 sameAs 2088332251 @default.
- W2088332251 citedByCount "2" @default.
- W2088332251 crossrefType "journal-article" @default.
- W2088332251 hasAuthorship W2088332251A5023011448 @default.
- W2088332251 hasConcept C11413529 @default.
- W2088332251 hasConcept C114614502 @default.
- W2088332251 hasConcept C118615104 @default.
- W2088332251 hasConcept C126255220 @default.
- W2088332251 hasConcept C132525143 @default.
- W2088332251 hasConcept C1465435 @default.
- W2088332251 hasConcept C206729178 @default.
- W2088332251 hasConcept C22590252 @default.
- W2088332251 hasConcept C311688 @default.
- W2088332251 hasConcept C33923547 @default.
- W2088332251 hasConcept C41008148 @default.
- W2088332251 hasConcept C80444323 @default.
- W2088332251 hasConceptScore W2088332251C11413529 @default.
- W2088332251 hasConceptScore W2088332251C114614502 @default.
- W2088332251 hasConceptScore W2088332251C118615104 @default.
- W2088332251 hasConceptScore W2088332251C126255220 @default.
- W2088332251 hasConceptScore W2088332251C132525143 @default.
- W2088332251 hasConceptScore W2088332251C1465435 @default.
- W2088332251 hasConceptScore W2088332251C206729178 @default.
- W2088332251 hasConceptScore W2088332251C22590252 @default.
- W2088332251 hasConceptScore W2088332251C311688 @default.
- W2088332251 hasConceptScore W2088332251C33923547 @default.
- W2088332251 hasConceptScore W2088332251C41008148 @default.
- W2088332251 hasConceptScore W2088332251C80444323 @default.
- W2088332251 hasIssue "1" @default.
- W2088332251 hasLocation W20883322511 @default.
- W2088332251 hasOpenAccess W2088332251 @default.
- W2088332251 hasPrimaryLocation W20883322511 @default.
- W2088332251 hasRelatedWork W1978699240 @default.
- W2088332251 hasRelatedWork W2000144448 @default.
- W2088332251 hasRelatedWork W2013381657 @default.
- W2088332251 hasRelatedWork W2067133893 @default.
- W2088332251 hasRelatedWork W2071261821 @default.
- W2088332251 hasRelatedWork W2082273344 @default.
- W2088332251 hasRelatedWork W2122098529 @default.
- W2088332251 hasRelatedWork W2126486668 @default.
- W2088332251 hasRelatedWork W2287003313 @default.
- W2088332251 hasRelatedWork W3209626956 @default.
- W2088332251 hasVolume "67" @default.
- W2088332251 isParatext "false" @default.
- W2088332251 isRetracted "false" @default.
- W2088332251 magId "2088332251" @default.
- W2088332251 workType "article" @default.