Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Ignacio Castiñeiras"'
Publikováno v:
Proceedings of the 12th International Conference on Smart Cities and Green ICT Systems.
Publikováno v:
SSRN Electronic Journal.
Publikováno v:
ICCS
This paper presents a case study based on a real-life Employee Timetabling Problem, formulating it and then making a com- parison of its modeling and solution with three different programming paradigms embedding Finite Domain constraint solving: Cons
Autor:
Ignacio Castiñeiras, Barry O'Sullivan, Robert Birke, Thomas Scherer, Lydia Y. Chen, Deepak Mehta, Diarmuid Grimes
Publikováno v:
MASCOTS
Energy consumption in data centres accounts for a significant proportion of national energy usage in many countries. One approach for reducing energy consumption is to improve the server usage efficiency via workload consolidation. However, there are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::474c258bdbc8596fdfcd1b2f3f46be25
https://hdl.handle.net/2318/1893123
https://hdl.handle.net/2318/1893123
Publikováno v:
UCC
The power consumption of a data centre (DC) can be attributed to the power consumed by running the servers and the power consumed for cooling them. The challenge is to optimally balance IT and cooling power requirements, which demands the minimisatio
Publikováno v:
CLOUDNET
In this paper we present a Mixed Integer Programming-based (MIP) approach to optimise the workload allocation of geographically distributed Data Centres (DCs) in the face of dynamic DC performances and electricity prices. We reduce the overall electr
Publikováno v:
CCGRID
The power consumption of a data centre (DC) can be attributed to the power consumed for running the servers and to the computer room air conditioner (CRAC) power for cooling them. The challenge is to distribute the load among servers, controlling the
The CFLP system TOY(FD) is implemented in SICStus Prolog, and supports FD constraints by interfacing the CP(FD) solvers of Gecode and ILOG Solver. In this paper TOY(FD) is extended with new search primitives, in a setting easily adaptable to other Pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0276f7dcc7ce86d65c4e230d4475547
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642335570
CP
CP
Bin packing is a ubiquitous problem that arises in many practical applications. The motivation for the work presented here comes from the domain of data centre optimisation. In this paper we present a parameterisable benchmark generator for bin packi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73650e4836ed9aa20feb8b688282eba1
https://doi.org/10.1007/978-3-642-33558-7_17
https://doi.org/10.1007/978-3-642-33558-7_17
Publikováno v:
Functional and Logic Programming ISBN: 9783642298219
FLOPS
FLOPS
Constraint Functional Logic Programming (CFLP) integrates lazy narrowing with constraint solving. It provides a high modeling abstraction, but its solving performance can be penalized by lazy narrowing and solver interface surcharges. As for real-wor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9e3edc7e03bd8a85c54183aec6a7f2d
https://doi.org/10.1007/978-3-642-29822-6_10
https://doi.org/10.1007/978-3-642-29822-6_10