Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Mats Brorsson"'
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
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031236327
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90be4a1ce0ae0e5cd57fb9f0dc2bfa85
https://doi.org/10.1007/978-3-031-23633-4_9
https://doi.org/10.1007/978-3-031-23633-4_9
Autor:
Karthick Panner Selvam, Mats Brorsson
Publikováno v:
2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS).
Autor:
Masoud Daneshtalab, Mats Brorsson
Publikováno v:
PDP
Parallel, Distributed, and Network-Based Processing has undergone impressive change over recent years. New architectures and applications have rapidly become the central focus of the discipline. These changes are often a result of cross-fertilization
Autor:
Isil Oz, Konstantin Popov, Muhammad Khurram Bhatti, Maria Mushtaq, Sarah Amin, Umer Farooq, Mats Brorsson
Publikováno v:
Computing
Computing, Springer Verlag, 2017, ⟨10.1007/s00607-017-0581-6⟩
Computing, Springer Verlag, 2017, ⟨10.1007/s00607-017-0581-6⟩
In systems with complex many-core cache hierarchy, exploiting data locality can significantly reduce execution time and energy consumption of parallel applications. Locality can be exploited at various hardware and software layers. For instance, by i
Publikováno v:
Arabian Journal for Science and Engineering. 41:3279-3295
Parallel computing systems promise higher performance for computationally intensive applications. Since programmes for parallel systems consist of tasks that can be executed simultaneously, task scheduling becomes crucial for the performance of these
As multicore systems evolve by increasing the number of parallel execution units, parallel programming models have been released to exploit parallelism in the applications. Task-based programming model uses task abstractions to specify parallel tasks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61535bd2c37953bf27020d5d750eba5c
http://orbilu.uni.lu/handle/10993/46636
http://orbilu.uni.lu/handle/10993/46636
Autor:
Alexander Imani Cowen-Rivers, Phu Sakulwongtana, Ying Wen, Radu State, Manxing Du, Mats Brorsson, Jun Wang
Publikováno v:
ICDM Workshops
Real-time bidding (RTB) is a popular method to sell online ad space inventory using real-time auctions to determine which advertiser gets to make the ad impression. Advertisers can take user information into account when making their bids and get mor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8027f71e078ca09933efce74391e4dc9
http://orbilu.uni.lu/handle/10993/41419
http://orbilu.uni.lu/handle/10993/41419
Autor:
Mats Brorsson, Georgios Varisteas
Publikováno v:
Concurrency and Computation: Practice and Experience. 28:472-491
We present Palirria, a self-adapting work-stealing scheduling method for nested fork/join parallelism that can be used to estimate the number of utilizable workers and self-adapt accordingly. The estimation mechanism is optimized for accuracy, minimi
Publikováno v:
Proceedings of the 13th International Conference on Advanced Data Mining and Applications (pp. 711-726). Springer (2017).
Advanced Data Mining and Applications ISBN: 9783319691787
ADMA
Advanced Data Mining and Applications ISBN: 9783319691787
ADMA
Online advertising is increasingly switching to real-time bidding on advertisement inventory, in which the ad slots are sold through real-time auctions upon users visiting websites or using mobile apps. To compete with unknown bidders in such a highl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44f1a29bf4457ef6061addd064572777
http://orbilu.uni.lu/handle/10993/33478
http://orbilu.uni.lu/handle/10993/33478