Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Peter A Jonsson"'
Publikováno v:
PLoS ONE, Vol 10, Iss 4, p e0123545 (2015)
Programmers struggle to understand performance of task-based OpenMP programs since profiling tools only report thread-based performance. Performance tuning also requires task-based performance in order to balance per-task memory hierarchy utilization
Externí odkaz:
https://doaj.org/article/0d264dc000d241849f04d3596fe018b1
Autor:
Peter A. Jonsson, Johan Nordlander
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 3 (2010)
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, and changes the behavior of a program depending on whether it is optimize
Externí odkaz:
https://doaj.org/article/80c8305c75dd49a08c247593c5b7a4f4
Publikováno v:
PPOPP
Average programmers struggle to solve performance problems in OpenMP programs with tasks and parallel for-loops. Existing performance analysis tools visualize OpenMP task performance from the runtime system's perspective where task execution is inter
Background/Aims: Physiological growth hormone (GH) secretion and insulin-like growth factor-I (IGF-I) levels are greater in young compared to older adults. We evaluated IGF-I levels and predictors of IGF-I responses in young adults on GH replacement.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00d316c3ce611109dbcf38bc170384de
https://www.repository.cam.ac.uk/handle/1810/255017
https://www.repository.cam.ac.uk/handle/1810/255017
Autor:
Peter A. Jonsson, Örjan Johansson
Publikováno v:
Journal of Sound and Vibration. 282:1043-1064
Vehicle manufacturers are continuously seeking to improve vibration comfort. In this paper, subjective responses from transient vibrations in a forklift were analyzed on the basis of ISO 2631-1 and a number of additional variables. The objectives wer
Publikováno v:
OpenMP in the Era of Low Power Devices and Accelerators ISBN: 9783642406973
IWOMP
IWOMP
Modern parallel computer systems exhibit Non-Uniform Memory Access (NUMA) behavior. For best performance, any parallel program therefore has to match data allocation and scheduling of computations to the memory architecture of the machine. When done
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78830db53b1e99da1f2b4c2eed02b48d
Publikováno v:
Jensen, S H, Jonsson, P A & Møller, A 2012, Remedying the Eval that Men Do . in M Heimdahl & Z Su (eds), 2012 International Symposium on Software Testing and Analysis (ISSTA) : Proceedings . Association for Computing Machinery, pp. 34-44, Minneapolis, United States, 15/07/2012 . https://doi.org/10.1145/2338965.2336758
ISSTA
ISSTA
A range of static analysis tools and techniques have been developed in recent years with the aim of helping JavaScript web application programmers produce code that is more robust, safe, and efficient. However, as shown in a previous large-scale stud
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::436e399e05472b43c2c0fa4c7e962496
https://pure.au.dk/portal/da/publications/remedying-the-eval-that-men-do(f4686861-7b98-495e-b9c9-7041c08d7abf).html
https://pure.au.dk/portal/da/publications/remedying-the-eval-that-men-do(f4686861-7b98-495e-b9c9-7041c08d7abf).html
Autor:
Nicholas A Tritos, Amir H Hamrahian, Donna King, Susan L Greenspan, David M Cook, Peter J Jonsson, Michael P Wajnrajch, Maria Koltowska-Haggstrom, Beverly MK Biller
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fac0b69fe42ba0dc93ac1f36e4b02464
https://doi.org/10.1210/endo-meetings.2011.part2.p36.p2-364
https://doi.org/10.1210/endo-meetings.2011.part2.p36.p2-364
Autor:
Peter A. Jonsson, Johan Nordlander
Publikováno v:
PEPM
Supercompilation algorithms can perform great optimizations but sometimes suffer from the problem of code explosion. This results in huge binaries which might hurt the performance on a modern processor. We present a supercompilation algorithm that is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af22132b01a81c040dff4dc94d5ea0da
http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-39898
http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-39898
Autor:
Peter A. Jonsson, Johan Nordlander
Publikováno v:
POPL
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, and changes the behavior of a program depending on whether it is optimize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55bb24e5114594cf652be306478742a8
http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-32194
http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-32194