Loading...
Loading...

Go to the content (press return)

Thread to strand binding of parallel network applications in massive multi-threaded systems

Author
Radojkovic, P.; Cakarevic, V.; Verdu, J.; Pajuelo, M.A.; Cazorla, F. J.; Nemirovsky, M.; Valero, M.
Type of activity
Presentation of work at congresses
Name of edition
15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Date of publication
2010
Presentation's date
2010-01
Book of congress proceedings
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
First page
191
Last page
202
Publisher
ACM Press. Association for Computing Machinery
DOI
https://doi.org/10.1145/1693453.1693480 Open in new window
Repository
http://hdl.handle.net/2117/7885 Open in new window
URL
http://dl.acm.org/citation.cfm?doid=1693453.1693480 Open in new window
Abstract
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a single level of resource sharing, such as pure-SMT or pure-CMP processors. Once the operating system selects the set of applications to simultaneously schedule on the processor (workload), each application/thread must be assigned to one of the hardware contexts (strands). We call this last scheduling step the Thread to Stran...
Citation
Radojkovic, P. [et al.]. Thread to strand binding of parallel network applications in massive multi-threaded systems. A: 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. "Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming". Bangalore, India: ACM Press. Association for Computing Machinery, 2010, p. 191-202.
Group of research
CAP - High Performace Computing Group
VIRTUOS - Virtualisation and Operating Systems

Participants