Volume

Dagstuhl Seminar Proceedings, Volume 8071

Publication Details

  • published at: 2008-05-07
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
DOI: 10.4230/DagSemProc.08071.1
08071 Abstracts Collection – Scheduling

Authors: Jane W. S. Liu, Rolf H. Möhring, and Kirk Pruhs

Abstract
From 10.02. to 15.02., the Dagstuhl Seminar 08071 ``Scheduling'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Jane W. S. Liu, Rolf H. Möhring, and Kirk Pruhs. 08071 Abstracts Collection – Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 8071, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{liu_et_al:DagSemProc.08071.1,
  author =	{Liu, Jane W. S. and M\"{o}hring, Rolf H. and Pruhs, Kirk},
  title =	{{08071 Abstracts Collection – Scheduling}},
  booktitle =	{Scheduling},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8071},
  editor =	{Jane W. S. Liu and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08071.1},
  URN =		{urn:nbn:de:0030-drops-14897},
  doi =		{10.4230/DagSemProc.08071.1},
  annote =	{Keywords: Scheduling, real-time, supply chain}
}
Document
DOI: 10.4230/DagSemProc.08071.2
08071 Executive Summary – Scheduling

Authors: Jane W. S. Liu, Rolf H. Möhring, and Kirk Pruhs

Abstract
Scheduling is a form of decision making that involves allocating scarce resources to achieve some objective. The study of scheduling dates back to at least the 1950’s when operations research researchers studied problems of managing activities in a workshop. Computer systems researchers started studying scheduling in the 1960’s in the development of operating systems and time-critical applications.
Cite as

Jane W. S. Liu, Rolf H. Möhring, and Kirk Pruhs. 08071 Executive Summary – Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 8071, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{liu_et_al:DagSemProc.08071.2,
  author =	{Liu, Jane W. S. and M\"{o}hring, Rolf H. and Pruhs, Kirk},
  title =	{{08071 Executive Summary – Scheduling}},
  booktitle =	{Scheduling},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8071},
  editor =	{Jane W. S. Liu and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08071.2},
  URN =		{urn:nbn:de:0030-drops-14871},
  doi =		{10.4230/DagSemProc.08071.2},
  annote =	{Keywords: Scheduling, real-time, supply chain}
}
Document
DOI: 10.4230/DagSemProc.08071.3
Challenges for Multi-function SoC Scheduling and Assistive Living Services

Authors: Chi-Sheng Shih

Abstract
Tasks on assistive living devices and multi-function SoC (MFSoC) have the requirements to meet certian timing constraint. Examples include the end-to-end throughput constraint on MFSoC and deadline constraint on assistive living devices. However, the workload model on the two application domains are different from conventional real-time workload models. The new workload model, hence, impose new scheduling challenges on real-time computing community. In this short paper, we will discuss the new workload models and the challenging issues on scheduling such tasks.
Cite as

Chi-Sheng Shih. Challenges for Multi-function SoC Scheduling and Assistive Living Services. In Scheduling. Dagstuhl Seminar Proceedings, Volume 8071, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{shih:DagSemProc.08071.3,
  author =	{Shih, Chi-Sheng},
  title =	{{Challenges for Multi-function SoC Scheduling and Assistive Living Services}},
  booktitle =	{Scheduling},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8071},
  editor =	{Jane W. S. Liu and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08071.3},
  URN =		{urn:nbn:de:0030-drops-14866},
  doi =		{10.4230/DagSemProc.08071.3},
  annote =	{Keywords: Real-time Task Scheduling}
}
Document
DOI: 10.4230/DagSemProc.08071.4
Uniprocessor EDF Feasibility is an Integer Problem

Authors: Enrico Bini

Abstract
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed by deadlines) are verified or not. However, in many design scenarios the task set is only partially known and these algorithms cannot be applied because they require the complete knowledge of all the parameters of the task set. Moreover, very often the designer has the freedom to select some of the task set parameters in order to maximize the system performance, and an arbitrary selection of the free parameters can lead either to poor performance or to a constraint violation. It is then useful to describe the feasibility region of the task set parameters by equations instead of by algorithms, so that optimization algorithms can be applied to find the best assignment to the free variables. In this paper we formulate the EDF schedulability on a single processor through a combination of linear constraints. We study the geometry of the feasibility region of task deadlines when computation times and periods are known.
Cite as

Enrico Bini. Uniprocessor EDF Feasibility is an Integer Problem. In Scheduling. Dagstuhl Seminar Proceedings, Volume 8071, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{bini:DagSemProc.08071.4,
  author =	{Bini, Enrico},
  title =	{{Uniprocessor EDF Feasibility is an Integer Problem}},
  booktitle =	{Scheduling},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8071},
  editor =	{Jane W. S. Liu and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08071.4},
  URN =		{urn:nbn:de:0030-drops-14880},
  doi =		{10.4230/DagSemProc.08071.4},
  annote =	{Keywords: EDF schedulability condition, optimal deadline assignment}
}

Filters

  • Authors
  • B
  • Bini, Enrico
  • L
  • Liu, Jane W. S.
  • M
  • Möhring, Rolf H.
  • P
  • Pruhs, Kirk
  • S
  • Shih, Chi-Sheng

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact