<div class="csl-bib-body">
<div class="csl-entry">Hunold, S., & Przybylski, B. (2022, May 18). <i>Scheduling.jl - Collaborative and Reproducible Scheduling Research with Julia</i> [Conference Presentation]. New Challenges in Scheduling Theory (Centre CNRS “Paul-Langevin”, Aussois, France), Aussois, France. http://hdl.handle.net/20.500.12708/153814</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/153814
-
dc.description.abstract
We introduce Scheduling.jl, which is a toolkit for teaching the basics of scheduling theory to Computer Science students. In particular, our course focuses on scheduling algorithms for parallel, identical machines. For these types of problems, several approximation algorithms and approximation schemes exist. We believe that students better understand advantages as well as disadvantages of these approximation algorithms when they investigate their implementations and examine how the algorithms work in practice. For that purpose, we have implemented a set of heuristics and approximation algorithms on top of Scheduling.jl. In this talk, we will go through some of the implemented algorithms in Scheduling.jl and explain why we are convinced that these algorithms are particularly helpful for CS students to understand the basic concepts of approximation algorithms. In our experience, students remembered algorithmic details much better when we had shown them examples using Scheduling.jl.
en
dc.language.iso
en
-
dc.subject
Scheduling Research with Julia
en
dc.subject
Scheduling.jl
en
dc.subject
scheduling theory
en
dc.title
Scheduling.jl - Collaborative and Reproducible Scheduling Research with Julia
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.contributor.affiliation
Adam Mickiewicz University in Poznań, Poland
-
dc.type.category
Conference Presentation
-
tuw.publication.invited
invited
-
tuw.researchTopic.id
I2
-
tuw.researchTopic.id
C5
-
tuw.researchTopic.name
Computer Engineering and Software-Intensive Systems
-
tuw.researchTopic.name
Computer Science Foundations
-
tuw.researchTopic.value
90
-
tuw.researchTopic.value
10
-
tuw.publication.orgunit
E191-04 - Forschungsbereich Parallel Computing
-
tuw.author.orcid
0000-0001-8283-7872
-
tuw.event.name
New Challenges in Scheduling Theory (Centre CNRS "Paul-Langevin", Aussois, France)
