Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Mihai Burcea"'
Autor:
Bosomitu Ștefan, Mihai Burcea
Urmînd noile tendințe ale istoriografiei occidentale, care au reconsiderat locul genului biografic în cercetarea istorică, Spectrele lui Dej sondează istoria comunismului românesc prin prisma unui destin individual. Autorii reconstituie biograf
Publikováno v:
Journal of Scheduling
We study an offline scheduling problem arising in demand response management in a smart grid. Consumers send in power requests with a flexible set of timeslots during which their requests can be served. For example, a consumer may request the dishwas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::916ec18972a5e8d0e3b5c69bab80b5b3
http://livrepository.liverpool.ac.uk/3000424/1/jos2015.pdf
http://livrepository.liverpool.ac.uk/3000424/1/jos2015.pdf
Autor:
Shafaaf Hossain, Arnamoy Bhattacharyya, Allen Deng, Cristiana Amza, Yi Ding, Mihai Burcea, Sai Varikooty, Mike Dai Wang
Publikováno v:
PPOPP
In this work, we introduce and experimentally evaluate a new hybrid software-hardware Transactional Memory prototype based on Intel's Haswell TSX architecture. Our prototype extends the applicability of the existing hardware support for TM by interpo
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783319037790
COCOA
COCOA
We study an offline scheduling problem arising in demand response management in smart grid. Consumers send in power requests with a flexible set of timeslots during which their requests can be served. For example, a consumer may request the dishwashe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c0586432eba1c36d2c7b11062d632c1
https://doi.org/10.1007/978-3-319-03780-6_27
https://doi.org/10.1007/978-3-319-03780-6_27
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642382321
CIAC
CIAC
We study the 2-D and 3-D dynamic bin packing problem, in which items arrive and depart at arbitrary times. The 1-D problem was first studied by Coffman, Garey, and Johnson motivated by the dynamic storage problem. Bar-Noy et al. have studied packing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a053e206f6439bab13ce4d4d6be3fce7
https://doi.org/10.1007/978-3-642-38233-8_8
https://doi.org/10.1007/978-3-642-38233-8_8
Publikováno v:
Algorithms and Computation ISBN: 9783642352607
ISAAC
ISAAC
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. The objective is to minimize the maximum number of bins u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::956ad39a5032d17be5b4e4db3a66c67d
https://doi.org/10.1007/978-3-642-35261-4_8
https://doi.org/10.1007/978-3-642-35261-4_8
Autor:
Cristiana Amza, Bogdan Simion, Daniel Lupei, Matthew Misler, Don Pinto, Mihai Burcea, William Krick
Publikováno v:
EuroSys
In this paper, we study parallelization of multiplayer games using software Transactional Memory (STM) support. We show that the STM provides not only ease of programming, but also better performance than that achievable with state-of-the-art lock-ba
Autor:
Bogdan Simion, Don Pinto, Matthew Misler, Mihai Burcea, Cristiana Amza, Daniel Lupei, William Krick
Publikováno v:
PPOPP
This work addresses the problem of parallelizing multiplayer games using software Transactional Memory (STM) support. Using a realistic high impact application, we show that STM provides not only ease of programming, but also better performance than
Publikováno v:
MSPC
Support for optimistic parallelism such as thread-level speculation (TLS) and transactional memory (TM) has been proposed to ease the task of parallelizing software to exploit the new abundance of multicores. A key requirement for such support is the
Autor:
Mihai Burcea, Michael Voss
Publikováno v:
OpenMP Shared Memory Parallel Programming ISBN: 9783540404354
WOMPAT
WOMPAT
This paper introduces stOMP: a specializing thread-library for OpenMP. Using a combined compile-time and run-time system, stOMP specializes OpenMP parallel regions for frequently-seen values and the configuration of the runtime system. An overview of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efa93a4d63a9470c3f18ae71d2c9ce21
https://doi.org/10.1007/3-540-45009-2_4
https://doi.org/10.1007/3-540-45009-2_4