Demo: Making Lottery-based Scheduling Decisions Visible
Pages 253 - 254
Abstract
Current approaches to the problem of scheduling content onto public displays often manage stakeholder requirements by providing complex constraint-based schedules in which each item is governed by a set of playback restrictions based on time, date, context, etc. However, in most cases even once constraints have been resolved, multiple content items can remain eligible for playback. To date, little consideration has been given to this stage of the scheduling process.
We have developed a lottery-based scheduling system designed specifically for making scheduling decisions at the point at which multiple items are eligible for playback. By allocating each content item a different proportion of lottery tickets, the scheduler can balance non-restrictive requirements (e.g. preferences for new content, longer content, content from a particular source) -- a random draw then determines the next item to be shown, resulting in a probabilistic but non-deterministic schedule. In this demonstration we show the use of a lottery-scheduler as part of a deployed digital signage platform, and use a display-based visualisation to make the the ticket allocation process and drawing visible to the user.
References
[1]
Clinch, S., Davies, N., Friday, A., and Clinch, G. Yarely -- a software player for open pervasive display networks. In Proceedings of PerDis '13, ACM (2013).
[2]
Clinch, S., Davies, N., Kubitza, T., and Schmidt, A. Designing application stores for public display networks. In Proceedings of PerDis '12, ACM (2012).
[3]
Davies, N., Langheinrich, M., José, R., and Schmidt, A. Open display networks: A communications medium for the 21st century. Computer, IEEE 45, 5 (May 2012), 58--64.
[4]
Elhart, I., Langheinrich, M., Memarovic, N., and Heikkinen, T. Scheduling interactive and concurrently running applications in pervasive display networks. In Proceedings of PerDis '14, ACM (2014).
[5]
Mikusz, M., Clinch, S., and Davies, N. Are you feeling lucky?: Lottery-based scheduling for public displays. In Proceedings of PerDis'15 (2015).
[6]
Storz, O., Friday, A., and Davies, N. Supporting content scheduling on situated public displays. Computers & Graphics 30, 5 (2006), 681--691.
[7]
Waldspurger, C. A., and Weihl, W. E. Lottery scheduling: Flexible proportional-share resource management. In Proceedings of USENIX OSDI '94, USENIX Association (1994).
Index Terms
- Demo: Making Lottery-based Scheduling Decisions Visible
Recommendations
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
In this paper, we consider the problem of scheduling n deteriorating jobs with release dates on a single (batching) machine. Each job's processing time is a simple linear function of its starting time. The objective is to minimize the maximum lateness. ...
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
In this paper, we study a new primary-secondary bicriteria scheduling problem on identical machines. The primary objective is to minimize the total completion time of all jobs and the secondary objective is to minimize the maximum T-time of all machines,...
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties
Extensive research has been devoted to preemptive scheduling. However, little attention has been paid to problems where a certain time penalty must be incurred if preemption is allowed. In this paper, we consider the single-machine scheduling problem of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2015
268 pages
ISBN:9781450336086
DOI:10.1145/2757710
- General Chairs:
- Sven Gehring,
- Antonio Krüger,
- Program Chairs:
- Florian Alt,
- Nick Taylor
Copyright © 2015 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 10 June 2015
Check for updates
Qualifiers
- Demonstration
- Research
- Refereed limited
Funding Sources
Conference
PerDis '15
Sponsor:
PerDis '15: The International Symposium on Pervasive Displays
June 10 - 12, 2015
Saarbruecken, Germany
Acceptance Rates
PerDis '15 Paper Acceptance Rate 30 of 55 submissions, 55%;
Overall Acceptance Rate 213 of 384 submissions, 55%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 53Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in