Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

  1. Making more resource information available at higher levels of software, and letting higher level leverage that to enable better performance.
    This point is a little too vague, but maybe we can make it more concrete once our implementation is working.

...

  1. Having many more threads than we could afford in the kernel

...

  1.       ==> avoid deadlocks based on thread limitations.

...

  1.  Ability to run tasks to completion (no preemption at awkward times)

...

  1.  Fast context switches
          ==> Reuse of idle times without paying for kernel context switch
          ==> Allows us to get high throughput without giving up low latency

...

  1. Policies for relating the number of cores to logical concurrency (number of user threads)

...

  1.       - Enable us to fill in the idle time without adding extra latency

...

  1.       - Allow the application to offer concurrency that matches available cores (avoid kernel thread multiplexing)

...

  1. Effective load-balancing by using very short tasks.

...

  1. Reduced tail latency