Cargando…
Bounding the execution time of parallel applications on unrelated multiprocessors
Heterogeneous multiprocessors can offer high performance at low energy expenditures. However, to be able to use them in hard real-time systems, timing guarantees need to be provided, and the main challenge is to determine the worst-case schedule length (also known as makespan) of an application. Pre...
Autores principales: | Voudouris, Petros, Stenström, Per, Pathan, Risat |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9159681/ https://www.ncbi.nlm.nih.gov/pubmed/35663514 http://dx.doi.org/10.1007/s11241-021-09375-2 |
Ejemplares similares
-
Multiprocessors and parallel processing
por: Enslow, Philip H
Publicado: (1974) -
Parallel computing on distributed memory multiprocessors
por: Özgüner, Füsun, et al.
Publicado: (1993) -
Workshop on Multiprocessors for High-performance Parallel Computation
por: Jones, A K, et al.
Publicado: (1983) -
Design principles for shared memory multiprocessors: a collection of papers from the MUMS project
por: Philipson, Lars, et al.
Publicado: (1990) -
Multiprocessor systems
por: Mazare, G
Publicado: (1974)