Package jmt.engine.QueueNet

Examples of jmt.engine.QueueNet.JobInfo

106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
      }
    }

    //print
    ListIterator iterator = list.getJobList().listIterator();
    JobInfo current = null;
    String className;
    int classPr, jobID;

    String strategyType = "";

    switch (strategy) {
      case STRATEGY_HEAD:
        strategyType = "HEAD";
        break;
      case STRATEGY_TAIL:
        strategyType = "TAIL";
        break;
      case STRATEGY_HEAD_PRIORITY:
        strategyType = "HEAD_PR";
        break;
      case STRATEGY_TAIL_PRIORITY:
        strategyType = "TAIL_PR";
        break;
    }

    System.out.println(strategyType);

    //iterator starts from the first (i.e. the job with highest priority)
    while (iterator.hasNext()) {
      current = (JobInfo) iterator.next();

      jobID = current.getJob().getId();
      className = current.getJob().getJobClass().getName();
      classPr = current.getJob().getJobClass().getPriority();

      System.out.println("Job: " + jobID + " Class: " + className + " Priority: " + classPr);

    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
        // Resets ack count
        ackCount = 0;

        // Removes job from global node list
        JobInfoList info = getOwnerNode().getJobInfoList();
        JobInfo jobData = info.lookFor(job);
        if (jobData != null) {
          info.remove(jobData);
        }

        // Gets global jobInfoList
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
        //before the jobinfo objects weren't removed (often causing outOfMemory errors!!!)

        if (jobsList_node == null) {
          jobsList_node = this.getOwnerNode().getJobInfoList();
        }
        JobInfo jobInfo_node = jobsList_node.lookFor(job);
        if (jobInfo_node != null) {
          //removes job from the jobInfoList of the node
          jobsList_node.removeAfterDrop(jobInfo_node);
        }
        //end NEW
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
        if (job instanceof ForkJob) {
          ForkJob fJob = (ForkJob) job;

          // Removes job from global node list
          JobInfoList info = getOwnerNode().getJobInfoList();
          JobInfo jobData = info.lookFor(job);
          if (jobData != null) {
            info.remove(jobData);
          }

          // Removes job from system list
          GlobalJobInfoList global = getOwnerNode().getQueueNet().getJobInfoList();
          global.removeForkedJob(fJob);

          // Needed pieces
          int needed;
          if (jobs.containsKey(fJob.getForkedJob())) {
            needed = jobs.get(fJob.getForkedJob()).intValue();
          } else {
            needed = fJob.getForkedNumber();
            // As we are waiting for other fragments, adds merged job to global and local info list
            JobInfo merged = new JobInfo(fJob.getForkedJob());
            info.add(merged);
            jobsList.add(merged);
          }
          // Decrement needed as we received this job
          needed--;
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
    //list of jobs in queue
    List<JobInfo> list = queue.getJobList();

    if (list.size() == 0) {
      //empty list: add first
      queue.addFirst(new JobInfo(job), true);
      return;
    }

    //else creates an iterator and find the correct position
    //according to the job priority

    ListIterator<JobInfo> iterator = list.listIterator();
    JobInfo current = null;
    int currentJobPriority = 0;
    int index = -1;

    //iterator starts from the first (i.e. the job with highest priority)
    while (iterator.hasNext()) {
      index++;
      current = iterator.next();
      currentJobPriority = current.getJob().getJobClass().getPriority();

      if (priority > currentJobPriority) {
        //the job to be added must be inserted before the current job
        //(because has greater priority)

        //index is the position of the current element, which will be shifted together
        //with the following ones
        queue.add(index, new JobInfo(job), true);
        return;
      }
      //else if priority is lower than current, continue iteration
    }

    //exiting from the "while" means that the job to be inserted is the job with
    //lowest priority or has equal priority to the current last job but it is the last come

    //add last
    queue.addLast(new JobInfo(job), true);
    return;

  }
View Full Code Here
40
41
42
43
44
45
46
47
   * @param sourceSection Job source section.
   * @param sourceNode Job source node.
   * @param callingSection The section which calls this strategy.
   */
  public void put(Job job, JobInfoList queue, byte sourceSection, NetNode sourceNode, NodeSection callingSection) throws NetException {
    queue.addLast(new JobInfo(job));
    return;
  }
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
    //list of jobs in queue
    List<JobInfo> list = queue.getJobList();

    if (list.size() == 0) {
      //empty list: add first in general and class lists
      queue.addFirst(new JobInfo(job), false);
      return;
    }

    //else creates an iterator and find the correct position
    //according to the job priority

    ListIterator<JobInfo> iterator = list.listIterator();
    JobInfo current = null;
    int currentJobPriority = 0;
    int index = -1;

    //iterator starts from the first (i.e. the job with highest priority)
    while (iterator.hasNext()) {
      index++;
      current = iterator.next();
      currentJobPriority = current.getJob().getJobClass().getPriority();

      if (priority >= currentJobPriority) {
        //the job to be added must be inserted before the current job
        //(because has greater priority or has equal priority but it is the last come)

        //index is the position of the current element, which will be shifted together
        //with the following ones

        queue.add(index, new JobInfo(job), false);
        return;
      }
      //else if priority is lower than current, continue iteration
    }

    //exiting from the "while" means that the job to be inserted is the job with
    //lowest priority
    //add last
    queue.addLast(new JobInfo(job), false);
    return;
  }
View Full Code Here
39
40
41
42
43
44
45
   * @param sourceSection Job source section.
   * @param sourceNode Job source node.
   * @param callingSection The section which calls this strategy.
   */
  public void put(Job job, JobInfoList queue, byte sourceSection, NetNode sourceNode, NodeSection callingSection) {
    queue.addFirst(new JobInfo(job));
  }
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
    ListIterator<JobInfo> iterator = jobList.listIterator();

    Job nextJob = null;
    int nextJobPriority = 0;
    while (iterator.hasNext()) {
      JobInfo info = iterator.next();
      JobClass jobClass = info.getJob().getJobClass();
      if (nextJob == null || nextJobPriority < jobClass.getPriority()) {
        if (!blockingRegion.isBlocked(jobClass)) {
          nextJob = info.getJob();
          nextJobPriority = jobClass.getPriority();
        }
      }
    }
    return nextJob;
View Full Code Here
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
        //Secondly point to be noted is that I am
        //only dropping Jobs at Node level as the node section jobs
        //are automatically dropped but the node level jobs are
        //dropped manually.
        Job localJob = (Job) message.getData();
        JobInfo jobInfo = jobsList_node.lookFor(localJob);
        //remove only when you find a job in the list.
        if (jobInfo != null) {
          jobsList_node.remove(jobInfo);
        }

        //checks whether there are jobs in queue
        if (jobsList.size() == 0) {
          //no jobs in queue
          coolStart = true;
          break;
        }

        //search for the first job which is not blocked (if exists)
        // and forward it

        notBlockedJob = getNextNotBlockedJob();

        if (notBlockedJob != null) {
          JobClass jobClass = notBlockedJob.getJobClass();
          forward(notBlockedJob);
          blockingRegion.increaseOccupation(jobClass);
          break;
        } else {
          //all jobs in queue are blocked
          //nothing else to do
          break;
        }

      case NetEvent.EVENT_ACK:

        //checks whether there are jobs in queue
        if (jobsList.size() == 0) {
          //no jobs in queue
          coolStart = true;
          break;
        }

        //search for the first job which is not blocked (if exists)
        // and forward it

        notBlockedJob = getNextNotBlockedJob();

        if (notBlockedJob != null) {
          JobClass jobClass = notBlockedJob.getJobClass();
          forward(notBlockedJob);
          blockingRegion.increaseOccupation(jobClass);
          break;
        } else {
          //all jobs in queue are blocked
          //nothing else to do
          break;
        }

      case NetEvent.EVENT_JOB:

        //EVENT_JOB

        job = message.getJob();

        //no ack must be sent to the source of message (the redirecting queue of a node
        //inside the region)

        JobClass jobClass = job.getJobClass();

        //this job has been received by an internal node
        //the region input station will have to send it back
        NetNode realDestination = message.getSource();

        //adds a JobInfo object after modifying the job with redirection informations
        job.setOriginalDestinationNode(realDestination);
        jobsList.add(new JobInfo(job));

        //checks whether the region is blocked for this class
        if (blockingRegion.isBlocked(jobClass)) {
          //the region is already blocked
View Full Code Here
TOP

Related Classes of jmt.engine.QueueNet.JobInfo

  • jmt.engine.NetStrategies.QueuePutStrategies.HeadStrategy
  • jmt.engine.NetStrategies.QueuePutStrategies.HeadStrategyPriority
  • jmt.engine.NetStrategies.QueuePutStrategies.TailStrategy
  • jmt.engine.NetStrategies.QueuePutStrategies.TailStrategyPriority
  • jmt.engine.NodeSections.BlockingQueue
  • jmt.engine.NodeSections.Fork
  • jmt.engine.NodeSections.JobSink
  • jmt.engine.NodeSections.Join
  • jmt.engine.NodeSections.Queue
  • jmt.test.engine.TestClassPriorityStrategy
    • 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.