uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Towards Efficient Solvers for Optimisation Problems
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
2019 (English)In: Proc. 19th International Symposium on Cluster, Cloud and Grid Computing, 2019, p. 169-172Conference paper, Published paper (Refereed)
Abstract [en]

 Constraint programming (CP) is pervasive and widely used to solve real-time problems which input data could be scaled up to the huge sizes, and the results are required to be given efficiently and dynamically. Many technologies such as CP, hybrid technologies, mixed integer programming (MIP), constraint-based local search (CBLS), boolean satisfiability (SAT) could have different solvers and backends to solve the real-time problems. Streaming videos problem is the problem that requires to decide which videos to put in which cache servers in order to minimise the waiting time for all requests with a description of cache servers, network endpoints and videos are given. In this paper, we model the streaming videos problem in two different ways. The first model is implemented using heuristics, and the global constraints are used in the second model. The experiments are benchmarked using MiniZinc, which is an open-source constraint modelling language that can be used to model constraint satisfaction and optimisation problems in the high-level, solver-independent way. The aim of the paper is to benchmark these technologies to evaluate the execution time and final scores of the two models using large instances of input data from Google Hash Code.

Place, publisher, year, edition, pages
2019. p. 169-172
Series
IEEE-ACM International Symposium on Cluster Cloud and Grid Computing
Keywords [en]
optimsation, constraint programming, modelling
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-392597DOI: 10.1109/CCGRID.2019.00030ISI: 000483058700021ISBN: 978-1-7281-0912-1 (electronic)OAI: oai:DiVA.org:uu-392597DiVA, id: diva2:1349048
Conference
19th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), May 14-17 2019, Larnaca, Cyprus
Available from: 2019-09-06 Created: 2019-09-06 Last updated: 2019-10-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Vo, Huu-Phuc

Search in DiVA

By author/editor
Vo, Huu-Phuc
By organisation
Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf