检索结果-内蒙古大学图书馆

CoMe4ACloud: An end-to-end framework for autonomic Cloud systems

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 86卷 339-354页

作者： Al-Shara, Zakarea Alvares, Frederico Bruneliere, Hugo Lejeune, Jonathan Prud'Homme, Charles Ledoux, Thomas IMT Atlantique INRIA LS2N 4 Rue Alfred Kastler F-44307 Nantes France Sorbonne Univ INRIA CNRS 4 Pl Jussieu F-75005 Paris France

Autonomic Computing has largely contributed to the development of self-manageable Cloud services. It notably allows freeing Cloud administrators of the burden of manually managing varying-demand services, while still enforcing Service-Level Agreements (SLAB). All Cloud artifacts, regardless of the layer carrying them, share many common characteristics. Thus, it should be possible to specify, (re)configure and monitor any XaaS (Anything-as-a-Service) layer in an homogeneous way. To this end, the CoMe4ACIoud approach proposes a generic model-based architecture for autonomic management of Cloud systems. We derive a generic unique Autonomic Manager (AM) capable of managing any Cloud service, regardless of the layer. This AM is based on a constraint solver which aims at finding the optimal configuration for the modeled XaaS, i.e. the best balance between costs and revenues while meeting the constraints established by the SLA. We evaluate our approach in two different ways. Firstly, we analyze qualitatively the impact of the AM behavior on the system configuration when a given series of events occurs. We show that the AM takes decisions in less than 10 s for several hundred nodes simulating virtual/physical machines. Secondly, we demonstrate the feasibility of the integration with real Cloud systems, such as Openstack, while still remaining generic. Finally, we discuss our approach according to the current state-of-the-art. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Cloud Computing Autonomic Computing Model Driven Engineering constraint programming

来源：评论

学校读者我要写书评

暂无评论

Collaborative duty rostering in health care professions

引用

OPERATIONS RESEARCH FOR HEALTH CARE 2020年 27卷

作者： Heydrich, Sandy Schroeder, Rasmus Velten, Sebastian Fraunhofer Inst Techno & Wirtschaftsmath ITWM Kaiserslautern Germany

For nurses the duty roster and its reliability has a significant impact on the compatibility of work and private life. In the research project GamOR (Game of Roster) ergonomists, designers and mathematicians cooperated with application partners to address this issue and developed a novel collaborative planning process for creating duty rosters. The collaborative planning process consists of two parts. On the one hand, employees are informed about conflicts among their wishes for free time and are encouraged to solve these conflicts within the team. On the other hand, decision makers are supported in the creation of the final roster. In this paper we present constraint programming (CP) approaches to support both of these parts. Based on a set of CP model components, which model for example staff requirements and legal regulations, we introduce a domain driven algorithm for detecting conflicts of wishes and argue that it outperforms approaches known from the literature. Moreover, we develop a backtracking search for generating complete rosters. This is done by appropriate variable and value selection strategies reflecting the objectives - balanced work time accounts, alternating free weekends, lengths of shift sequences (total and with the same shift definition) and forward rotation. The presented approach was introduced for testing in various institutions and has been positively evaluated by both nurses and decision makers. Nurses particularly appreciate the transparency and timely feedback of conflicts. For decision makers, the time saved when creating the duty roster is a great benefit. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Nurse rostering constraint programming Conflict detection Constructive heuristic Case study

来源：评论

学校读者我要写书评

暂无评论

A Novel Strategy of Combining Variable Ordering Heuristics for constraint Satisfaction Problems

引用

IEEE ACCESS 2018年 6卷 42750-42756页

作者： Li, Hongbo Li, Zhanshan Northeast Normal Univ Sch Informat Sci & Technol Changchun 130117 Jilin Peoples R China Jilin Univ Natl Educ Minist Coll Comp Sci & Technol Key Lab Symbol Computat & Knowledge Engn Changchun 130012 Jilin Peoples R China

Variable ordering heuristic plays a central role in solving constraint satisfaction problems. Many heuristics have been proposed and well-studied. In order to take advantage of the fact that many generic variable ordering heuristics work well for different problems, we propose a novel method in this paper, namely ParetoHeu, to combine variable ordering heuristics. At each node of the search tree, a set of candidate variables is generated by a new strategy based on Pareto optimality and a variable is selected from the set randomly. The method is easy to be implemented in constraint solvers. The experiments on various benchmark problems show that ParetoHeu is more efficient than both the participant heuristics which are popular in constraint solvers. It is also more robust than some classical strategies which have been used to combine variable ordering heuristics.

关键词： constraint programming constraint satisfaction problem Pareto optimality variable ordering heuristic

来源：评论

学校读者我要写书评

暂无评论

Minimization of rest mismatches in round robin tournaments

引用

COMPUTERS & OPERATIONS RESEARCH 2018年 99卷 78-89页

作者： Atan, Tankut Cavdaroglu, Burak Isik Univ Dept Ind Engn TR-34980 Istanbul Turkey Kadir Has Univ Dept Ind Engn TR-34083 Istanbul Turkey

In sports tournaments, an occurrence of a difference in the rest periods of opponent teams in a game, which we refer to as a rest mismatch, will disadvantage the less rested team. Thus, it is only fair to expect opposing teams to have rested equally before their game. In this work, we introduce and study the Rest Mismatch Problem where the goal is to minimize the number of rest mismatches in a round robin tournament. Two integer linear formulations and a constraint programming formulation are provided, and their computational performances are compared for several problem instances. Moreover, a heuristic algorithm is developed which finds a single round robin schedule with zero mismatches when the number of teams in the tournament is a multiple of 8, and four mismatches when it is a multiple of 4 but not 8. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Round robin scheduling League fairness Rest mismatch Mixed-integer linear programming constraint programming Near optimal solution

来源：评论

学校读者我要写书评

暂无评论

Static Mapping of Applications on Heterogeneous Multi-Core Platforms Combining Logic-Based Benders Decomposition with Integer Linear programming

引用

ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS 2018年第2期23卷 1–24页

作者： Emeretlis, Andreas Theodoridis, George Alefragis, Panayiotis Voros, Nikolaos Univ Patras VLSI Design Lab Dept Elect & Comp Engn Rion 26504 Greece Technol Educ Inst Western Greece Embedded Syst Design & Applicat Lab Comp & Informat Engn Dept Antirrio 30020 Greece

The proper mapping of an application on a multi-core platform and the scheduling of its tasks are key elements to achieve the maximum performance. In this article, a novel hybrid approach based on integrating the Logic-Based Benders Decomposition (LBBD) principle with a pure Integer Linear programming (ILP) model is introduced for mapping applications described by Directed Acyclic Graphs (DAGs) on platforms consisting of heterogeneous cores. The LBBD approach combines two optimization techniques with complementary strengths, namely ILP and constraint programming (CP), and is employed as a cut generation scheme. The generated constraints are utilized by the ILP model to cut possible assignment combinations aiming at improving the solution or proving the optimality of the best-found one. The introduced approach was applied both on synthetic DAGs and on DAGs derived from real applications. Through the proposed approach, many problems were optimally solved that could not be solved by any of the above methods (ILP, LBBD) alone within a time limit of 2 hours, while the overall solution time was also significantly decreased. Specifically, the hybrid method exhibited speedups equal to 4.2 x for the synthetic instances and 10 x for the real-application DAGs over the LBBD approach and two orders of magnitude over the ILP model.

关键词： Task scheduling multi-core embedded platforms integer linear programming constraint programming Benders decomposition

来源：评论

学校读者我要写书评

暂无评论

Algorithms for the unrelated parallel machine scheduling problem with a resource constraint

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2018年第3期271卷 839-848页

作者： Fleszar, Krzysztof Hindi, Khalil S. AUB Suliman S Olayan Sch Business OSB POB 11-0236 Beirut 11072020 Lebanon

We consider the unrelated parallel machine scheduling problem with a renewable resource constraint (UPMR). For the two-machine variant of the problem, we propose a very efficient mixed-integer linear programming (MILP) model. For more than two machines, we propose a two-stage heuristic, which first uses a MILP model to calculate a lower bound and assign jobs to machines, and then uses a constraint programming (CP) model to schedule jobs on machines. If the solution of the two-stage heuristic is not proven optimal, the problem is solved using a CP model for the complete UPMR, with a hot start provided by the two-stage heuristic. New large benchmark problem instances with up to 1000 jobs are generated. Extensive computational experiments are carried out on these, as well as on smaller instances from the literature. Our algorithms obtain excellent solutions for much larger problem instances than previously proposed methods. For the UPMR with two machines, our MILP model solves all test instances to optimality in very modest computation times, greatly outperforming previously proposed methods. For the variant with more than two machines, our overall algorithm, which combines the two-stage heuristic with a full CP model, finds for the smaller instances from the literature better than or the same solutions as all previously proposed methods in considerably less computation time. Difficult types of problem instances are also identified for future research. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Scheduling Unrelated parallel machines Renewable resource Mixed-integer linear programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

A review of literature on parallel constraint solving

引用

THEORY AND PRACTICE OF LOGIC programming 2018年第5-6期18卷 725-758页

作者： Gent, Ian P. Miguel, Ian Nightingale, Peter Mccreesh, Ciaran Prosser, Patrick Moore, Neil C. A. Unsworth, Chris Univ St Andrews Sch Comp Sci St Andrews KY16 9SX Fife Scotland Univ Glasgow Sch Comp Sci Glasgow G12 8RZ Lanark Scotland Adobe Syst Inc Edinburgh Midlothian Scotland

As multi-core computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation;whether to use shared memory or distributed computation;whether to use static or dynamic decomposition;and how to best exploit portfolios and cooperating search. We review the literature, and see that we can sometimes do quite well, some of the time, on some instances, but we are far from a general solution. Yet there seems to be little overall guidance that can be given on how best to exploit multi-core computers to speed up constraint solving. We hope at least that this survey will provide useful pointers to future researchers wishing to correct this situation.

关键词： constraint programming parallel computing propositional satisfiability parallel search

来源：评论

学校读者我要写书评

暂无评论

Intruder alert! Optimization models for solving the mobile robot graph-clear problem

引用

constraintS 2018年第3期23卷 335-354页

作者： Morin, Michael Castro, Margarita P. Booth, Kyle E. C. Tran, Tony T. Liu, Chang Beck, J. Christopher Univ Laval Dept Operat & Decis Support Syst Quebec City PQ Canada Univ Toronto Dept Mech & Ind Engn Toronto ON Canada

We develop optimization approaches to the graph-clear problem, a pursuit-evasion problem where mobile robots must clear a facility of intruders. The objective is to minimize the number of robots required. We contribute new formal results on progressive and contiguous assumptions and their impact on algorithm completeness. We present mixed-integer linear programming and constraint programming models, as well as new heuristic variants for the problem, comparing them to previously proposed heuristics. Our empirical work indicates that our heuristic variants improve on those from the literature, that constraint programming finds better solutions than the heuristics in run-times reasonable for the application, and that mixed-integer linear programming is superior for proving optimality. Given their performance and the appeal of the model-and-solve framework, we conclude that the proposed optimization methods are currently the most suitable for the graph-clear problem.

关键词： Pursuit-evasion Graph-clear problem constraint programming Mixed-integer linear programming Optimization Mobile robotics

来源：评论

学校读者我要写书评

暂无评论

On-line fault diagnosis of FMS based on flows analysis

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2018年第8期29卷 1891-1904页

作者： Fakhfakh, Olfa Toguyeni, Armand Korbaa, Ouajdi Ecole Natl Sci Informat MARS Res Unit Campus Univ Manouba Manouba 2010 Tunisia Ecole Cent Lille CRIStAL UMR 9189 F-59650 Villeneuve Dascq France ISITCom Hammam Sousse MARS Res Unit GP1 Hammam Sousse 4011 Sousse Tunisia

Any flexible manufacturing system (FMS) may face fault which may disrupt the production and cause delays. Thus, the identification of the source of failure is very important to intervene rapidly. This paper aims to develop an indirect and incremental diagnostic approach to identify the root cause of the observed delay in the context of a single fault occurrence. In this study the observation is done only at the output of the system to measure the output dates of each part and to detect the eventual delay. For this purpose, a mathematical model is developed to model the proposed diagnostic approach of FMS under cyclic scheduling. This cyclic approach provides intermediary reference points to detect any discrepancy with regard the predictive scheduling. These intermediary reference points correspond to the end of each cycle defined by the scheduling. To solve this problem, the constraint programming technique is used. Finally, the performance of the proposed approach is evaluated with respect to the literature. The major merit of this study is to prove the capacity to diagnose efficiently the progressive faults of a plant without the necessity to add sensors dedicated to its monitoring.

关键词： On-line fault diagnosis Indirect diagnosis Flexible manufacturing system Cyclic scheduling constraint programming

来源：评论

学校读者我要写书评

暂无评论

Robust routing in deterministic delay-tolerant networks

引用

COMPUTERS & OPERATIONS RESEARCH 2018年 92卷 77-86页

作者： Bocquillon, Ronan Jouglet, Antoine Univ Technol Compiegne Sorbonne Univ UMR CNRS Heudiasyc 7253 Ctr Rech Royallieu CS 60319 F-60203 Compiegne France Univ Tours LI EA 6300 ROOT ERL CNRS 6305 64 Av Jean Portalis F-37200 Tours France

A system of systems is a set of heterogeneous independent systems that share data in pursuit of a common goal. These systems form a delay-/disruption-tolerant network (DTN), where routing is based on the store-carry-and-forward paradigm. Systems can communicate whenever they are close enough to each other, in what are called contacts. We assume that the movements of these systems may be predicted in advance and we consider that a sequence of contacts is given at the outset. During a contact, a given emitting system can transfer to a given receiving system a fixed amount of data (termed datum unit) that it has in its possession. The dissemination problem is to find a transfer plan such that all the data can be transferred from a given subset of source systems to a given subset of recipient systems. In this paper we study the problem where communications may fail. We propose an algorithm for finding a robust transfer plan that minimizes the dissemination length. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Combinatorial optimization Robust optimization constraint programming Delay- and disruption-tolerant networks Store-carry-and-forward routing Systems of systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：