Affinity scheduling in staged server architectures Export

@misc{citeulike:605788, abstract = {Modern servers typically process request streams by assigning a worker thread to a request, and rely on a round robin policy for context-switching. Although this programming paradigm is intuitive, it is oblivious to the execution state and ignores each software module's affinity to the processor caches. As a result, resumed threads of execution suffer additional delays due to conflict and compulsory misses while populating the caches with their evicted working sets. Alternatively, the...}, author = {Harizopoulos, S. and Ailamaki, A.}, citeulike-article-id = {605788}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4633}, keywords = {batch-processing, parallel-processing}, posted-at = {2006-04-28 12:42:55}, priority = {2}, title = {Affinity scheduling in staged server architectures}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4633}, year = {2002} }

TY - GEN ID - citeulike:605788 L3 - citeulike-article-id:605788 N2 - Modern servers typically process request streams by assigning a worker thread to a request, and rely on a round robin policy for context-switching. Although this programming paradigm is intuitive, it is oblivious to the execution state and ignores each software module's affinity to the processor caches. As a result, resumed threads of execution suffer additional delays due to conflict and compulsory misses while populating the caches with their evicted working sets. Alternatively, the... TI - Affinity scheduling in staged server architectures KW - batch-processing KW - parallel-processing AU - Harizopoulos, S AU - Ailamaki, A PY - 2002/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4633 ER -