| 000 | 01314nab a2200289 a 4500 | ||
|---|---|---|---|
| 003 | AR-LpUFIB | ||
| 005 | 20250311170355.0 | ||
| 008 | 230201nuuuu xx o 000 0 ||| d | ||
| 024 | 8 |
_aDIF-M5509 _b2375 _zDIF005200 |
|
| 040 |
_aAR-LpUFIB _bspa _cAR-LpUFIB |
||
| 100 | 1 | _aBotincan, Matko | |
| 245 | 1 | 0 | _aAn Enhancement of Futures Runtime in Presence of Cache Memory Hierarchy |
| 300 | _a2008 16 (4) : 339-344 | ||
| 520 | _aA future is a simple abstraction mechanism for exposing potential concurrency in programs. In this paper, we propose an enhancement of our previously developed runtime for scheduling and executing futures based on the lazy task creation technique that aims to reflect the cache memory hierarchy present in modern multi-core and multiprocessor systems. | ||
| 773 |
_7nnas _t Novática _a _g2000(143,145-147) _oDIF-R057 |
||
| 856 | 4 | 0 | _ucit.zesoi.fer.hr/browsePaper.php?issue=36&seq=14&paper=1403 |
| 942 | _cAR | ||
| 999 |
_c54993 _d54993 |
||