Package org.apache.accumulo.server.master.state

Examples of org.apache.accumulo.server.master.state.TabletMigration

120
121
122
123
124
125
126
127
128
129
130
            KeyExtent ke = new KeyExtent(ts.extent);
            int index = r.nextInt(underCapacityTServer.size());
            TServerInstance dest = underCapacityTServer.get(index);
            if (dest.equals(e.getKey()))
              continue;
            migrationsOut.add(new TabletMigration(ke, e.getKey(), dest));
            if (numTablets.put(dest, numTablets.get(dest) + 1) > avg)
              underCapacityTServer.remove(index);
            if (numTablets.put(e.getKey(), numTablets.get(e.getKey()) - 1) <= avg && !underCapacityTServer.contains(e.getKey()))
              underCapacityTServer.add(e.getKey());
           
View Full Code Here
249
250
251
252
253
254
255
256
257
      if (tooLittleCount == null) {
        tooLittleCount = 0;
      }
      tooLittleMap.put(table, tooLittleCount + 1);
     
      result.add(new TabletMigration(extent, tooMuch.server, tooLittle.server));
    }
    return result;
  }
View Full Code Here
249
250
251
252
253
254
255
256
257
      if (tooLittleCount == null) {
        tooLittleCount = 0;
      }
      tooLittleMap.put(table, tooLittleCount + 1);
     
      result.add(new TabletMigration(extent, tooMuch.server, tooLittle.server));
    }
    return result;
  }
View Full Code Here
248
249
250
251
252
253
254
255
256
      if (tooLittleCount == null) {
        tooLittleCount = 0;
      }
      tooLittleMap.put(table, tooLittleCount + 1);
     
      result.add(new TabletMigration(extent, tooMuch.server, tooLittle.server));
    }
    return result;
  }
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
            KeyExtent ke = new KeyExtent(ts.extent);
            int index = r.nextInt(underCapacityTServer.size());
            TServerInstance dest = underCapacityTServer.get(index);
            if (dest.equals(e.getKey()))
              continue;
            migrationsOut.add(new TabletMigration(ke, e.getKey(), dest));
            if (numTablets.put(dest, numTablets.get(dest) + 1) > avg)
              underCapacityTServer.remove(index);
            if (numTablets.put(e.getKey(), numTablets.get(e.getKey()) - 1) <= avg && !underCapacityTServer.contains(e.getKey()))
              underCapacityTServer.add(e.getKey());
           
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
            KeyExtent ke = new KeyExtent(ts.extent);
            int index = r.nextInt(underCapacityTServer.size());
            TServerInstance dest = underCapacityTServer.get(index);
            if (dest.equals(e.getKey()))
              continue;
            migrationsOut.add(new TabletMigration(ke, e.getKey(), dest));
            if (numTablets.put(dest, numTablets.get(dest) + 1) > avg)
              underCapacityTServer.remove(index);
            if (numTablets.put(e.getKey(), numTablets.get(e.getKey()) - 1) <= avg && !underCapacityTServer.contains(e.getKey()))
              underCapacityTServer.add(e.getKey());
           
View Full Code Here
248
249
250
251
252
253
254
255
256
      if (tooLittleCount == null) {
        tooLittleCount = 0;
      }
      tooLittleMap.put(table, tooLittleCount + 1);
     
      result.add(new TabletMigration(extent, tooMuch.server, tooLittle.server));
    }
    return result;
  }
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
            KeyExtent ke = new KeyExtent(ts.extent);
            int index = r.nextInt(underCapacityTServer.size());
            TServerInstance dest = underCapacityTServer.get(index);
            if (dest.equals(e.getKey()))
              continue;
            migrationsOut.add(new TabletMigration(ke, e.getKey(), dest));
            if (numTablets.put(dest, numTablets.get(dest) + 1) > avg)
              underCapacityTServer.remove(index);
            if (numTablets.put(e.getKey(), numTablets.get(e.getKey()) - 1) <= avg && !underCapacityTServer.contains(e.getKey()))
              underCapacityTServer.add(e.getKey());
           
View Full Code Here
249
250
251
252
253
254
255
256
257
      if (tooLittleCount == null) {
        tooLittleCount = 0;
      }
      tooLittleMap.put(table, tooLittleCount + 1);
     
      result.add(new TabletMigration(extent, tooMuch.server, tooLittle.server));
    }
    return result;
  }
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
            KeyExtent ke = new KeyExtent(ts.extent);
            int index = r.nextInt(underCapacityTServer.size());
            TServerInstance dest = underCapacityTServer.get(index);
            if (dest.equals(e.getKey()))
              continue;
            migrationsOut.add(new TabletMigration(ke, e.getKey(), dest));
            if (numTablets.put(dest, numTablets.get(dest) + 1) > avg)
              underCapacityTServer.remove(index);
            if (numTablets.put(e.getKey(), numTablets.get(e.getKey()) - 1) <= avg && !underCapacityTServer.contains(e.getKey()))
              underCapacityTServer.add(e.getKey());
           
View Full Code Here
TOP

Related Classes of org.apache.accumulo.server.master.state.TabletMigration

  • org.apache.accumulo.server.master.balancer.ChaoticLoadBalancer
  • org.apache.accumulo.server.master.balancer.DefaultLoadBalancer
    • 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.