Examples of hudson.model.queue.MappingWorksheet | massapi.com

Home Package Class Method

Package hudson.model.queue

Examples of hudson.model.queue.MappingWorksheet

hudson.model.queue.MappingWorksheet
Defines a mapping problem for answering "where do we execute this task?"
The heart of the placement problem is a mapping problem. We are given a {@link Task}, (which in the general case consists of a set of {@link SubTask}s), and we are also given a number of idle {@link Executor}s, and our goal is to find a mapping from the former to the latter, which determines where each {@link SubTask} gets executed.
This mapping is done under two constraints:
- "Same node" constraint. Some of the subtasks need to be co-located on the same node. See {@link SubTask#getSameNodeConstraint()}
- Label constraint. {@link SubTask}s can specify that it can be only run on nodes that has the label.
We first fold the former constraint into the problem definition. That is, we now consider a set of {@link SubTask}s that need to be co-located as a single {@link WorkChunk}. Similarly, we consider a set of all {@link Executor}s from the same node as {@link ExecutorChunk}. Now, the problem becomes the weighted matching problem from {@link WorkChunk} to {@link ExecutorChunk}.
An instance of {@link MappingWorksheet} captures a problem definition, plus which{@link ExecutorChunk} and {@link WorkChunk} are compatible. The purpose of this class(and {@link ExecutorChunk} and {@link WorkChunk}) are to expose a lot of convenience methods to assist various algorithms that produce the solution of this mapping problem, which is represented as {@link Mapping}. @see LoadBalancer#map(Task,MappingWorksheet) @author Kohsuke Kawaguchi

            List<JobOffer> candidates = new ArrayList<JobOffer>(parked.size());
            for (JobOffer j : parked.values())
                if(j.canTake(p))
                    candidates.add(j);


            MappingWorksheet ws = new MappingWorksheet(p, candidates);
            Mapping m = loadBalancer.map(p.task, ws);
            if (m == null)
                // if we couldn't find the executor that fits,
                // just leave it in the buildables list and
                // check if we can execute other projects

View Full Code Here

                    List<JobOffer> candidates = new ArrayList<JobOffer>(parked.size());
                    for (JobOffer j : parked.values())
                        if(j.canTake(p.task))
                            candidates.add(j);


                    MappingWorksheet ws = new MappingWorksheet(p, candidates);
                    Mapping m = loadBalancer.map(p.task, ws);
                    if (m == null)
                        // if we couldn't find the executor that fits,
                        // just leave it in the buildables list and
                        // check if we can execute other projects

View Full Code Here

Related Classes of hudson.model.queue.MappingWorksheet

hudson.model.Computer

hudson.model.Label

hudson.model.Node

hudson.model.Queue

Copyright © 2018 www.massapicom. All rights reserved.

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.