Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Communication-Aware Affinity Scheduling Heuristics in Multicore Systems

  • Conference paper
  • First Online:
High Performance Computing (CARLA 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 697))

Included in the following conference series:

  • 921 Accesses

Abstract

This article presents the application of heuristic algorithms to solve the affinity scheduling problem in multicore computing systems. Affinity scheduling is a technique that allows efficient utilization of heterogeneous computing systems, by assigning a set of tasks to cores, taking into account specific efficiency and quality-of-service criteria. The heuristics proposed in this article are useful methods to solve realistic instances of the communication-aware affinity scheduling problem, which account for the different speed of communication and data transfer between tasks executing in different cores on a multicore system. The experimental analysis demonstrates that the proposed heuristics outperform the results computed using traditional scheduling techniques up to 12.3% when considering both the communication and synchronization times between tasks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley, New York (1997)

    MATH  Google Scholar 

  2. Alaniz, M., Nesmachnow, S., Goglin, B., Iturriaga, S., Gosta, V.G., Printista, M.: MBSPDiscover: an automatic benchmark for MultiBSP performance analysis. In: Hernández, G., Barrios Hernández, C.J., Díaz, G., García Garino, C., Nesmachnow, S., Pérez-Acle, T., Storti, M., Vázquez, M. (eds.) CARLA 2014. CCIS, vol. 485, pp. 158–172. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45483-1_12

    Google Scholar 

  3. Eshaghian, M.: Heterogeneous Computing. Artech House, Norwood (1996)

    Google Scholar 

  4. Goglin, B.: Managing the topology of heterogeneous cluster nodes with hardware locality (hwloc). In: High Performance Computing and Simulation, pp. 74–81 (2014)

    Google Scholar 

  5. Hamidzadeh, B., Lilja, D.: Dynamic scheduling strategies for shared-memory multiprocessors. In: International Conference on Distributed Computing Systems, pp. 208–215 (1996)

    Google Scholar 

  6. Iturriaga, S., Nesmachnow, S.: Evolutionary algorithms for affinity scheduling heuristics in heterogeneous computing systems. In: XL Latin American Computing Conference, pp. 1–12 (2014)

    Google Scholar 

  7. Leung, J., Kelly, L., Anderson, J.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)

    Google Scholar 

  8. Markatos, E., LeBlanc, T.: Using processor affinity in loop scheduling on shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 5(4), 379–400 (1994)

    Article  Google Scholar 

  9. Muneeswari, G., Shunmuganathan, K.: Agent based load balancing scheme using affinity processor scheduling for multicore architectures. WSEAS Trans. Comput. 10(8), 247–258 (2011)

    Google Scholar 

  10. Nesmachnow, S.: Computación científica de alto desempeño en la Facultad de Ingeniería, Universidad de la República. Revista de la Asociación de Ingenieros del Uruguay 61, 12–15 (2010)

    Google Scholar 

  11. Nesmachnow, S.: An overview of metaheuristics: accurate and efficient methods for optimisation. Int. J. Metahe. 3(4), 320–347 (2014)

    Article  Google Scholar 

  12. Ortiz, A., Ortega, J., Díaz, A., Prieto, A.: Affinity-based network interfaces for efficient communication on multicore architectures. J. Comput. Sci. Technol. 28(3), 508–524 (2013)

    Article  Google Scholar 

  13. Sibai, F.: Nearest neighbor affinity scheduling in heterogeneous multi-core architectures. J. Comput. Sci. Technol. 8(3), 144–150 (2008)

    Google Scholar 

  14. Squillante, M.: Affinity scheduling. In: Padua, D. (ed.) Encyclopedia of Parallel Computing, pp. 11–16. Springer, Heidelberg (2011)

    Google Scholar 

  15. Stallings, W.: Operating Systems - Internals and Design Principles. Pitman, London (2011)

    Google Scholar 

  16. Subramaniam, S., Eager, D.L.: Affinity scheduling of unbalanced workloads. In: ACM/IEEE Conference on Supercomputing, pp. 214–226 (1994)

    Google Scholar 

  17. Torrellas, J., Tucker, A., Gupta, A.: Evaluating the performance of cache-affinity scheduling in shared-memory multiprocessors. J. Parallel Distrib. Comput. 24(2), 139–151 (1995)

    Article  Google Scholar 

  18. Wang, Y., Wang, H., Chang, R.: Hierarchical loop scheduling for clustered numa machines. J. Syst. Softw. 55(1), 33–44 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Santiago Iturriaga .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Regueira, D., Iturriaga, S., Nesmachnow, S. (2017). Communication-Aware Affinity Scheduling Heuristics in Multicore Systems. In: Barrios Hernández, C., Gitler, I., Klapp, J. (eds) High Performance Computing. CARLA 2016. Communications in Computer and Information Science, vol 697. Springer, Cham. https://doi.org/10.1007/978-3-319-57972-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57972-6_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57971-9

  • Online ISBN: 978-3-319-57972-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics