A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
The MiniZinc Challenge 2008–2013
2014
The AI Magazine
Preserved Fulltext
MiniZinc provides a solver independent modeling language which is now supported by constraint programming solvers, mixed integer programming solvers, SAT and SAT modulo theory solvers, and hybrid solvers ...
MiniZinc is a solver agnostic modeling language for defining and solver combinatorial satisfaction and optimization problems. ...
We would like to thank all those who have submitted problems and instances for use in the challenge for helping us make it possible to run. ...
doi:10.1609/aimag.v35i2.2539
fatcat:xsdcy4tyzvguzn5refzdzystaa
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
2007
Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a scalable, standards based framework that uses web services and grid services with a multiple objective genetic algorithm to solve continuous, mixed integer, single objective or multiple ...
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time constrained deadline. ...
The coupling of AMPL and NSGA-II with distributed evaluation by DRMAA submission to SGE has been successfully completed and benchmarked using a nine processor cluster running Linux. ...
doi:10.1145/1276958.1277372
dblp:conf/gecco/PowellH07
fatcat:ckvhkde2fzevbnp3blsokqkufa
Iterative Simulation and Optimization approach for job shop scheduling
2014
Proceedings of the Winter Simulation Conference 2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The classical job shop scheduling problem which is NP-Hard, has often been modelled as Mixed-Integer Programming (MIP) model and solved using exact algorithms (for example, branch-and-bound and branch-and-cut ...
In this paper, we present an iterative scheme integrating simulation with an optimization model, for solving complex problems, viz., job shop scheduling. ...
It is concluded that the Mixed Integer Programming (MIP) model proposed by Manne (1959) gives the best performance for this class of problems. ...
doi:10.1109/wsc.2014.7020013
dblp:conf/wsc/KulkarniV14
fatcat:pl56xtnxx5bdddf2q27ch5jj34
Benchmarks and Standards for the Evaluation of Parallel Job Schedulers
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The evaluation of parallel job schedulers hinges on the workloads used. ...
Naturally, not all of us agree with all the opinions expressed here... ...
Workload Benchmarks for Metacomputing Most of the resources of a conventional parallel computer are used by batch jobs. ...
doi:10.1007/3-540-47954-6_4
fatcat:bi3yijsc2rf5ni5y4nhjlvbiem
Optimizing Task Allocation for Edge Micro-Clusters in Smart Cities
2021
2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
ACKNOWLEDGMENTS This work is partly supported and funded by King Khalid University, Saudi Arabia and the Saudi Arabian Cultural Bureau in the UK. ...
I n t his p aper, we report on an empirical study to demonstrate that mathematical optimization (in particular, mixed integer programming) for resource management is appropriate in terms of overhead, also ...
We therefore aim to tackle the lack of a real testbed for HEµC and characterise its deployment features and utility by modeling and experimenting with a real configured testbed instead of using simulation ...
doi:10.1109/wowmom51794.2021.00062
fatcat:tgorhsqxb5fx3osynvygswma7y
A resource management tool for heterogeneous networks
1999
Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe the design principles and implementation of a tool to be used as Resource Manager on arbitrary networks of workstations. ...
request for task spawning to the network. ...
A nsieve MIPS rating is provided but the nsieve instruction mix is NOT 'typical'. heapsort An integer program which uses the 'heap sort' method of sorting a random array of long integers up to 2 MBytes ...
doi:10.1109/empdp.1999.746701
dblp:conf/pdp/ClematisDG99
fatcat:tki3nlvlinc2zmalpswsx4m2ym
Simulation Optimization for the Multihoist Scheduling Problem
2021
Applied Computational Intelligence and Soft Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A new biobjective optimization method is proposed, and it uses the results mentioned above in order to build new scenarios for the MHSP and to solve the aforementioned conflicting objectives. ...
In addition, the optimization approach is able to identify the best solutions by a distance-based ranking model and the solutions located in the first Pareto-front layer contributes to improve the search ...
A mixed-integer linear programming model for a multiproduct batch plant with nonidentical parallel processing machines is used in Berber et al.' ...
doi:10.1155/2021/6639769
fatcat:7dvulpvh3rg6niz267k4txxx2e
An SMT-Selection Metric to Improve Multithreaded Applications' Performance
2012
2012 IEEE 26th International Parallel and Distributed Processing Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We have validated the SMT-selection metric using a variety of benchmarks that capture various application characteristics on two different processor architectures. ...
Our results show that the SMT-selection metric is capable of predicting the best SMT level for a given workload in 90% of the cases. ...
ACKNOWLEDGMENT We would like to thank Niteesh Dubey for his help and valuable feedback on this work. ...
doi:10.1109/ipdps.2012.125
dblp:conf/ipps/FunstonMJPF12
fatcat:nagiyu2urffwvo7v6yvd5aoxwu
Next Generation of HEP CPU Benchmarks
2019
EPJ Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Meanwhile, in 2017 a new SPEC generation of benchmarks for CPU intensive workloads has been released: SPEC CPU 2017. ...
This report summarises the findings of the HEPiX Benchmarking Working Group in comparing SPEC CPU 2017 and other HEP benchmarks with the typical WLCG workloads mixes. ...
Requirements for a benchmark suite The software and computing challenges for the HEP field, in particular due to the HL-LHC program [22] , have implications on the benchmarking side. ...
doi:10.1051/epjconf/201921408011
fatcat:34wqfmfuz5drje6gp4k5fdtznm
Modelling and Developing Co-scheduling Strategies on Multicore Processors
2015
2015 44th International Conference on Parallel Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, the problem of co-scheduling a mix of serial and parallel jobs is modelled as an Integer Programming (IP) problem. ...
We also construct a co-scheduling graph to represent the co-scheduling problem and model the problem of finding the optimal co-scheduling solution as the problem of finding the shortest valid path in the ...
In this paper, we developed two methods, an Integer Programming-based (IP-based) and a graph-based method, to find the optimal co-scheduling solution for a mix of serial and parallel jobs. ...
doi:10.1109/icpp.2015.31
dblp:conf/icpp/ZhuHGLSCL15
fatcat:bjbg5hnrgzae7n4xptgioh4xru
Solving sequencing problems in spreadsheets
2011
International Journal of Planning and Scheduling
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We may wish to explore the use of state-of-the-art algorithms, but a more accessible alternative may exist. ...
This paper reports computational experiments that shed light on how large a problem we might be able to solve, assuming that our work is done using a spreadsheet-based approach with the hardware and software ...
In our experiments, the FSCTP was formulated as a mixed-integer program using the same basic structure as for the FSMP. ...
doi:10.1504/ijps.2011.044556
fatcat:3jx26acay5cf3ksz7semnqlsja
Optimizing Job Scheduling on Multicore Computers
2014
2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Resource sharing may cause performance degradation of the co-running jobs. Job co-scheduling is a technique that can effectively alleviate the contention. ...
In this paper, a graph-based method is developed to find the optimal co-scheduling solution for serial jobs, and then the method is extended to incorporate parallel jobs. ...
ACKNOWLEDGMENT This work is supported by the Leverhulme Trust (grant number RPG-101). ...
doi:10.1109/mascots.2014.16
dblp:conf/mascots/ZhuHJ14
fatcat:wi3sjivqwfdsjhiwoyizbsm4r4
Optimize Unrelated Parallel Machines Scheduling Problems With Multiple Limited Additional Resources, Sequence-Dependent Setup Times and Release Date Constraints
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In order to find an optimal solution for this problem, a new mixed-integer linear programming model (MILP) is presented. ...
linear programming model. ...
MIXED INTEGER LINEAR PROGRAMMING MODEL (MILP) FORMULATION In order to find the optimal solution for the problem considered in this paper, a Mixed Integer Linear Programming (MILP) model is developed. ...
doi:10.1109/access.2019.2955975
fatcat:ubdj6stbwfgc5a7lnkk2orqq3u
Synthesis of reconfigurable high-performance multicore systems
2009
Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays - FPGA '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Then we present an optimal solution for coprocessor selection in the local optimization step. ...
Experiments show that our proposed techniques provide efficient solutions for real-life benchmarks and generate higher quality of results. ...
Then we can formulate the job assignment problem as the following mixed integer linear program LP_EXT(T,C), where x ij is a 0-1 integer variable and x ijh is a real variable. ...
doi:10.1145/1508128.1508159
dblp:conf/fpga/CongGH09
fatcat:ele2wun3wzaljcbrwarwhsfuem
Recent Advances in Scheduling and Its Applications
2015
Discrete Dynamics in Nature and Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The work is also supported by the National Natural Science Foundation of China (Grant nos. 71001074, 71101097, and 11001117) and the Program for Liaoning Excellent Talents in University (Grant nos. ...
Acknowledgments We are grateful to all of the authors for their contributions and the reviewers for their effort providing helpful comments and suggestions. ...
They convert their model into its robust counterpart using a form of the mixed-integer programming model. ...
doi:10.1155/2015/738637
fatcat:3j5voayvsfe3fkhg6xaw3g2xky
« Previous
Showing results 1 — 15 out of 6,514 results