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

constraint programming Approach to Reconfigurable Processor Extension Generation and Application Compilation

ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS 2012年第2期5卷 1–38页

作者： Martin, Kevin Wolinski, Christophe Kuchcinski, Krzysztof Floch, Antoine Charot, Francois Lund Univ Dept Comp Sci S-22100 Lund Sweden Univ Rennes 1 IRISA F-35014 Rennes France INRIA Rennes France

In this article, we present a constraint programming approach for solving hard design problems present when automatically designing specialized processor extensions. Specifically, we discuss our approach for automatic selection and synthesis of processor extensions as well as efficient application compilation for these newly generated extensions. The discussed approach is implemented in our integrated design framework, IFPEC, built using constraint programming (CP). In our framework, custom instructions, implemented as processor extensions, are defined as computational patterns and represented as graphs. This, along with the graph representation of an application, provides a way to use our CP framework equipped with subgraph isomorphism and connected component constraints for identification of processor extensions as well as their selection, application scheduling, binding, and routing. All design steps assume architectures composed of runtime reconfigurable cells, implementing selected extensions, tightly connected to a processor. An advantage of our approach is the possibility of combining different heterogeneous constraints to represent and solve all our design problems. Moreover, the flexibility and expressiveness of the CP framework makes it possible to solve simultaneously extension selection, application scheduling, and binding and improve the quality of the generated results. The article is largely illustrated with experimental results.

关键词： Design Experimentation Reconfigurable architectures resource assignment scheduling system-level synthesis constraint programming

来源：评论

学校读者我要写书评

暂无评论

An adaptive prefix-assignment technique for symmetry reduction

引用

JOURNAL OF SYMBOLIC COMPUTATION 2020年 99卷 21-49页

作者： Junttila, Tommi Karppa, Matti Kaski, Petteri Kohonen, Jukka Aalto Univ Dept Comp Sci Espoo Finland

This paper presents a technique for symmetry, reduction that adaptively assigns a prefix of variables in a system of constraints so that the generated prefix-assignments are pairwise nonisomorphic under the action of the symmetry group of the system. The technique is based on McKay's canonical extension framework (McKay, 1998). Among key features of the technique are (i) adaptability-the prefix sequence can be user-prescribed and truncated for compatibility with the group of symmetries;(ii) parallelizability prefix-assignments can be processed in parallel independently of each other;(iii) versatility-the method is applicable whenever the group of symmetries can be concisely represented as the automorphism group of a vertex-colored graph;and (iv) implementability-the method can be implemented relying on a canonical labeling map for vertex-colored graphs as the only nontrivial subroutine. To demonstrate the practical applicability of our technique, we have prepared an experimental open-source implementation of the technique and carry out a set of experiments that demonstrate ability to reduce symmetry on hard instances. Furthermore, we demonstrate that the implementation effectively parallelizes to compute clusters with multiple nodes via a message-passing interface. (C) 2019 The Authors. Published by Elsevier Ltd.

关键词： Symmetry breaking Symmetry reduction Isomorph rejection constraint programming SAT Canonical extension

来源：评论

学校读者我要写书评

暂无评论

Resource-Constrained Project Scheduling Problem under Multiple Time constraints

引用

JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT 2021年第2期147卷

作者： Kong, Feng Dou, Dong North China Elect Power Univ Dept Econ Management Baoding 071003 Hebei Peoples R China

This paper introduces a new practical scheduling problem called the resource-constrained project scheduling problem under multiple time constraints, which involves a duration constraint of activity, temporal constraint, and resource calendar constraint. The duration constraint of the activity exists widely in real-life projects, and it is first proposed as a resource-constrained project scheduling problem in this paper. We prove the defects of the traditional temporal constraint and improve it. The new problem combines three types of time constraints for the first time, which makes it closer to the actual scheduling problem. We developed a constraint programming optimization model for the new problem and used the IBM ILOG CPLEX-CP version 12.9.0 optimizer to solve it. Computational experiments are carried out to show that the CP optimizer is fast and provides a near-optimum solution to the new problem for projects with hundreds of activities within minutes compared to other metaheuristic methods. The results reported in this paper can be used as a benchmark for other researchers to compare and improve. The new problem contributes to developing a practical decision support system for resolving real-life constraints in projects.

关键词： Project scheduling Resource-constrained project scheduling problem Multiple time constraints CPLEX constraint programming

来源：评论

学校读者我要写书评

暂无评论

Reducing the configuration overhead of the distributed two-level control system 22

Reducing the configuration overhead of the distributed two-l...

引用

Proceedings of the 2022 Conference & Exhibition on Design, Automation & Test in Europe

作者： Yu Yang Dimitrios Stathis Ahmed Hemani KTH Royal Institute of Technology Stockholm Sweden

ISBN: (纸本)9783981926361

With the growing demand for more efficient hardware accelerators for streaming applications, a novel Coarse-Grained Reconfigurable Architecture (CGRA) that uses a Distributed Two-Level Control (D2LC) system has been proposed in the literature. Even though the highly distributed and parallel structure makes it fast and energy-efficient, the single-issue instruction channel between the level-1 and level-2 controller in each D2LC cell becomes the bottleneck of its performance. In this paper, we improve its design to mimic a multi-issued architecture by inserting shadow instruction buffers between the level-1 and level-2 controllers. Together with a zero-overhead hardware loop, the improved D2LC architecture can enable efficient overlap between loop iterations. We also propose a complete constraint programming based instruction scheduling algorithm to support the above hardware features. The experiment result shows that the improved D2LC architecture can achieve up to 25% of reduction on the instruction execution cycles and 35% reduction on the energy-delay product.

关键词： CGRA loop acceleration instruction scheduling two-level control constraint programming

来源：评论

学校读者我要写书评

暂无评论

Modular constraint Solver Cooperation via Abstract Interpretation

引用

THEORY AND PRACTICE OF LOGIC programming 2020年第6期20卷 848-863页

作者： TALBOT, P. I. E. R. R. E. MONFROY, E. R. I. C. TRUCHET, C. H. A. R. L. O. T. T. E. Univ Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust SNT Esch Sur Alzette Luxembourg Univ Angers Angers France Univ Nantes Nantes France

Cooperation among constraint solvers is difficult because different solving paradigms have different theoretical foundations. Recent works have shown that abstract interpretation can provide a unifying theory for various constraint solvers. In particular, it relies on abstract domains which capture constraint languages as ordered structures. The key insight of this paper is viewing cooperation schemes as abstract domains combinations. We propose a modular framework in which solvers and cooperation schemes can be seamlessly added and combined. This differs from existing approaches such as SMT where the cooperation scheme is usually fixed (e.g., Nelson-Oppen). We contribute to two new cooperation schemes: (i)interval propagators completionthat allows abstract domains to exchange bound constraints, and (ii)delayed productwhich exchanges over-approximations of constraints between two abstract domains. Moreover, the delayed product is based on delayed goal of logic programming, and it shows that abstract domains can also capture control aspects of constraint solving. Finally, to achieve modularity, we propose theshared productto combine abstract domains and cooperation schemes. Our approach has been fully implemented, and we provide various examples on the flexible job shop scheduling problem.

关键词： abstract domains solver cooperation modularity constraint programming

来源：评论

学校读者我要写书评

暂无评论

A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context

引用

COMPUTERS & OPERATIONS RESEARCH 2021年 132卷

作者： Zhang, Sicheng Tang, Fangcheng Li, Xiang Liu, Jiaming Zhang, Bowen Beijing Univ Chem Technol Sch Econ & Management 15 N 3rd Ring Rd E Beijing 100029 Peoples R China

With the advent of industry-4.0 era, industrial production are evolving towards high flexibility, diversity, customisation, and dynamism. We address a realistic scenario of a smart manufacturing system, which concerns the production scheduling of complex multi-level products under a dynamic flexible job shop environment with shop floor disruptions incorporated. The products are assembled from multiple basic parts, whose fabrication processes are highly flexible, involving alternative process plans, alternative machines and alternative processing sequences of operations. We aim at providing Pareto solutions, with consideration of three typical optimisation objectives, including makespan, maximum machine workload, and total tardiness. A hybrid MPGA-CP approach is designed for the problem. To the best our knowledge, this is the first attempt to embed an exact optimisation technique into a meta-heuristic algorithm in the domain of production scheduling. Compared with other alternative approaches, its efficiency and performance are proven to be outstanding in solving medium-to-large scale problems, covering the largest proportion of Pareto solutions among all tested approaches. Furthermore, we constructed a simulation model of a real-time production scheduling control system, in which our approach is embedded as the kernel algorithm, to study the impacts of some uncertainties that are concerned in practice. Based on the results of simulation experiments and sensitivity analysis, meaningful managerial insights have been provided.

关键词： Integrated processing planning and assembly scheduling Dynamic production scheduling Multi-objective optimisation Genetic algorithm constraint programming

来源：评论

学校读者我要写书评

暂无评论

Modular constraint Solver Cooperation via Abstract Interpretation

Modular Constraint Solver Cooperation via Abstract Interpret...

引用

36th International Conference on Logic programming (ICLP)

关键词： abstract domains solver cooperation modularity constraint programming

来源：评论

学校读者我要写书评

暂无评论

constraint programming for stochastic inventory systems under shortage cost

引用

ANNALS OF OPERATIONS RESEARCH 2012年第1期195卷 49-71页

作者： Rossi, Roberto Tarim, S. Armagan Hnich, Brahim Prestwich, Steven Wageningen UR Wageningen Netherlands Hacettepe Univ Dept Management Ankara Turkey Izmir Univ Econ Fac Comp Sci Izmir Turkey Natl Univ Ireland Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland

One of the most important policies adopted in inventory control is the replenishment cycle policy. Such a policy provides an effective means of damping planning instability and coping with demand uncertainty. In this paper we develop a constraint programming approach able to compute optimal replenishment cycle policy parameters under non-stationary stochastic demand, ordering, holding and shortage costs. We show how in our model it is possible to exploit the convexity of the cost-function during the search to dynamically compute bounds and perform cost-based filtering. Our computational experience show the effectiveness of our approach. Furthermore, we use the optimal solutions to analyze the quality of the solutions provided by an existing approximate mixed integer programming approach that exploits a piecewise linear approximation for the cost function.

关键词： Inventory control constraint programming Decision making under uncertainty Replenishment cycle policy Non-stationary demand Shortage cost

来源：评论

学校读者我要写书评

暂无评论

Scheduling of Operations in Quantum Compiler

Scheduling of Operations in Quantum Compiler

引用

IEEE International Conference on Quantum Computing and Engineering (QCE)

作者： Itoko, Toshinari Imamichi, Takashi IBM Res Tokyo IBM Quantum Tokyo Japan

ISBN: (纸本)9781728189697

When scheduling quantum operations, a shorter overall execution time of the resulting schedule yields a better throughput and higher fidelity output. In this paper, we demonstrate that quantum operation scheduling can be interpreted as a special type of job-shop problem. On this basis, we provide its formulation as constraint programming while taking into account commutation between quantum operations. We show that this formulation improves the overall execution time of the resulting schedules in practice through experiments with a real quantum compiler and quantum circuits from two common benchmark sets.

关键词： quantum computer quantum compiler scheduling job-shop problem constraint programming

来源：评论

学校读者我要写书评

暂无评论

Scheduling Human-Robot Teams in collaborative working cells

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2021年 235卷

作者： Ferreira, Cristiane Figueira, Goncalo Amorim, Pedro Univ Porto INESC TEC Rua Dr Roberto Frias S-N P-4600001 Porto Portugal Univ Porto Fac Engn Rua Dr Roberto Frias S-N P-4600001 Porto Portugal

Soon, a new generation of Collaborative Robots embodying Human-Robot Teams (HRTs) is expected to be more widely adopted in manufacturing. The adoption of this technology requires evaluating the overall performance achieved by an HRT for a given production workflow. We study this performance by solving the underlying scheduling problem under different production settings. We formulate the problem as a Multimode Multiprocessor Task Scheduling Problem, where tasks may be executed by two different types of resources (humans and robots), or by both simultaneously. Two algorithms are proposed to solve the problem - a constraint programming model and a Genetic Algorithm. We also devise a new lower bound for benchmarking the methods. Computational experiments are conducted on a large set of instances generated to represent a variety of HRT production settings. General instances for the problem are also considered. The proposed methods outperform algorithms found in the literature for similar problems. For the HRT instances, we find optimal solutions for a considerable number of instances, and tight gaps to lower bounds when optimal solutions are unknown. Moreover, we derive some insights on the improvement obtained if tasks can be executed simultaneously by the HRT. The experiments suggest that collaborative tasks reduce the total work time, especially in settings with numerous precedence constraints and low robot eligibility. These results indicate that the possibility of collaborative work can shorten cycle time, which may motivate future investment in this new technology.

关键词： Scheduling Human robot collaboration Multiprocessor tasks constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：