Node-Local Enforcement During Distributed Gang Scheduling

Gang scheduling is a scheduling scheme today known for incorporating time-
sharing, space-sharing and inter-process communication. To enable efficient
scheduling on large clusters, distributed gang scheduling introduces logical and
physical separation of the scheduler.
My defense covers the basic concepts of (distributed) gang scheduling and
why node-local enforcement – enforcing a given schedule on a single node –
has been made topic of the Bachelor’s thesis. I will shortly explain how the
implementation works, dealing with each scheduling method. I will end the
presentation with the measurements I took, the results of these measurements
and a conclusion of my work.
Thereafter, a discussion and Q&A session will take place. The presentation is
held in English. Questions can be asked in German.

(Bachelor defense)