Zobrazeno 1 - 10
of 100
pro vyhledávání: '"processor affinities"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Real-Time Systems. 51:440-483
Contemporary multiprocessor real-time operating systems, such as VxWorks, LynxOS, QNX, and real-time variants of Linux, allow a process to have an arbitrary processor affinity, that is, a process may be pinned to an arbitrary subset of the processors
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13719a15a7bc51676aa8fbda0f2d4adc
https://doi.org/10.1007/s11241-014-9205-9
https://doi.org/10.1007/s11241-014-9205-9
Publikováno v:
Proceedings (Euromicro Conf. Real-Time Syst., Online) (2016): 237–247. doi:10.1109/ECRTS.2016.24
info:cnr-pdr/source/autori:Bonifaci, Vincenzo; Brandenburg, Bjoern; D'Angelo, Gianlorenzo; Marchetti-Spaccamela, Alberto/titolo:Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities/doi:10.1109%2FECRTS.2016.24/rivista:Proceedings (Euromicro Conf. Real-Time Syst., Online)/anno:2016/pagina_da:237/pagina_a:247/intervallo_pagine:237–247/volume
ECRTS
28th Euromicro Conference on Real-Time Systems, ECRTS 2016
28th Euromicro Conference on Real-Time Systems, ECRTS 2016, Jul 2016, Toulouse, France. pp.237-247, ⟨10.1109/ECRTS.2016.24⟩
info:cnr-pdr/source/autori:Bonifaci, Vincenzo; Brandenburg, Bjoern; D'Angelo, Gianlorenzo; Marchetti-Spaccamela, Alberto/titolo:Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities/doi:10.1109%2FECRTS.2016.24/rivista:Proceedings (Euromicro Conf. Real-Time Syst., Online)/anno:2016/pagina_da:237/pagina_a:247/intervallo_pagine:237–247/volume
ECRTS
28th Euromicro Conference on Real-Time Systems, ECRTS 2016
28th Euromicro Conference on Real-Time Systems, ECRTS 2016, Jul 2016, Toulouse, France. pp.237-247, ⟨10.1109/ECRTS.2016.24⟩
International audience; Many multiprocessor real-time operating systems offer the possibility to restrict the migrations of any task to a specified subset of processors by setting affinity masks. A notion of " strong arbitrary processor affinity sche
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bef7b522c988995fc01a0c192a6ceb71
https://publications.cnr.it/doc/367499
https://publications.cnr.it/doc/367499
Publikováno v:
ECRTS
Contemporary multiprocessor real-time operating systems, such as VxWorks, LynxOS, QNX, and real-time variants of Linux, allow a process to have an arbitrary processor affinity, that is, a process may be pinned to an arbitrary subset of the processors
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14c5c434ba0f4ff588f31612f57ce7d5
https://doi.org/10.1109/ecrts.2013.18
https://doi.org/10.1109/ecrts.2013.18
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bjorn B. Brandenburg, Sanjoy Baruah
Publikováno v:
RTSS
In many current multiprocessor real-time operating systems, programmers have the ability to set affinity masks that pin a process to a specified subset of the processors in the system. Given a real-time task system consisting of a collection of impli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c610823730ef101b362c846e1710d795
https://doi.org/10.1109/rtss.2013.24
https://doi.org/10.1109/rtss.2013.24
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Computer and System Sciences
Journal of Computer and System Sciences, Elsevier, 2021, 120, pp.116-136. ⟨10.1016/j.jcss.2021.03.006⟩
Journal of Computer and System Sciences, 2021, 120, pp.116-136. ⟨10.1016/j.jcss.2021.03.006⟩
Proceedings-IEEE International Parallel and Distributed Processing Symposium (2017): 738–747. doi:10.1109/IPDPS.2017.22
info:cnr-pdr/source/autori:Bonifaci, Vincenzo; D'Angelo, Gianlorenzo; Marchetti-Spaccamela, Alberto/titolo:Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling/doi:10.1109%2FIPDPS.2017.22/rivista:Proceedings-IEEE International Parallel and Distributed Processing Symposium/anno:2017/pagina_da:738/pagina_a:747/intervallo_pagine:738–747/volume
IPDPS
Journal of Computer and System Sciences, Elsevier, 2021, 120, pp.116-136. ⟨10.1016/j.jcss.2021.03.006⟩
Journal of Computer and System Sciences, 2021, 120, pp.116-136. ⟨10.1016/j.jcss.2021.03.006⟩
Proceedings-IEEE International Parallel and Distributed Processing Symposium (2017): 738–747. doi:10.1109/IPDPS.2017.22
info:cnr-pdr/source/autori:Bonifaci, Vincenzo; D'Angelo, Gianlorenzo; Marchetti-Spaccamela, Alberto/titolo:Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling/doi:10.1109%2FIPDPS.2017.22/rivista:Proceedings-IEEE International Parallel and Distributed Processing Symposium/anno:2017/pagina_da:738/pagina_a:747/intervallo_pagine:738–747/volume
IPDPS
We propose a model for scheduling jobs in a parallel machine setting that takes into account the cost of migrations by assuming that the processing time of a job may depend on the specific set of machines among which the job is migrated. For the make
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ad0cfdac60c222d4d9fe4c8d03bc012
http://hdl.handle.net/11573/1571248
http://hdl.handle.net/11573/1571248
Autor:
Baruah, Sanjoy, Brandenburg, Bjorn
Publikováno v:
2013 IEEE 34th Real-Time Systems Symposium; 2013, p160-169, 10p