Expanding symmetric multiprocessor capability through gang scheduling | Zendy

Morris A. Jette | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Expanding symmetric multiprocessor capability through gang scheduling

Author(s) -

Morris A. Jette

Publication year - 1998

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-64825-9

DOI - 10.1007/bfb0053988

Subject(s) - computer science , multiprocessing , scheduling (production processes) , multiprocessor scheduling , cache , parallel computing , time sharing , gang scheduling , distributed computing , operating system , dynamic priority scheduling , two level scheduling , schedule , operations management , economics

Symmetric Multiprocessor (SMP) systems normally provideboth space-sharing and time-sharing to insure high system utilization andgood responsiveness. However the prevailing lack of concurrent schedulingfor parallel programs precludes SMP use in addressing many largescaleproblems. Tightly synchronized communications are impracticaland normal time-sharing reduces the benefit of cache memory. Evidencegathered at Lawrence Livermore National Laboratory (LLNL) indicatesthat gang...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research