Package com.sun.sgs.impl.service.nodemap.affinity.graph

Examples of com.sun.sgs.impl.service.nodemap.affinity.graph.WeightedEdge

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
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
        for (int i = 1; i < nodes.length; i++) {
            // Add identities 1-34
            nodes[i] = new LabelVertex(new DummyIdentity(String.valueOf(i)));
            graph.addVertex(nodes[i]);
        }
        graph.addEdge(new WeightedEdge(), nodes[2], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[3], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[3], nodes[2]);
        graph.addEdge(new WeightedEdge(), nodes[4], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[4], nodes[2]);
        graph.addEdge(new WeightedEdge(), nodes[4], nodes[3]);
        graph.addEdge(new WeightedEdge(), nodes[5], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[6], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[7], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[7], nodes[5]);
        graph.addEdge(new WeightedEdge(), nodes[7], nodes[6]);
        graph.addEdge(new WeightedEdge(), nodes[8], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[8], nodes[2]);
        graph.addEdge(new WeightedEdge(), nodes[8], nodes[3]);
        graph.addEdge(new WeightedEdge(), nodes[8], nodes[4]);
        graph.addEdge(new WeightedEdge(), nodes[9], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[9], nodes[3]);
        graph.addEdge(new WeightedEdge(), nodes[10], nodes[3]);
        graph.addEdge(new WeightedEdge(), nodes[11], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[11], nodes[5]);
        graph.addEdge(new WeightedEdge(), nodes[11], nodes[6]);
        graph.addEdge(new WeightedEdge(), nodes[12], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[13], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[13], nodes[4]);
        graph.addEdge(new WeightedEdge(), nodes[14], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[14], nodes[2]);
        graph.addEdge(new WeightedEdge(), nodes[14], nodes[3]);
        graph.addEdge(new WeightedEdge(), nodes[14], nodes[4]);
        graph.addEdge(new WeightedEdge(), nodes[17], nodes[6]);
        graph.addEdge(new WeightedEdge(), nodes[17], nodes[7]);
        graph.addEdge(new WeightedEdge(), nodes[18], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[18], nodes[2]);
        graph.addEdge(new WeightedEdge(), nodes[20], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[20], nodes[2]);
        graph.addEdge(new WeightedEdge(), nodes[22], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[22], nodes[2]);
        graph.addEdge(new WeightedEdge(), nodes[26], nodes[24]);
        graph.addEdge(new WeightedEdge(), nodes[26], nodes[25]);
        graph.addEdge(new WeightedEdge(), nodes[28], nodes[3]);
        graph.addEdge(new WeightedEdge(), nodes[28], nodes[24]);
        graph.addEdge(new WeightedEdge(), nodes[28], nodes[25]);
        graph.addEdge(new WeightedEdge(), nodes[29], nodes[3]);
        graph.addEdge(new WeightedEdge(), nodes[30], nodes[24]);
        graph.addEdge(new WeightedEdge(), nodes[30], nodes[27]);
        graph.addEdge(new WeightedEdge(), nodes[31], nodes[2]);
        graph.addEdge(new WeightedEdge(), nodes[31], nodes[9]);
        graph.addEdge(new WeightedEdge(), nodes[32], nodes[1]);
        graph.addEdge(new WeightedEdge(), nodes[32], nodes[25]);
        graph.addEdge(new WeightedEdge(), nodes[32], nodes[26]);
        graph.addEdge(new WeightedEdge(), nodes[32], nodes[29]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[3]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[9]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[15]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[16]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[19]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[21]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[23]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[24]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[30]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[31]);
        graph.addEdge(new WeightedEdge(), nodes[33], nodes[32]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[9]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[10]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[14]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[15]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[16]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[19]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[20]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[21]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[23]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[24]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[27]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[28]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[29]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[30]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[31]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[32]);
        graph.addEdge(new WeightedEdge(), nodes[34], nodes[33]);
        Assert.assertEquals(34, graph.getVertexCount());
        Assert.assertEquals(78, graph.getEdgeCount());

        return graph;
    }
View Full Code Here
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
                nodes[i] =
                        new LabelVertex(new DummyIdentity(String.valueOf(i)));
                graph.addVertex(nodes[i]);
            }

            graph.addEdge(new WeightedEdge(), nodes[1], nodes[2]);
            graph.addEdge(new WeightedEdge(), nodes[1], nodes[3]);
            graph.addEdge(new WeightedEdge(), nodes[2], nodes[3]);
            graph.addEdge(new WeightedEdge(), nodes[2], nodes[4]);
            graph.addEdge(new WeightedEdge(), nodes[4], nodes[5]);

            Assert.assertEquals(5, graph.getVertexCount());
            Assert.assertEquals(5, graph.getEdgeCount());
            return graph;
        }
View Full Code Here
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
                nodes[i] =
                        new LabelVertex(new DummyIdentity(String.valueOf(i)));
                graph.addVertex(nodes[i]);
            }

            graph.addEdge(new WeightedEdge(2), nodes[1], nodes[2]);
            graph.addEdge(new WeightedEdge(2), nodes[1], nodes[3]);
            graph.addEdge(new WeightedEdge(2), nodes[2], nodes[3]);
            graph.addEdge(new WeightedEdge(2), nodes[2], nodes[4]);
            graph.addEdge(new WeightedEdge(2), nodes[4], nodes[5]);

            Assert.assertEquals(5, graph.getVertexCount());
            Assert.assertEquals(5, graph.getEdgeCount());
            return graph;
        }
View Full Code Here
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
            synchronized (bipartiteGraph) {
                // For each modified edge in the graph, update weights
                for (Map.Entry<WeightedEdge, Integer> entry :
                     periodEdgeIncrements.entrySet())
                {
                    WeightedEdge edge = entry.getKey();
                    int weight = entry.getValue();
                    if (edge.getWeight() == weight) {
                        Pair<Object> endpts = bipartiteGraph.getEndpoints(edge);
                        bipartiteGraph.removeEdge(edge);
                        for (Object end : endpts) {
                            if (bipartiteGraph.degree(end) == 0) {
                                bipartiteGraph.removeVertex(end);
                            }
                        }
                    } else {
                        edge.addWeight(-weight);
                    }
                }
            }

            // For each conflict, update values
View Full Code Here
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
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
            }
            // Obj uses
            Map<Identity, Long> tempMap = new HashMap<Identity, Long>();
            if (node == NODE1) {
                // Update edges
                graph.addEdge(new WeightedEdge(), nodes[4], nodes[1]);
                graph.addEdge(new WeightedEdge(), nodes[7], nodes[1]);
                graph.addEdge(new WeightedEdge(), nodes[13], nodes[1]);
                graph.addEdge(new WeightedEdge(), nodes[13], nodes[4]);
                graph.addEdge(new WeightedEdge(), nodes[22], nodes[1]);
                graph.addEdge(new WeightedEdge(), nodes[28], nodes[25]);
                graph.addEdge(new WeightedEdge(), nodes[34], nodes[10]);
                graph.addEdge(new WeightedEdge(), nodes[34], nodes[16]);
                graph.addEdge(new WeightedEdge(), nodes[34], nodes[19]);
                graph.addEdge(new WeightedEdge(), nodes[34], nodes[28]);
                graph.addEdge(new WeightedEdge(), nodes[34], nodes[31]);

                // Obj uses
                tempMap.put(idents[1], 1L);
                tempMap.put(idents[4], 4L);
                objUseMap.put("o1", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                tempMap.put(idents[7], 1L);
                objUseMap.put("o2", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                objUseMap.put("o3", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[7], 1L);
                objUseMap.put("o4", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                objUseMap.put("o5", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                objUseMap.put("o84", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[4], 1L);
                objUseMap.put("o87", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[10], 1L);
                objUseMap.put("o7", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                objUseMap.put("o8", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                objUseMap.put("o11", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                tempMap.put(idents[13], 1L);
                objUseMap.put("o12", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[4], 1L);
                tempMap.put(idents[13], 1L);
                objUseMap.put("o13", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[7], 1L);
                objUseMap.put("o15", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                objUseMap.put("o16", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                objUseMap.put("o18", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[22], 1L);
                tempMap.put(idents[1], 1L);
                objUseMap.put("o20", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[22], 1L);
                objUseMap.put("o21", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[25], 1L);
                objUseMap.put("o23", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[28], 1L);
                objUseMap.put("o24", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[28], 1L);
                objUseMap.put("o25", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[28], 1L);
                tempMap.put(idents[25], 1L);
                objUseMap.put("o26", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[31], 1L);
                objUseMap.put("o30", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[31], 1L);
                tempMap.put(idents[34], 1L);
                objUseMap.put("o31", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[1], 1L);
                objUseMap.put("o32", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[16], 1L);
                objUseMap.put("o35", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[19], 1L);
                objUseMap.put("o36", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                tempMap.put(idents[10], 1L);
                objUseMap.put("o40", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o41", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o42", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                tempMap.put(idents[16], 1L);
                objUseMap.put("o43", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                tempMap.put(idents[19], 1L);
                objUseMap.put("o44", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o45", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o46", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o47", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o48", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o49", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                tempMap.put(idents[28], 1L);
                objUseMap.put("o50", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o51", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o52", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[34], 1L);
                objUseMap.put("o53", tempMap);


                // conflicts - data cache evictions due to conflict
                // just guessing
                HashMap<Object, Long> conflict = new HashMap<Object, Long>();;
                conflict.put("o1", 1L);
                conflict.put("o2", 1L);
                conflict.put("o18", 1L);
                conflict.put("o21", 1L);
                conflict.put("o41", 1L);
                conflict.put("o45", 1L);
                conflict.put("o47", 1L);
                conflictMap.put(NODE2, conflict);
                conflict = new HashMap<Object, Long>();
                conflict.put("o1", 1L);
                conflict.put("o5", 1L);
                conflict.put("o7", 1L);
                conflict.put("o11", 1L);
                conflict.put("o31", 1L);
                conflict.put("o35", 1L);
                conflict.put("o36", 1L);
                conflict.put("o42", 1L);
                conflict.put("o46", 1L);
                conflict.put("o48", 1L);
                conflict.put("o49", 1L);
                conflictMap.put(NODE3, conflict);
            } else if (node == NODE2) {
                graph.addEdge(new WeightedEdge(), nodes[8], nodes[2]);
                graph.addEdge(new WeightedEdge(), nodes[11], nodes[5]);
                graph.addEdge(new WeightedEdge(), nodes[14], nodes[2]);
                graph.addEdge(new WeightedEdge(), nodes[20], nodes[2]);
                graph.addEdge(new WeightedEdge(), nodes[32], nodes[26]);
                graph.addEdge(new WeightedEdge(), nodes[32], nodes[29]);

                // Obj uses
                tempMap.put(idents[2], 1L);
                tempMap.put(idents[8], 1L);
                objUseMap.put("o1", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[14], 1L);
                objUseMap.put("o84", tempMap);
                tempMap.put(idents[2], 1L);
                tempMap.put(idents[14], 1L);
                objUseMap.put("o85", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[14], 1L);
                objUseMap.put("o86", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[14], 1L);
                objUseMap.put("o87", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[5], 1L);
                objUseMap.put("o2", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[11], 1L);
                objUseMap.put("o8", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[11], 1L);
                tempMap.put(idents[5], 1L);
                objUseMap.put("o9", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[11], 1L);
                objUseMap.put("o10", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[17], 1L);
                objUseMap.put("o14", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[17], 1L);
                objUseMap.put("o15", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[2], 1L);
                objUseMap.put("o17", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[20], 1L);
                objUseMap.put("o18", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[20], 1L);
                tempMap.put(idents[2], 1L);
                objUseMap.put("o19", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[2], 1L);
                objUseMap.put("o21", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[26], 1L);
                objUseMap.put("o22", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[26], 1L);
                tempMap.put(idents[32], 1L);
                objUseMap.put("o23", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[29], 1L);
                objUseMap.put("o27", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[2], 1L);
                objUseMap.put("o30", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[32], 1L);
                tempMap.put(idents[29], 1L);
                objUseMap.put("o66", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[32], 1L);
                objUseMap.put("o32", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[23], 1L);
                objUseMap.put("o38", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[32], 1L);
                objUseMap.put("o39", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[14], 1L);
                objUseMap.put("o41", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[20], 1L);
                objUseMap.put("o45", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[23], 1L);
                objUseMap.put("o47", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[29], 1L);
                objUseMap.put("o51", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[32], 1L);
                objUseMap.put("o53", tempMap);


                // conflicts - data cache evictions due to conflict
                // just guessing
                HashMap<Object, Long> conflict = new HashMap<Object, Long>();
                conflict.put("o2", 1L);
                conflict.put("o8", 1L);
                conflict.put("o15", 1L);
                conflict.put("o23", 1L);
                conflict.put("o30", 1L);
                conflict.put("o32", 1L);
                conflict.put("o51", 1L);
                conflict.put("o53", 1L);
                conflict.put("o84", 1L);
                conflict.put("o87", 1L);
                conflictMap.put(NODE1, conflict);
                conflict = new HashMap<Object, Long>();
                conflict.put("o1", 1L);
                conflict.put("o10", 1L);
                conflict.put("o14", 1L);
                conflict.put("o22", 1L);
                conflict.put("o86", 1L);
                conflictMap.put(NODE3, conflict);
            } else if (node == NODE3) {
                graph.addEdge(new WeightedEdge(), nodes[9], nodes[3]);
                graph.addEdge(new WeightedEdge(), nodes[30], nodes[24]);
                graph.addEdge(new WeightedEdge(), nodes[30], nodes[27]);
                graph.addEdge(new WeightedEdge(), nodes[33], nodes[3]);
                graph.addEdge(new WeightedEdge(), nodes[33], nodes[9]);
                graph.addEdge(new WeightedEdge(), nodes[33], nodes[15]);
                graph.addEdge(new WeightedEdge(), nodes[33], nodes[21]);
                graph.addEdge(new WeightedEdge(), nodes[33], nodes[24]);
                graph.addEdge(new WeightedEdge(), nodes[33], nodes[30]);

                tempMap.put(idents[3], 1L);
                objUseMap.put("o1", tempMap);
                tempMap = new HashMap<Identity, Long>();
                tempMap.put(idents[3], 1L);
View Full Code Here
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
            LabelVertex[] nodes = new LabelVertex[2];
            for (int i = 0; i < nodes.length; i++) {
                nodes[i] = new LabelVertex(idents[i]);
                graph.addVertex(nodes[i]);
            }
            graph.addEdge(new WeightedEdge(2), nodes[0], nodes[1]);

        } else if (node == PartialToyBuilder.NODE2) {
            // Create a partial graph
            Identity ident = new DummyIdentity("3");
            LabelVertex ver = new LabelVertex(ident);
            graph.addVertex(ver);

        } else if (node == PartialToyBuilder.NODE3) {
            Identity[] idents = {new DummyIdentity("4"),
                                 new DummyIdentity("5")};
            LabelVertex[] nodes = new LabelVertex[2];
            for (int i = 0; i < nodes.length; i++) {
                nodes[i] = new LabelVertex(idents[i]);
                graph.addVertex(nodes[i]);
            }
            graph.addEdge(new WeightedEdge(), nodes[0], nodes[1]);
        }
        return Graphs.unmodifiableUndirectedGraph(graph);
    }
View Full Code Here
214
215
216
217
218
219
220
221
222
223
224
225
226
227
                    // edge if the identity isn't the owner
                    if (!ident.equals(owner)) {
                        LabelVertex vident = addOrGetVertex(ident);
                        // Check to see if we already have an edge between
                        // the two vertices.  If so, update its weight.
                        WeightedEdge edge =
                                affinityGraph.findEdge(vowner, vident);
                        if (edge == null) {
                            WeightedEdge newEdge = new WeightedEdge();
                            affinityGraph.addEdge(newEdge, vowner, vident);
                            // period info
                            pruneTask.incrementEdge(newEdge);
                        } else {
                            if (currentVal <= entry.getValue()) {
View Full Code Here
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
            synchronized (affinityGraph) {
                // For each modified edge in the graph, update weights
                for (Map.Entry<WeightedEdge, Integer> entry :
                     periodEdgeIncrements.entrySet())
                {
                    WeightedEdge edge = entry.getKey();
                    int weight = entry.getValue();
                    if (edge.getWeight() == weight) {
                        Pair<LabelVertex> endpts =
                                affinityGraph.getEndpoints(edge);
                        affinityGraph.removeEdge(edge);
                        for (LabelVertex end : endpts) {
                            if (affinityGraph.degree(end) == 0) {
                                affinityGraph.removeVertex(end);
                                identMap.remove(end.getIdentity());
                            }
                        }
                    } else {
                        edge.addWeight(-weight);
                    }
                }
            }

            stats.processingTimeInc(System.currentTimeMillis() - startTime);
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
248
249
250
                    // edge if the identity isn't the owner
                    if (!ident.equals(owner)) {
                        LabelVertex vident = addOrGetVertex(ident);
                        // Check to see if we already have an edge between
                        // the two vertices.  If so, update its weight.
                        WeightedEdge edge =
                                affinityGraph.findEdge(vowner, vident);
                        if (edge == null) {
                            WeightedEdge newEdge = new WeightedEdge();
                            affinityGraph.addEdge(newEdge, vowner, vident);
                            // period info
                            pruneTask.incrementEdge(newEdge);
                        } else {
                            if (currentVal <= entry.getValue()) {
View Full Code Here
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
            synchronized (affinityGraph) {
                // For each modified edge in the graph, update weights
                for (Map.Entry<WeightedEdge, Integer> entry :
                     periodEdgeIncrements.entrySet())
                {
                    WeightedEdge edge = entry.getKey();
                    int weight = entry.getValue();
                    if (edge.getWeight() == weight) {
                        Pair<LabelVertex> endpts =
                                affinityGraph.getEndpoints(edge);
                        affinityGraph.removeEdge(edge);
                        for (LabelVertex end : endpts) {
                            if (affinityGraph.degree(end) == 0) {
                                affinityGraph.removeVertex(end);
                                identMap.remove(end.getIdentity());
                            }
                        }
                    } else {
                        edge.addWeight(-weight);
                    }
                }
            }

            // For each conflict, update values
View Full Code Here
TOP

Related Classes of com.sun.sgs.impl.service.nodemap.affinity.graph.WeightedEdge

  • com.sun.sgs.impl.service.nodemap.affinity.dlpa.graph.BipartiteGraphBuilder
  • com.sun.sgs.impl.service.nodemap.affinity.dlpa.graph.BipartiteGraphBuilder$PruneTask
  • com.sun.sgs.impl.service.nodemap.affinity.dlpa.graph.WeightedGraphBuilder
  • com.sun.sgs.impl.service.nodemap.affinity.dlpa.graph.WeightedGraphBuilder$PruneTask
  • com.sun.sgs.impl.service.nodemap.affinity.single.SingleGraphBuilder
  • com.sun.sgs.impl.service.nodemap.affinity.single.SingleGraphBuilder$PruneTask
  • com.sun.sgs.test.impl.service.nodemap.affinity.TestAffinityGroupGoodness$TestToyBuilder
  • com.sun.sgs.test.impl.service.nodemap.affinity.TestAffinityGroupGoodness$TestToyWeightBuilder
  • com.sun.sgs.test.impl.service.nodemap.affinity.TestLPA
  • com.sun.sgs.test.impl.service.nodemap.affinity.TestLPAPerf$DistributedZachBuilder
    • 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.