Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Patrick Eitschberger"'
Autor:
Jörg Keller, Patrick Eitschberger
Publikováno v:
Concurrency and Computation: Practice and Experience. 32
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7e8e3525951b5ebf310805af7377384
https://doi.org/10.1002/cpe.5396
https://doi.org/10.1002/cpe.5396
Publikováno v:
ACSD
Stream programming abstracts parallelism complexity by modeling a program as a set of streaming tasks. Tasks run repeatedly and can even be internally parallel, i.e., use one or multiple cores simultaneously (moldable). The throughput of the streamin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::245cf07ff1d3072567a906cb89086461
https://doi.org/10.1109/acsd.2019.00011
https://doi.org/10.1109/acsd.2019.00011
Publikováno v:
Microprocessors and Microsystems. 43:14-25
Many-core systems provide a great performance potential with the massively parallel hardware structure. Yet, these systems are facing increasing challenges such as high operating temperatures, high electrical bills, unpleasant noise levels due to act
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55837a7c730e7fee62ad38314a6b20d1
https://doi.org/10.1016/j.micpro.2016.01.008
https://doi.org/10.1016/j.micpro.2016.01.008
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319776095
ARCS
ARCS
Fault tolerance in parallel systems can be achieved by duplicating task executions onto several processing units, so in case one processing unit (PU) fails, the task can continue executing on another unit. Duplicating task execution affects the perfo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1d593282a0d7a4b8d723f06071d047c
https://doi.org/10.1007/978-3-319-77610-1_1
https://doi.org/10.1007/978-3-319-77610-1_1
Publikováno v:
SCOPES
Exploiting effectively massively parallel architectures is a major challenge that stream programming can help facilitate. We investigate the problem of generating energy-optimal code for a collection of streaming tasks that include parallelizable or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f50f55b0fbfa33af9730108110eb2eea
https://doi.org/10.1145/2687653
https://doi.org/10.1145/2687653
Publikováno v:
Network and System Security ISBN: 9783319647005
NSS
NSS
Cryptographic applications like symmetric encryption algorithms can be implemented either in bit-slice or word-parallel fashion. The conversion between the two data representations corresponds to transposing a bit-matrix with variables as row vectors
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ad07f6b05ff501869e57977154bf904
https://doi.org/10.1007/978-3-319-64701-2_12
https://doi.org/10.1007/978-3-319-64701-2_12
Autor:
Patrick Eitschberger, Jörg Keller
Publikováno v:
PDP
Workflows of dependent tasks are a widespread model for parallel applications, often statically scheduled prior to application. Static schedules can tolerate processor failures due to permanent faults by placing duplicate tasks during the scheduling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bacd695c998e73d9aa20ff66a2faa9f9
https://doi.org/10.1109/pdp.2017.30
https://doi.org/10.1109/pdp.2017.30
Publikováno v:
PARS-Mitteilungen. 30:37-46
We investigate the energy-efficiency of streaming task collections with parallelizable or malleable tasks on a manycore processor with frequency scaling. Streaming task collections differ from classical task sets in that all tasks are running concurr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0dd65df105f367492fc0411bd7c3f278
https://doi.org/10.1007/bf03354236
https://doi.org/10.1007/bf03354236
Autor:
Patrick Eitschberger, Jörg Keller
Publikováno v:
PDP
We investigate deadline scheduling of independent tasks on parallel processors with discrete frequency levels, when the latency for frequency scaling cannot be neglected. This situation frequently occurs in applications, e.g. streaming applications w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dc0a37e7ba309f335c1e12161c658e5
https://doi.org/10.1109/pdp.2015.64
https://doi.org/10.1109/pdp.2015.64
Publikováno v:
PDP
Static schedules can be a preferable alternative for applications with timing requirements and predictable behavior since the processing resources can be more precisely allocated for the given workload. Unused resources are handled by power managemen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4f2c40f24a3b3937e10dc4715a022d0
https://doi.org/10.1109/pdp.2015.27
https://doi.org/10.1109/pdp.2015.27