Zhikai Wang Homepage

Heteroclinic.net logo

www.heteroclinic.net

	Advanced Concurrency Topic: Runtime Deadlock Detection XVII Treetorplus2 and Treetor Functional Requirements 05 Forest Ministry Treetor now can render simply forest or basic tree operations. We realease Treetorplus2 treetorplus2.jar,treetorLicesnse.txt
	Advanced Concurrency Topic: Runtime Deadlock Detection XVIII Treetoplus2 Forest Ministry Test Case Test case of rendering a very simple forest: package net.heteroclinic.graphtest; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; import net.heteroclinic.graph.GraphBorder; import net.heteroclinic.graph.GraphOrientation; import net.heteroclinic.graph.Node; import net.heteroclinic.graph.Nodetype; import net.heteroclinic.graph.RNode; import net.heteroclinic.graph.TNode; import net.heteroclinic.graph.Test; public class Test20121111_I extends net.heteroclinic.graph.Test { /** * @param args / public static void main(String[] args) { // TODO Auto-generated method stub Bag.tierdistance = 10.0d; Bag.nodesize = 2.5d; Bag.nodespace = 1.3d Bag.nodesize; Bag.familydistance = 2.0d * Bag.nodespace; Bag.boderspace = 3.0d * Bag.nodespace; Bag.OneDoubleequalpixels = 15; Bag.fontsize = 14; Bag.fontwidth = 8; // not accurate. Bag.edgetrim = 1.5d; // ratio Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; Bag.testunitname = "RTNODE_FOREST"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // // TODO Auto-generated method stub // new Node(); //1/1 // new Node();//2/6 // // // new Node();//1/2 // new Node();//2/3 // new Node();//3/4 // new Node();//4/5 ForestMinistry.createANode(Nodetype.TNODE); ForestMinistry.createANode(Nodetype.RNODE); ForestMinistry.createANode(Nodetype.RNODE); ForestMinistry.createANode(Nodetype.RNODE); ForestMinistry.createANode(Nodetype.RNODE); ForestMinistry.createANode(Nodetype.TNODE); ForestMinistry.setNodeSubnodePair(1l, 2l); ForestMinistry.setNodeSubnodePair(1l, 3l); ForestMinistry.setNodeSubnodePair(6l, 4l); ForestMinistry.setNodeSubnodePair(6l, 5l); ForestMinistry.addAVirtaulEdge(1l, 4l); ForestMinistry.print(); GraphBorder base_graphborder = ForestMinistry.constructForest(); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); } }
	Advanced Concurrency Topic: Runtime Deadlock Detection XIX Visualization of an Imaginary Concurrency Event We spent much effort to implement functional requirement 05. What is the purpose for doing such? We attach the following program to show an imaginary concurrent event, which is figured out by the author. If you would give a name of such event, what will it be? Such event is good or bad? In coming episodes, we are going to build real concurrent prototypes to demonstrate such behavior. We may or may not. Have we demostrated a solution for such behavior in our previous coding projects, implicitly or explicitly? Please leave your comment! An imaginary concurrency event, good or bad? What are you trying to do? package net.heteroclinic.graphtest; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; import net.heteroclinic.graph.GraphBorder; import net.heteroclinic.graph.GraphOrientation; import net.heteroclinic.graph.Nodetype; import net.heteroclinic.graph.Test; public class Test20121111_II extends net.heteroclinic.graph.Test { public static void main(String[] args) { // TODO Auto-generated method stub Bag.tierdistance = 10.0d; Bag.nodesize = 2.5d; Bag.nodespace = 1.3d * Bag.nodesize; Bag.familydistance = 2.0d * Bag.nodespace; Bag.boderspace = 3.0d * Bag.nodespace; Bag.OneDoubleequalpixels = 15; Bag.fontsize = 14; Bag.fontwidth = 8; // not accurate. Bag.edgetrim = 1.5d; // ratio Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; Bag.testunitname = "LIVELOCK_TEST"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // // TODO Auto-generated method stub // new Node(); //1/1 // new Node();//2/6 // // // new Node();//1/2 // new Node();//2/3 // new Node();//3/4 // new Node();//4/5 ForestMinistry.createANode(Nodetype.TNODE); ForestMinistry.createANode(Nodetype.TNODE); ForestMinistry.createANode(Nodetype.RNODE,-1l); ForestMinistry.createANode(Nodetype.RNODE,-1l); ForestMinistry.createANode(Nodetype.RNODE,-1l); ForestMinistry.createANode(Nodetype.RNODE,-1l); ForestMinistry.setNodeSubnodePair(1l, 3l); ForestMinistry.setNodeSubnodePair(2l, 5l); ForestMinistry.setNodeSubnodePair(1l, 4l); ForestMinistry.setNodeSubnodePair(2l, 6l); ForestMinistry.addAVirtaulEdge(1l, 5l); ForestMinistry.setNodeSubnodePair(5l, 1l); ForestMinistry.removeAVirtualEdge(1l, 5l); // // ForestMinistry.addAVirtaulEdge(2l, 3l); ForestMinistry.removeNodeSubnodePair(2l, 5l,3); ForestMinistry.removeAVirtualEdge(2l, 3l); ForestMinistry.removeNodeSubnodePair(5l, 1l,1); ForestMinistry.setNodeSubnodePair(1l, 5l); ForestMinistry.addAVirtaulEdge(2l, 5l); ForestMinistry.setNodeSubnodePair(5l, 2l); ForestMinistry.removeAVirtualEdge(2l, 5l); ForestMinistry.addAVirtaulEdge(1l, 6l); ForestMinistry.removeNodeSubnodePair(1l, 5l,3); ForestMinistry.removeNodeSubnodePair(5l, 2l,1); ForestMinistry.setNodeSubnodePair(2l, 5l); ForestMinistry.removeAVirtualEdge(1l, 6l); ForestMinistry.addAVirtaulEdge(1l, 5l); //ForestMinistry.print(); GraphBorder base_graphborder = ForestMinistry.constructForest(); //ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); //System.out.println("Picture drawn."); ForestMinistry.zero(); ForestMinistry.createANode(Nodetype.TNODE); ForestMinistry.createANode(Nodetype.TNODE); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.createANode(Nodetype.RNODE,-1l); ForestMinistry.createANode(Nodetype.RNODE,-1l); ForestMinistry.createANode(Nodetype.RNODE,-1l); ForestMinistry.createANode(Nodetype.RNODE,-1l); ForestMinistry.setNodeSubnodePair(1l, 3l); ForestMinistry.setNodeSubnodePair(2l, 5l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.setNodeSubnodePair(1l, 4l); ForestMinistry.setNodeSubnodePair(2l, 6l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.addAVirtaulEdge(1l, 5l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.setNodeSubnodePair(5l, 1l); ForestMinistry.removeAVirtualEdge(1l, 5l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.addAVirtaulEdge(2l, 3l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.removeNodeSubnodePair(2l, 5l,3); ForestMinistry.removeAVirtualEdge(2l, 3l); ForestMinistry.removeNodeSubnodePair(5l, 1l,1); ForestMinistry.setNodeSubnodePair(1l, 5l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.addAVirtaulEdge(2l, 5l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.setNodeSubnodePair(5l, 2l); ForestMinistry.removeAVirtualEdge(2l, 5l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.addAVirtaulEdge(1l, 6l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.removeNodeSubnodePair(1l, 5l,3); ForestMinistry.removeNodeSubnodePair(5l, 2l,1); ForestMinistry.setNodeSubnodePair(2l, 5l); ForestMinistry.removeAVirtualEdge(1l, 6l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); ForestMinistry.addAVirtaulEdge(1l, 5l); ForestMinistry.constructForest(base_graphborder); ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); System.out.println("Picture drawn."); // // ForestMinistry.createANode(Nodetype.TNODE); // ForestMinistry.createANode(Nodetype.TNODE); // // ForestMinistry.constructForest(base_graphborder); // ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); // System.out.println("Picture drawn."); // // ForestMinistry.createANode(Nodetype.RNODE); // ForestMinistry.createANode(Nodetype.RNODE); // ForestMinistry.setNodeSubnodePair(1l, 3l); // ForestMinistry.setNodeSubnodePair(2l, 4l); // // ForestMinistry.constructForest(base_graphborder); // ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); // System.out.println("Picture drawn."); // ForestMinistry.createANode(Nodetype.RNODE); // ForestMinistry.createANode(Nodetype.RNODE); // ForestMinistry.setNodeSubnodePair(1l, 5l); // ForestMinistry.setNodeSubnodePair(2l, 6l); // // ForestMinistry.constructForest(base_graphborder); // ForestMinistry.forest2drender(Test.getAResultFilename(),base_graphborder, GraphOrientation.ToptoBottom); // System.out.println("Picture drawn."); } }
	Advanced Concurrency Topic: Runtime Deadlock Detection XX Visualization Results of XIX Animation PNGs: Figure 01 Figure 02 Figure 03 Figure 04 Figure 05 Figure 06 Figure 07 Figure 08 Figure 09 Figure 10 Figure 11 Figure 12

An imaginary concurrency event, good or bad? What are you trying to do?