CellSs : Scheduling techniques to better exploit memory hierarchy

ABSTRACT: Cell Superscalar’s (CellSs) main goal is to provide a simple, flexible and easy programming approach for the Cell Broadband Engine (Cell/B.E.) that automatically exploits the inherent concurrency of the applications at a task level. The CellSs environment is based on a source-to-source compiler that translates annotated C or Fortran code and a runtime library tailored for the Cell/B.E. that takes care of the concurrent execution of the application. The first efforts for task scheduling in CellSs derived from very simple heuristics. This paper presents new scheduling techniques that have been developed for CellSs for the purpose of improving an application’s performance. Additionally, the design of a new scheduling algorithm is detailed and the algorithm evaluated. The CellSs scheduler takes an extension of the memory hierarchy for Cell/B.E. into account, with a cache memory shared between the SPEs. All new scheduling practices have been evaluated showing better behavior of our system.

• Autores: Perez, Josep; Cabarcas Jaramillo, Felipe; Ramírez, Alex; Badía, Rosa Maria; Labarta, Jesús
• Tipo de recurso: Article of investigation
• Fecha de publicación: 2009
• Institución: Universidad de Antioquia
• Repositorio: Repositorio UdeA
• Idioma: eng
• OAI Identifier: oai:bibliotecadigital.udea.edu.co:10495/8155
• Acceso en línea: http://hdl.handle.net/10495/8155
• Palabra clave: Programación simple; Programación de tareas
• Rights: openAccess
• License: https://creativecommons.org/licenses/by/4.0/