• DocumentCode
    3147274
  • Title

    Memory-Aware Algorithms and Scheduling Techniques: From Multicore Processors to Petascale Supercomputers

  • Author

    Jacquelin, Mathias

  • Author_Institution
    LIP, Ecole Normale Super. de Lyon, Lyon, France
  • fYear
    2011
  • fDate
    16-20 May 2011
  • Firstpage
    2038
  • Lastpage
    2041
  • Abstract
    This paper presents several memory-aware algorithms whose design is optimized for different target platforms. Complex memory architectures have spread in a wide range of systems, from multicore processors within cell phones to supercomputers. This trend enlightens the need to deal with heterogeneity and non uniform memory accesses. As the memory wall is closing in, taking memory architecture into consideration has become fundamental for large-scale platforms. Designing algorithms and scheduling tasks on such heterogeneous platforms is a challenging task. We present several results in that area as well as future research plans.
  • Keywords
    memory architecture; multiprocessing systems; parallel machines; scheduling; cell phones; memory architecture; memory-aware algorithm; multicore processors; nonuniform memory access; petascale supercomputers; scheduling; Algorithm design and analysis; Memory management; Multicore processing; Processor scheduling; Program processors; Sparse matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on
  • Conference_Location
    Shanghai
  • ISSN
    1530-2075
  • Print_ISBN
    978-1-61284-425-1
  • Electronic_ISBN
    1530-2075
  • Type

    conf

  • DOI
    10.1109/IPDPS.2011.371
  • Filename
    6009084