Ignore:
Timestamp:
Aug 3, 2022, 7:14:54 AM (2 years ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
ADT, ast-experimental, master, pthread-emulation
Children:
a7d696f, c3b999d9
Parents:
3fe4acd
Message:

small wording changes to abstract

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/theses/thierry_delisle_PhD/thesis/text/front.tex

    r3fe4acd r80d16f8  
    143143The new scheduler achieves this goal by demonstrating equivalent performance to work-stealing schedulers while offering better fairness.
    144144The implementation uses several optimizations that successfully balance the cost of fairness against performance;
    145 some of these optimization rely on interesting hardware optimizations present on modern CPUs.
     145some of these optimizations rely on interesting hardware optimizations present on modern CPUs.
    146146The new scheduler also includes support for implicit nonblocking \io, allowing applications to have more user-threads blocking on \io operations than there are \glspl{kthrd}.
    147 The implementation is based on @io_uring@, a recent addition to the Linux kernel, and achieves the same performance and fairness.
     147The implementation is based on @io_uring@, a recent addition to the Linux kernel, and achieves the same performance and fairness as systems using @select@, @epoll@, \etc.
    148148To complete the scheduler, an idle sleep mechanism is implemented that significantly reduces wasted CPU cycles, which are then available outside of the application.
    149149
Note: See TracChangeset for help on using the changeset viewer.