Cargando…
A DAG Scheduling Scheme on Heterogeneous Computing Systems Using Tuple-Based Chemical Reaction Optimization
A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the co...
Autores principales: | Jiang, Yuyi, Shao, Zhiqing, Guo, Yi |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4095736/ https://www.ncbi.nlm.nih.gov/pubmed/25143977 http://dx.doi.org/10.1155/2014/404375 |
Ejemplares similares
-
Computing Resource Allocation Scheme for DAG-Based IOTA Nodes
por: Hellani, Houssein, et al.
Publicado: (2021) -
FunTuple: A new N-tuple algorithm for offline data processing at the LHCb experiment
por: Mathad, Abhijit, et al.
Publicado: (2023) -
The 2-tuple linguistic model: computing with words in decision making
por: Martínez, Luis, et al.
Publicado: (2015) -
Physico-Chemical and Structural Interpretation of Discrete Derivative Indices on N-Tuples Atoms
por: Martínez-Santiago, Oscar, et al.
Publicado: (2016) -
On tuples of commuting symmetric, non-selfadjoint operators
por: Friedrich, J M
Publicado: (1989)