«task graph»
۱۶٬۸۹۴ نتیجهSymbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally depend on the problem size. In this paper, we propose a symbolic scheduling scheme f
Two-level checkpointing and partial verifications for linear task graphs
Fail-stop and silent errors are unavoidable on large-scale platforms. Efficient resilience techniques must accommodate both error sources. A traditional checkpointing and rollback recovery approach can be used, with added verifications to detect silent errors. A fail-stop error l
Co-Synthesis of Dynamically Reconfigurable SOPCs Specified by Condi- tional Task Graphs
In this work the co-synthesis method, that optimizes dynamically reconfigurable multiprocessor SOPC system architectures, is presented. The algorithm maximizes speed of a SOPC system, taking into consideration the space constraints of the FPGA. The algorithm starts with the initi
Models for Scheduling Task Graphs onto Hypercube Systems
Given a set of m tasks with a precedence constraint P and a communication requirement C, where each task has execution time and a subcube requirement, the Hypercube Task Scheduling Problem (HTSP) is to nd an assignment of tasks which minimizes the total completion time. In this p
A task graph based application framework for mobile ad hoc networks
We propose a task graph based framework for modeling and execution of distributed applications in mobile ad hoc networks. Our framework represents a distributed application by a graph composed of nodes and edges in which the nodes logically represent application subtasks that nee
Optimized Mapping of Pipelined Task Graphs on the Cell BE
Limited bandwidth to off-chip main memory poses a problem in chip multiprocessors for streaming applications, such as Cell BE, and will become more severe with the expected increase in the number of cores. Especially for streaming computations where the ratio between computationa
Scalable Service Composition in Mobile Ad hoc Networks using Hierarchical Task Graphs∗†
Service discovery is an essential component of application development in dynamic environments such as mobile ad hoc networks (MANETs). This is because the service providing devices are themselves mobile in MANETs and hence, the service–device binding cannot be tightly coupled ov
Restricted Range Exhaustive Search: A New Heuristic for HW/SW Partitioning of Task Graphs
This paper presents a new deterministic algorithm for the classical HW/SW partitioning problem, targeting a common architecture model consisting of a microprocessor and a set of ASIC blocks. The system to be partitioned is represented as an acyclic task graph, for which a set of
On the complexity of task graph scheduling with transient and fail-stop failures
This paper deals with the complexity of task graph scheduling with transient and fail-stop failures. While computing the reliability of a given schedule is easy in the absence of task replication, the problem becomes much more difficult when task replication is used. Our main res
Steady-State for Batches of Identical Task Graphs
In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies,