1 / 9

Progress Report

Progress Report. 2014/06/20. Things to Do from Last Meeting. Journal version for ICPP 2014 paper Enhance with reviewer comments. Prepare ITRI midterm report Late June(?) How to reduce cutting stock problem to knapsack. Agenda. Reduce cutting stock problem to knapsack Progress report.

yorick
Download Presentation

Progress Report

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Progress Report 2014/06/20

  2. Things to Do from Last Meeting • Journal version for ICPP 2014 paper • Enhance with reviewer comments. • Prepare ITRI midterm report • Late June(?) • How to reduce cutting stock problem to knapsack

  3. Agenda • Reduce cutting stock problem to knapsack • Progress report

  4. Cutting Stock Problem • There are a number of rolls of paper of fixed width waiting to be cut. • Need different numbers of rolls of various-sized width. • Minimize the waste. • Use integer linear programming to find how many times each pattern is used • Patternis a possible combination of cuts.

  5. Reducible to the Knapsack Problem • Column generation is a way of solving cutting stock problem. • Start with only a few patterns and generate new ones as needed. • Generating a new pattern by maximizing the reduced cost. • Integer knapsack problem. • any feasible solution for the auxiliary problem corresponds to a feasible cutting pattern in the cutting-stock problem.

  6. Progress Report • Problem formulation • Divide each time interval into 100 time slices. • Given a set of vCPU and the amount of time slices a vCPU can use on each physical core. • Find a way to schedule these vCPU. • A vCPU cannot appear in two or more physical core on the same time.

  7. Example – 3 vCPUs, 2 Physical Core vCPU0 (60, 20) vCPU1 (0, 50) vCPU2 (20, 30) t=100 t=0

  8. Current Status • Consider n physical cores with m vCPUs. • n < m • Greedy seems to be a good solution(?) • Still working on this problem.

  9. Things to Do • Journal version for ICPP 2014 paper • Enhance with reviewer comments. • Prepare ITRI midterm presentation • 6/25

More Related