You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Efficient threads mapping on multicore architecture

Fulltext:


Authors:

Iulian Nita , Adrian Rapan , Vasile Lazarescu , Tiberiu Seceleanu

Publication Type:

Conference/Workshop Paper

Venue:

The 8th International Conference on Communications, COMM 2010.

Publisher:

IEEE

DOI:

10.1109/ICCOMM.2010.5508993

Abstract

Considering today's hardware performance, in order to obtain best results, a proper programming strategy for optimum mapping of all processes to existing resources is necessary. The presence of multiple cores in a single chip requires applications with a higher level of parallelism. The use of suited mapping algorithms can lead to a great performance improvement considering computing time at a smaller energy consumption. We've realized a comparison between the parallel computing with an efficient mapping algorithm of threads to specific cores and parallel computing with threads mapping maintained by Linux kernel process scheduler. We observed that a good strategy regarding thread mapping on different processing units, balancing all available cores and allocating a specific amount of work, can lead to improved computational time. In our simulation we used Kubuntu Linux operating system, a system with Intel Core 2 Duo processor and another system with an Intel Quad Core.

Bibtex

@inproceedings{Nita2038,
author = {Iulian Nita and Adrian Rapan and Vasile Lazarescu and Tiberiu Seceleanu},
title = {Efficient threads mapping on multicore architecture},
editor = {IEEE},
pages = {53--56},
month = {June},
year = {2010},
booktitle = {The 8th International Conference on Communications, COMM 2010.},
publisher = {IEEE},
url = {http://www.es.mdu.se/publications/2038-}
}