Matches in SemOpenAlex for { <https://semopenalex.org/work/W4320170119> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W4320170119 abstract "Computing workflows in heterogeneous multiprocessor systems are frequently modeled as directed acyclic graphs of tasks and data blocks, which represent computational modules and their dependencies in the form of data produced by a task and used by others. However, for some workflows, such as the task schedule in a digital signal processor may run out of memory by exposing too much parallelism. This paper focuses on the data allocation and task scheduling problem under memory constraints, and concentrates on shared memory platforms. We first propose an integer linear programming model to formulate the problem. Then we consider the problem as an extended flexible job shop scheduling problem, while trying to minimize the critical path of the graph. To solve this problem, we propose a tabu search algorithm (TS) which combines several distinguished features such as a greedy initial solution construction method and a mixed neighborhood evaluation strategy based on exact evaluation and approximate evaluation methods. Experimental results on randomly generated instances show that the the proposed TS algorithm can obtain relatively high-quality solutions in a reasonable computational time. In specific, the tabu search method averagely improves the makespan by 5-25% compared to the classical load balancing algorithm that are widely used in the literature. Besides, some key features of TS are also analyzed to identify its success factors." @default.
- W4320170119 created "2023-02-13" @default.
- W4320170119 creator A5006987699 @default.
- W4320170119 creator A5007506428 @default.
- W4320170119 creator A5007953799 @default.
- W4320170119 creator A5029971593 @default.
- W4320170119 creator A5031887553 @default.
- W4320170119 creator A5055640195 @default.
- W4320170119 creator A5088591087 @default.
- W4320170119 date "2022-05-09" @default.
- W4320170119 modified "2023-09-24" @default.
- W4320170119 title "A heuristic method for data allocation and task scheduling on heterogeneous multiprocessor systems under memory constraints" @default.
- W4320170119 doi "https://doi.org/10.48550/arxiv.2206.05268" @default.
- W4320170119 hasPublicationYear "2022" @default.
- W4320170119 type Work @default.
- W4320170119 citedByCount "0" @default.
- W4320170119 crossrefType "posted-content" @default.
- W4320170119 hasAuthorship W4320170119A5006987699 @default.
- W4320170119 hasAuthorship W4320170119A5007506428 @default.
- W4320170119 hasAuthorship W4320170119A5007953799 @default.
- W4320170119 hasAuthorship W4320170119A5029971593 @default.
- W4320170119 hasAuthorship W4320170119A5031887553 @default.
- W4320170119 hasAuthorship W4320170119A5055640195 @default.
- W4320170119 hasAuthorship W4320170119A5088591087 @default.
- W4320170119 hasBestOaLocation W43201701191 @default.
- W4320170119 hasConcept C111919701 @default.
- W4320170119 hasConcept C11413529 @default.
- W4320170119 hasConcept C123370116 @default.
- W4320170119 hasConcept C126255220 @default.
- W4320170119 hasConcept C132525143 @default.
- W4320170119 hasConcept C158336966 @default.
- W4320170119 hasConcept C173608175 @default.
- W4320170119 hasConcept C206729178 @default.
- W4320170119 hasConcept C33923547 @default.
- W4320170119 hasConcept C41008148 @default.
- W4320170119 hasConcept C4822641 @default.
- W4320170119 hasConcept C51823790 @default.
- W4320170119 hasConcept C55416958 @default.
- W4320170119 hasConcept C68387754 @default.
- W4320170119 hasConcept C80444323 @default.
- W4320170119 hasConcept C85924588 @default.
- W4320170119 hasConceptScore W4320170119C111919701 @default.
- W4320170119 hasConceptScore W4320170119C11413529 @default.
- W4320170119 hasConceptScore W4320170119C123370116 @default.
- W4320170119 hasConceptScore W4320170119C126255220 @default.
- W4320170119 hasConceptScore W4320170119C132525143 @default.
- W4320170119 hasConceptScore W4320170119C158336966 @default.
- W4320170119 hasConceptScore W4320170119C173608175 @default.
- W4320170119 hasConceptScore W4320170119C206729178 @default.
- W4320170119 hasConceptScore W4320170119C33923547 @default.
- W4320170119 hasConceptScore W4320170119C41008148 @default.
- W4320170119 hasConceptScore W4320170119C4822641 @default.
- W4320170119 hasConceptScore W4320170119C51823790 @default.
- W4320170119 hasConceptScore W4320170119C55416958 @default.
- W4320170119 hasConceptScore W4320170119C68387754 @default.
- W4320170119 hasConceptScore W4320170119C80444323 @default.
- W4320170119 hasConceptScore W4320170119C85924588 @default.
- W4320170119 hasLocation W43201701191 @default.
- W4320170119 hasOpenAccess W4320170119 @default.
- W4320170119 hasPrimaryLocation W43201701191 @default.
- W4320170119 hasRelatedWork W1546966627 @default.
- W4320170119 hasRelatedWork W1987882231 @default.
- W4320170119 hasRelatedWork W2031485694 @default.
- W4320170119 hasRelatedWork W2045607085 @default.
- W4320170119 hasRelatedWork W2056772503 @default.
- W4320170119 hasRelatedWork W2158767150 @default.
- W4320170119 hasRelatedWork W2400050947 @default.
- W4320170119 hasRelatedWork W2963688429 @default.
- W4320170119 hasRelatedWork W4312509267 @default.
- W4320170119 hasRelatedWork W2525598418 @default.
- W4320170119 isParatext "false" @default.
- W4320170119 isRetracted "false" @default.
- W4320170119 workType "article" @default.