Package edu.vt.rt.hyflow.benchmark.rmi.list

Examples of edu.vt.rt.hyflow.benchmark.rmi.list.INode

27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
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
      dmy.setNext(null);
   
  }
 
  public void enqueue(Integer item) {
    INode tail = null, last=null;
    Address tailServer = null, lastServer=null;
    String lastId = null;
    try{
      tailServer = (Address) Network.getAddress(Benchmark.getServerId(TAIL));
      tail = (INode)LocateRegistry.getRegistry(tailServer.inetAddress.getHostAddress(), tailServer.port).lookup(TAIL);
      Network.linkDelay(true, tailServer);
      tail.lock();
      Network.linkDelay(true, tailServer);
      lastId = tail.getNext();    //Got Id for last node in queue
     
      lastServer = (Address) Network.getAddress(Benchmark.getServerId(lastId));
      last = (INode)LocateRegistry.getRegistry(lastServer.inetAddress.getHostAddress(), lastServer.port).lookup(lastId);
      Network.linkDelay(true, lastServer);
      last.lock();
      Network.linkDelay(true, lastServer);
     
      String newNodeId =  Network.getInstance().getID() + "-" + Math.random();  // generate random id
      Node newNode = new Node(newNodeId, item);
      newNode.setNext(null);
     
      tail.setNext(newNodeId);
      Network.linkDelay(true, tailServer);
     
      last.setNext(newNodeId);
      Network.linkDelay(true, lastServer);
     
      Logger.debug("list.add("+item+");");
    } catch (AccessException e) {
      e.printStackTrace();
    } catch (RemoteException e) {
      e.printStackTrace();
    } catch (NotBoundException e) {
      e.printStackTrace();
    } catch (InterruptedException e) {
      e.printStackTrace();
    }finally {
      try {
        Benchmark.processingDelay();
      } catch (InterruptedException e1) {
        // TODO Auto-generated catch block
        e1.printStackTrace();
      }
      if(last!=null){
        Network.linkDelay(true, lastServer);
        try {
          last.unlock();
        } catch (RemoteException e) {
          e.printStackTrace();
        }
      }
      if(tail!=null ){
        Network.linkDelay(true, tailServer);
        try {
          tail.unlock();
        } catch (RemoteException e) {
          e.printStackTrace();
        }
      }
    }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
      }
    }
  }

  public Integer dequeue() {
      INode next = null, front=null, first=null;
    String nextId = null, firstId=null;
    Address nexServer= null, server=null, firstServer=null;
    Integer value;
    try{
      //Get the Front Node
      server = (Address) Network.getAddress(Benchmark.getServerId(HEAD));
      front = (INode)LocateRegistry.getRegistry(server.inetAddress.getHostAddress(), server.port).lookup(HEAD);
      Network.linkDelay(true, server);
      front.lock();
      Network.linkDelay(true, server);
      nextId = front.getNext();
     
      /*if(nextId == null){
        System.out.println("Problem at front");
        return null;
      }*/
       
      //return null;
     
      //Get the Dummy Node
      nexServer = (Address) Network.getAddress(Benchmark.getServerId(nextId));
      next = (INode)LocateRegistry.getRegistry(nexServer.inetAddress.getHostAddress(), nexServer.port).lookup(nextId);
      Network.linkDelay(true, nexServer);
      next.lock();
      Network.linkDelay(true, server);
      firstId = next.getNext();
     
      //If dummy nodes next is empty
      if(firstId == null){
        Logger.debug("Queue is Empty");
        front.unlock();
        next.unlock();
        return null;
      }
      else{
        //Get the Details of Node to be deleted
        firstServer = (Address) Network.getAddress(Benchmark.getServerId(firstId));
        first = (INode)LocateRegistry.getRegistry(firstServer.inetAddress.getHostAddress(), firstServer.port).lookup(firstId);
        Network.linkDelay(true, firstServer);
        first.lock();
        Network.linkDelay(true, firstServer);
        value = first.getValue();
        Network.linkDelay(true, firstServer);
       
        //Make to be deleted Node, dummy Node
        front.setNext(firstId);
        edu.vt.rt.hyflow.benchmark.Benchmark.processingDelay();
        Network.linkDelay(true, server);
       
        //Destroy the old dummy Node
        next.destroy();
       
        //Unlock nodes and return
        front.unlock();
        first.unlock();
        Logger.debug("Deleted Node Value="+value);
        return value;
        }   
    } catch (AccessException e) {
      e.printStackTrace();
    } catch (RemoteException e) {
      e.printStackTrace();
    } catch (NotBoundException e) {
      e.printStackTrace();
    } catch (InterruptedException e) {
      e.printStackTrace();
    }finally{
      if(next!=null){
        Network.linkDelay(true, nexServer);
        try {
          next.unlock();
        } catch (RemoteException e) {
          e.printStackTrace();
        }
      }
      if(front!=null){
View Full Code Here
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
    return false;
  }
 
  public Integer sum(){  // used in sanity checks only
    Integer sum=0;
    INode pred = null, curr = null,front=null, end=null;
    Address server=null,predServer = null, currServer=null, endServer=null;
    String predId=null, firstId=null, currId=null;
    try {
      //Get a lock on front and end node so no one else can delete the nodes in queue
      //While traversing through it
      server = (Address) Network.getAddress(Benchmark.getServerId(HEAD));
      front = (INode)LocateRegistry.getRegistry(server.inetAddress.getHostAddress(), server.port).lookup(HEAD);
      Network.linkDelay(true, server);
      front.lock();
      Network.linkDelay(true, server);
      predId= front.getNext();
     
      //Get lock on END node
      endServer = (Address) Network.getAddress(Benchmark.getServerId(TAIL));
      end = (INode)LocateRegistry.getRegistry(endServer.inetAddress.getHostAddress(), endServer.port).lookup(TAIL);
      Network.linkDelay(true, endServer);
      end.lock();
      Network.linkDelay(true, endServer); 
     
      //Get dummy node in queue
      predServer = (Address) Network.getAddress(Benchmark.getServerId(predId));
      pred = (INode)LocateRegistry.getRegistry(predServer.inetAddress.getHostAddress(), predServer.port).lookup(predId);
      Network.linkDelay(true, predServer);
      pred.lock();
      Network.linkDelay(true, predServer);
      firstId = pred.getNext();
     
      //Check if queue is Empty
      if(firstId == null){
        Logger.debug("NOT FOUND..Queue is Empty");
        front.unlock();
        end.unlock();
        pred.unlock();
        return sum;
      }
      else{
        //Unlock front node
        front.unlock();
       
        //Get Value of first node as current Node
        currServer = (Address) Network.getAddress(Benchmark.getServerId(firstId));
        curr = (INode)LocateRegistry.getRegistry(currServer.inetAddress.getHostAddress(), currServer.port).lookup(firstId);
        Network.linkDelay(true, currServer);
        curr.lock();
        Network.linkDelay(true, currServer);
        //Get New Current Id
        currId = curr.getNext();
       
        while(true){
          sum += curr.getValue();
          pred.unlock();
         
          //Check new current ID
          if(currId == null){
            Logger.debug("Calculated Sum="+sum);
            end.unlock();
            curr.unlock();
            return sum;           
          }
         
          //Make current node Previous node
          pred=curr;
         
          //Get Details of New Current Node
          currServer = (Address) Network.getAddress(Benchmark.getServerId(currId));
          curr = (INode)LocateRegistry.getRegistry(currServer.inetAddress.getHostAddress(), currServer.port).lookup(currId);
          Network.linkDelay(true, currServer);
          curr.lock();
          Network.linkDelay(true, currServer);
         
          //Get next New Node
          currId = curr.getNext();
        }
      }
    } catch (AccessException e) {
      e.printStackTrace();
    } catch (RemoteException e) {
      e.printStackTrace();
    } catch (NotBoundException e) {
      e.printStackTrace();
    } catch (InterruptedException e) {
      e.printStackTrace();
    } finally {
      try {
        edu.vt.rt.hyflow.benchmark.Benchmark.processingDelay();
      } catch (InterruptedException e1) {
        // TODO Auto-generated catch block
        e1.printStackTrace();
      }
      try {
        if(pred!=null){
          Network.linkDelay(true, predServer);
          pred.unlock();
        }
      } catch (RemoteException e) {
        e.printStackTrace();
      }
      try {
View Full Code Here
TOP

Related Classes of edu.vt.rt.hyflow.benchmark.rmi.list.INode

  • edu.vt.rt.hyflow.benchmark.rmi.queue.QueueHandler
    • 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.