Zhikai Wang Homepage

Treetor: tree visualization tool and JDFR

Heteroclinic.net logo

www.heteroclinic.net

Advanced Concurrency Topic:
Runtime Deadlock Detection IX
Tree Graph Analysis 1/4

1.Intrudction

We continue the analysis of deadlock problem by studying the features of tree type graph.

2.Tree and its number of edges

We can consider a {\it tree} is a graph that has only one root node. From this root node, we can reach any one of the other nodes and the path is unique (the vertexes/nodes edges sequence is unique). Normally we consider tree is un-directed graph. However, if we consider every edge is bi-directional, it will give us great advantage. In the practice of this article, we use the parent node to sub-node direction to construct the graph, the sub-node to parent node direction to uniquely identify a node.

Corollary 2.1 A tree with $n$ nodes has $n-1$ edges, $n \in \mathbb{N}$.

Advanced Concurrency Topic:
Runtime Deadlock Detection X
Tree Graph Analysis 2/4

3.Tree and connected graph

Corollary 3.1 A connected graph with $n$ nodes and $n-1$ edges is a-cyclic $\iff$ it is a tree, $n \in \mathbb{N}$.

4.Conclusion from above sections

From the discussion in the above sections, we can draw some very important conclusions. Here, we leave them to the readers as a brain exercise.\\ We show these conclusions in our coding projects.

5.A tree utility program, BFS and DFS traversal

We attach Java program that can be use to construct a tree. After the tree is constructed, we can use BFS or DFS to print the tree. The readers will also see the program will assist the proper construction of a tree.

6.Treetor a snapshot tool

Treetor is a visualization tool of a tree. We use it to render a tree to jpeg file. Unfortunately, it can not create a file has more than 65,500 pixels. In next phase, we will move to OpenGL, theoretically, we will not have a soft limit as javax.imageio.

7.Discussion

This article is not peer reviewed. The attached coding projects are not either. If you find some errors or you want to give some comments, please contact the author. Corollary 2.1 and Corollary 3.1 are not new inventions, you can refer to general computer science or mathematics texts. Advanced Concurrency Topic:
Runtime Deadlock Detection XI
Tree Graph Analysis 3/4
A tree utility program, BFS and DFS traversal

A small utility program Node.java

/* * Author: Zhikai Wang www.heteroclinic.net * Sep 2012 * * You can do anything with this program. Please keep this header! * * There is NOT any guarantee for this program. * */ import java.util.Iterator; import java.util.LinkedHashMap; import java.util.Map; import java.util.concurrent.ConcurrentHashMap; import java.util.concurrent.atomic.AtomicLong; public class Node { // Below is Node, //above is RenderableNode public static Map<Long, Node> allnodes = new ConcurrentHashMap<Long, Node>(); protected static AtomicLong counter = new AtomicLong(0L); protected Map<Long, Node> subnodes = new LinkedHashMap<Long, Node>(); public Map<Long, Node> getSubnodes() { return subnodes; } protected long id = -1L; protected Node parentnode = null; public Node getParentnode() { return parentnode; } public long getFamilyId () { if (parentnode == null) return 0; else return parentnode.getId(); } public boolean addAChild (Node child ) { return subnodes.put(child.getId(), child) != null; } public void setParentnode(Node parentnode) { this.parentnode = parentnode; } protected String label; public String toString () { return label; } public Node() { id = counter.incrementAndGet(); label = ""+id; allnodes.put(this.getId(), this); } public Node(String label) { this.label = label; id = counter.incrementAndGet(); allnodes.put(this.getId(), this); } public long getId() { return id; } // level starting from 0L to ... public long getLevel() { if (null == this.getParentnode()) return 0L; else return this.getParentnode().getLevel() + 1L; } public void DFSprint(String header) { if (subnodes == null || subnodes.size() == 0) { String tmps = header + "n|" + this.getId() + "."; System.out.println(tmps); } else { Iterator<Long> it = subnodes.keySet().iterator(); while (it.hasNext()) { Long key = it.next(); Node tmpn = subnodes.get(key); tmpn.DFSprint(header + "n|" + this.getId() + "->\t"); } } } static final double doubleconverttopixelratio = 20d; public int doubletopixel (double val) { return (int)(doubleconverttopixelratio*val); } public void BFSprint() { Map<Long, Node> stack = new LinkedHashMap<Long, Node> (); System.out.println(this.getId()); //stack.putAll(this.getSubnodes()); stack.put(this.getId(), this); Map<Long, Node> tmpstack = new LinkedHashMap<Long, Node> (); Map<Long, Node> stackref = null; while (stack.size() > 0 ) { tmpstack.clear(); Iterator<Long> it = stack.keySet().iterator(); while (it.hasNext()) { String tmp = ""; Node tn = stack.get(it.next()); Map<Long, Node> subnodes = tn.getSubnodes(); Iterator<Long> it2 = subnodes.keySet().iterator(); int c = 0; while (it2.hasNext()) { if (c == 0) { Long l2 = it2.next(); Node tcn = subnodes.get(l2); tmp += (tcn.getParentnode().getId() + "-"); tmp += l2; } else tmp += it2.next(); tmp += " "; c++; } tmp += "\t"; System.out.print(tmp); tmpstack.putAll(subnodes); } System.out.println(); stackref = tmpstack; tmpstack = stack; stack = stackref; } } // TODO make it thread safe // TODO you have not detect cycle yet public static int addNodeSubnodePair(long parentnodeid, long childnodeid) { //System.out.println("["+parentnodeid+","+childnodeid+"]" ); //System.out.println("Node.addNodeSubnodePair("+ parentnodeid+","+childnodeid+");"); Node parent = Node.allnodes.get(parentnodeid); if (parent == null) return -1; Node child = Node.allnodes.get(childnodeid); if (child.getParentnode() != null) return -4; parent.addAChild(child); child.setParentnode(parent); return 1; } public static void main(String[] args) { for (int i = 0; i < 30; i++) { new Node(); } Node.addNodeSubnodePair(1l, 2l); Node.addNodeSubnodePair(2l, 6l); Node.addNodeSubnodePair(1l, 3l); Node.addNodeSubnodePair(1l, 4l); Node.addNodeSubnodePair(3l, 5l); Node.addNodeSubnodePair(3l, 7l); Node.addNodeSubnodePair(3l, 8l); Node.addNodeSubnodePair(4l, 11l); Node.addNodeSubnodePair(11l, 9l); Node.addNodeSubnodePair(11l, 10l); Node.addNodeSubnodePair(11l, 12l); System.out.println("DFS:"); Node.allnodes.get(1l).DFSprint(""); System.out.println("\nBFS:"); Node.allnodes.get(1l).BFSprint(); } }

Advanced Concurrency Topic:
Runtime Deadlock Detection XII
Tree Graph Analysis 4/4
Treetor a snapshot tool Treetor is a visualization tool of a tree. We use it to render a tree to jpeg file. Unfortunately, it can not create a file has more than 65500 pixels. In the next phase, we will move to OpenGL, theoretically, we will not have a soft limit as javax.imageio.
treetor.jar
treetorLicesnse.txt

Test.java Case I result

Test.java Case II result
Download, view with a graphics tool like Microsoft paint or GIMP etc. Test.java Case II result

A small test program Test.java

import java.util.Calendar; import java.util.Random; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.GraphOrientation; import net.heteroclinic.graph.Node; public class Test { public static void main(String[] args) { Bag.tierdistance = 5.0d; Bag.nodesize = 1.6d; Bag.nodespace = 1.3d * Bag.nodesize; Bag.familydistance = 2.0d * Bag.nodespace; Bag.graphboder = 3.0d * Bag.nodespace; Bag.OneDoubleequalpixels = 15; Bag.fontsize = 14; Bag.fontwidth = 8; // not accurate. Bag.edgetrim = 1.5d; // ratio // //If int nodeslimit = 4096*2 or more, you may get an exception. // javax.imageio.IIOException: Maximum supported image dimension is // 65500 pixels // 1 // at com.sun.imageio.plugins.jpeg.JPEGImageWriter.writeImage(Native // Method) // at // com.sun.imageio.plugins.jpeg.JPEGImageWriter.writeOnThread(JPEGImageWriter.java:1055) // at // com.sun.imageio.plugins.jpeg.JPEGImageWriter.write(JPEGImageWriter.java:357) // at javax.imageio.ImageWriter.write(ImageWriter.java:615) // at javax.imageio.ImageIO.doWrite(ImageIO.java:1612) // at javax.imageio.ImageIO.write(ImageIO.java:1578) // at net.heteroclinic.graph.Node.image2dRender(Node.java:403) // at net.heteroclinic.graph.Node.main(Node.java:811) int nodeslimit = 4096*2; Node n = new Node(); Random rand = new Random(Calendar.getInstance().getTimeInMillis() % (13 * 11)); for (int i = 1; i < nodeslimit; i++) { int pnode = rand.nextInt(Node.allnodes.size()); n = new Node(); Node.addNodeSubnodePair(pnode + 1, n.getId()); } Node.allnodes.get(12l).BFSGraphConstruction(); Node.allnodes.get(12l).image2dRender( "C:\\" + Calendar.getInstance().getTimeInMillis() + ".jpeg", GraphOrientation.LefttoRight); Node.allnodes.get(1l).BFSprint(); } public static void main_caseI(String[] args) { for (int i = 0; i < 30; i++) { new Node(); } Node.addNodeSubnodePair(1l, 2l); Node.addNodeSubnodePair(2l, 6l); Node.addNodeSubnodePair(1l, 3l); Node.addNodeSubnodePair(1l, 4l); Node.addNodeSubnodePair(3l, 5l); Node.addNodeSubnodePair(3l, 7l); Node.addNodeSubnodePair(3l, 8l); Node.addNodeSubnodePair(4l, 11l); Node.addNodeSubnodePair(11l, 9l); Node.addNodeSubnodePair(11l, 10l); Node.addNodeSubnodePair(11l, 12l); Node.allnodes.get(1l).BFSGraphConstruction(); Node.allnodes.get(1l).image2dRender( "C:\\Users\\Graphics\\Desktop\\" + Calendar.getInstance().getTimeInMillis() + ".jpeg", GraphOrientation.LefttoRight); } }

Advanced Concurrency Topic:
Runtime Deadlock Detection XIII
Treetorplus1 and Treetor Functional Requirements 01
Change Graph Orientation Treetor is a visualization tool of a tree. Now we realease Treetorplus1 treetorplus1.jar,treetorLicesnse.txt

Test Case

package net.heteroclinic.graphtest;

import java.util.Calendar;
import java.util.LinkedList;
import java.util.Random;

import net.heteroclinic.graph.Bag;
import net.heteroclinic.graph.GraphOrientation;
import net.heteroclinic.graph.Node;
import net.heteroclinic.graph.Test;

public class Test20120927_II extends Test {

	//PNG works for getPower(  2,12);
	public static void main(String[] args) {
		Bag.tierdistance = 8.0d;
		Bag.nodesize = 1.6d;
		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 = "CONSTR-OREINT";
		Bag.testresultfiletype = ".png";

		int nodeslimit =getPower(  2,5);
		Node n = new Node();
		Random rand = new Random(Calendar.getInstance().getTimeInMillis()
				% 111335);
		
//		//Case I this will make the smaller number nodes dense
//		for (int i = 1; i < nodeslimit; i++) {
//			int pnode = rand.nextInt(Node.allnodes.size());
//			n = new Node();
//
//			Node.addNodeSubnodePair(pnode + 1, n.getId());
//		}
		
		
		//int powerladder = 1;
		//Case II this will make the smaller number nodes dense
		for (int i = 1; i < nodeslimit; i++) {
			//int pnode = rand.nextInt(Node.allnodes.size());
			n = new Node();

			//Node.addNodeSubnodePair(pnode + 1, n.getId());
		}
		

		
		LinkedList <Long >  llleft= new LinkedList<Long> ();
		LinkedList <Long > llright = new LinkedList<Long> ();
		for (int i = 0; i< nodeslimit; i++) {
			llleft.add((long) (i+1));
		}
		long count = 1;
		llright.add(1l);
		llleft.remove(1l);
		while (llright.size() < nodeslimit ) {
			int index1 = rand.nextInt(llleft.size());
			
			int index2 = rand.nextInt(llright.size());
			
			long parentnodeid = llright.get(index2);
			
			long childnodeid = llleft.get(index1);
			
			Node.addNodeSubnodePair(parentnodeid, childnodeid);
			llright.add(childnodeid);
			
			llleft.remove(index1);

			count++;
		}
		System.out.println("Tree constructed after "+count+" ops.");
		
		
		
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRender(Test.getAResultFilename(),
				GraphOrientation.LefttoRight);
		System.out.println("Picture drawn.");
		
		Node.allnodes.get(1l).image2dRender(Test.getAResultFilename(),
				GraphOrientation.RighttoLeft);
		System.out.println("Picture drawn.");

		Node.allnodes.get(1l).image2dRender(Test.getAResultFilename(),
				GraphOrientation.ToptoBottom);
		System.out.println("Picture drawn.");
		Node.allnodes.get(1l).image2dRender(Test.getAResultFilename(),
				GraphOrientation.BottomtoTop);
		System.out.println("Picture drawn.");

		//Node.allnodes.get(1l).BFSprint();
	}

}

Advanced Concurrency Topic:
Runtime Deadlock Detection XIV
Treetoplus1 and Treetor Functional Requirements 02
Build a T-Node Tree

Test Case

package net.heteroclinic.graphtest;

import java.util.Calendar;
import java.util.LinkedList;
import java.util.Random;

import net.heteroclinic.graph.Bag;
import net.heteroclinic.graph.GraphOrientation;
import net.heteroclinic.graph.Node;
import net.heteroclinic.graph.RNode;
import net.heteroclinic.graph.TNode;
import net.heteroclinic.graph.Test;

public class Test20121008_I extends Test{

	public static void main(String[] args) {
		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 = "TEST_RNODE_TREE";
		Bag.testresultfiletype = ".png";

	

		int nodeslimit =getPower(  2,8);
		Node n = new Node();
		Random rand = new Random(Calendar.getInstance().getTimeInMillis()
		 		% 111335);
		

		
		for (int i = 1; i < nodeslimit; i++) {
			n = new RNode();
			n.setFillcolor(255, 110, 110);

		}
		

		
		LinkedList <Long >  llleft= new LinkedList<Long> ();
		LinkedList <Long > llright = new LinkedList<Long> ();
		for (int i = 0; i< nodeslimit; i++) {
			llleft.add((long) (i+1));
		}
		long count = 1;
		llright.add(1l);
		llleft.remove(1l);
		while (llright.size() < nodeslimit ) {
			int index1 = rand.nextInt(llleft.size());
			
			int index2 = rand.nextInt(llright.size());
			
			long parentnodeid = llright.get(index2);
			
			long childnodeid = llleft.get(index1);
			
			Node.addNodeSubnodePair(parentnodeid, childnodeid);
			llright.add(childnodeid);
			
			llleft.remove(index1);

			count++;
		}
		System.out.println("Tree constructed after "+count+" ops.");
		
	
		
		Node.allnodes.get(1l).BFSGraphConstruction();
//		Node.allnodes.get(1l).image2dRender(
//				"C:\\Users\\Graphics\\Desktop\\"
//						+ Calendar.getInstance().getTimeInMillis() + ".png",
//				GraphOrientation.LefttoRight);
//		System.out.println("Picture drawn.");
		
		//TEST TOP to bottom
		Node.allnodes.get(1l).image2dRender(Test.getAResultFilename(),
				GraphOrientation.ToptoBottom);
		System.out.println("Picture drawn.");
		
//		Node.allnodes.get(1l).image2dRender(
//				"C:\\Users\\Graphics\\Desktop\\"
//						+ Calendar.getInstance().getTimeInMillis() + ".png",
//				GraphOrientation.RighttoLeft);
//		System.out.println("Picture drawn.");
//
//		
//		Node.allnodes.get(1l).image2dRender(
//				"C:\\Users\\Graphics\\Desktop\\"
//						+ Calendar.getInstance().getTimeInMillis() + ".png",
//				GraphOrientation.LefttoRight);
//		System.out.println("Picture drawn.");
//
//		Node.allnodes.get(1l).image2dRender(
//				"C:\\Users\\Graphics\\Desktop\\"
//						+ Calendar.getInstance().getTimeInMillis() + ".png",
//				GraphOrientation.BottomtoTop);
//		System.out.println("Picture drawn.");	
		//Node.allnodes.get(1l).BFSprint();
	}	
	
}

Advanced Concurrency Topic:
Runtime Deadlock Detection XV
Treetorplus1 and Treetor Functional Requirements 03
Build a R-Node Tree

Test Case

package net.heteroclinic.graphtest;

import java.util.Calendar;
import java.util.LinkedList;
import java.util.Random;

import net.heteroclinic.graph.Bag;
import net.heteroclinic.graph.GraphOrientation;
import net.heteroclinic.graph.Node;
import net.heteroclinic.graph.RNode;
import net.heteroclinic.graph.TNode;
import net.heteroclinic.graph.Test;

public class Test20121008_II extends Test{

	public static void main(String[] args) {
		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 = "TEST_TNODE_TREE";
		Bag.testresultfiletype = ".png";

	

		int nodeslimit =getPower(  2,8);
		Node n = new Node();
		Random rand = new Random(Calendar.getInstance().getTimeInMillis()
		 		% 111335);
		

		
		for (int i = 1; i < nodeslimit; i++) {
			n = new TNode();
			n.setFillcolor(255, 220, 0);

		}
		

		
		LinkedList <Long >  llleft= new LinkedList<Long> ();
		LinkedList <Long > llright = new LinkedList<Long> ();
		for (int i = 0; i< nodeslimit; i++) {
			llleft.add((long) (i+1));
		}
		long count = 1;
		llright.add(1l);
		llleft.remove(1l);
		while (llright.size() < nodeslimit ) {
			int index1 = rand.nextInt(llleft.size());
			
			int index2 = rand.nextInt(llright.size());
			
			long parentnodeid = llright.get(index2);
			
			long childnodeid = llleft.get(index1);
			
			Node.addNodeSubnodePair(parentnodeid, childnodeid);
			llright.add(childnodeid);
			
			llleft.remove(index1);

			count++;
		}
		System.out.println("Tree constructed after "+count+" ops.");
		
		//TODO ?? both case I and case II biased to north?
		
		
		Node.allnodes.get(1l).BFSGraphConstruction();
//		Node.allnodes.get(1l).image2dRender(
//				"C:\\Users\\Graphics\\Desktop\\"
//						+ Calendar.getInstance().getTimeInMillis() + ".png",
//				GraphOrientation.LefttoRight);
//		System.out.println("Picture drawn.");
		
		//TEST TOP to bottom
		Node.allnodes.get(1l).image2dRender(Test.getAResultFilename(),
				GraphOrientation.ToptoBottom);
		System.out.println("Picture drawn.");
		
//		Node.allnodes.get(1l).image2dRender(
//				"C:\\Users\\Graphics\\Desktop\\"
//						+ Calendar.getInstance().getTimeInMillis() + ".png",
//				GraphOrientation.RighttoLeft);
//		System.out.println("Picture drawn.");
//
//		
//		Node.allnodes.get(1l).image2dRender(
//				"C:\\Users\\Graphics\\Desktop\\"
//						+ Calendar.getInstance().getTimeInMillis() + ".png",
//				GraphOrientation.LefttoRight);
//		System.out.println("Picture drawn.");
//
//		Node.allnodes.get(1l).image2dRender(
//				"C:\\Users\\Graphics\\Desktop\\"
//						+ Calendar.getInstance().getTimeInMillis() + ".png",
//				GraphOrientation.BottomtoTop);
//		System.out.println("Picture drawn.");	
		//Node.allnodes.get(1l).BFSprint();
	}	
	
}

Advanced Concurrency Topic:
Runtime Deadlock Detection XVI
Treetorplus1 and Treetor Functional Requirements 04
Build a RT-Node Tree

Test Case

package net.heteroclinic.graphtest;

import java.util.Calendar;

import net.heteroclinic.graph.Bag;
import net.heteroclinic.graph.GraphBorder;
import net.heteroclinic.graph.GraphOrientation;
import net.heteroclinic.graph.Node;
import net.heteroclinic.graph.RNode;
import net.heteroclinic.graph.TNode;
import net.heteroclinic.graph.Test;

public class Test20121017 extends 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 = "TEST_RTNODE_TREE";
		Bag.testresultfiletype = ".png";

		
		// TODO Auto-generated method stub
		new TNode(); //1/1
		new TNode();//2/6
		new TNode();//3/7
		new TNode();//4/8
		new TNode();//5/9
		new TNode();//6/10
		new TNode();//7/12
		new TNode();//8/13
		
		new RNode();//1/2
		new RNode();//2/3
		new RNode();//3/4
		new RNode();//4/5
		new RNode();//5/11
		
		Node.addNodeSubnodePair(1,9);
		Node.addNodeSubnodePair(1,10);
		Node.addNodeSubnodePair(1,11);
		Node.addNodeSubnodePair(1,12);
		
		Node.addNodeSubnodePair(9,2);
		Node.addNodeSubnodePair(9,3);
		
		Node.addNodeSubnodePair(10,4);
		
		Node.addNodeSubnodePair(11,5);
		Node.addNodeSubnodePair(11,6);
		
		Node.addNodeSubnodePair(5,13);
		
		Node.addNodeSubnodePair(13,7);
		Node.addNodeSubnodePair(13,8);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).updateGraphborder();
		GraphBorder base_graphborder  = Node.allnodes.get(1l).getGraphborder();
		//System.out.println( Node.allnodes.get(1l).getGraphborder().getWidth() + "\t"+ Node.allnodes.get(1l).getGraphborder().getHeight());
		
		Node.zero(); 
		
		
		new TNode(); //1/1
		new TNode();//2/6
		new TNode();//3/7
		new TNode();//4/8
		new TNode();//5/9
		new TNode();//6/10
		new TNode();//7/12
		new TNode();//8/13
		
		new RNode();//1/2
		new RNode();//2/3
		new RNode();//3/4
		new RNode();//4/5
		new RNode();//5/11
		
		
		
		Node.addNodeSubnodePair(1,9);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder,GraphOrientation.LefttoRight);

		
		
		Node.addNodeSubnodePair(1,10);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(), base_graphborder,GraphOrientation.LefttoRight);


		
		Node.addNodeSubnodePair(1,11);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);


		Node.addNodeSubnodePair(1,12);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);


		
		Node.addNodeSubnodePair(9,2);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);


		Node.addNodeSubnodePair(9,3);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);


		Node.addNodeSubnodePair(10,4);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);

		
		Node.addNodeSubnodePair(11,5);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);

		Node.addNodeSubnodePair(11,6);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);

		
		Node.addNodeSubnodePair(5,13);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);

		
		Node.addNodeSubnodePair(13,7);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);

		Node.addNodeSubnodePair(13,8);
		Node.allnodes.get(1l).BFSGraphConstruction();
		Node.allnodes.get(1l).image2dRenderWithoutUpdateBorder(Test.getAResultFilename(),base_graphborder, GraphOrientation.LefttoRight);
	}

}

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

Advanced Concurrency Topic:
Runtime Deadlock Detection XXI
Treetorplus3 and jdfrbeta01
Prototype no.1 Just Lock and Unlock Now we realease Treetorplus3 treetorplus3.jar,treetorLicesnse.txt.
We also release jdfrbeta01.jar. 'jdfr' stands for Java Dead-lock Free Runtime. The goal is to design a runtime that will handle general concurrency issues. In the future, we may extend to operating system design/implementation. Or it may not be necessarily to design or implement something new, because we have 'injection' technology. These goals are still far. By now, what are at our hands are four prototypes. So far, we are able to profile basic concurrency events. Please note these prototype will only under the very conditions we pre-set. What works is just what worked! Any above-mentioned goals are huge tasks beyond the limited ability of the author. I spent much time studying java.util.concurrent written by Prof. Doug Lea. It corrects some very critical mis-understandings of mine. Although I am able to build these prototypes using C, C++ etc, without Java, without open source, it won't be so fast. Eclipse Java IDE also provides great help speeding up the work. 'jdfr' is open source. The jar comes with the source code inside.
The first prototype is 'Just Lock and Unlock'.
How to:

java -cp treetorplus3.jar;jdfrbeta01.jar javax.util.concurrent.profilable.test.Test20121201_II .\

You will get the images at the folder specified.

You can also try to modify this file.

/* * jdfr: Java Dead-lock Free Runtime (the goal of this project) * * Author Zhikai Wang/www.heteroclinic.net * * Please keep this header. * * 2012 * */ package javax.util.concurrent.profilable.test; import java.util.ArrayList; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.ProfilableRunnable; import javax.util.concurrent.profilable.locks.ProfilableReentrantLock; import javax.util.concurrent.profilable.messenger.FunctorType; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class Testrun_II extends ProfilableRunnable{ public Testrun_II(CountDownLatch startsignal) { super(startsignal); } @Override public void subContract() { try { LockerRoom.samplelocks[0].lock(); LockerRoom.samplelocks[1].lock(); LockerRoom.samplelocks[2].lock(); try { TimeUnit.MILLISECONDS.sleep(1000); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } } // catch (InterruptedException e) { // // TODO Auto-generated catch block // e.printStackTrace(); // } finally { LockerRoom.samplelocks[0].unlock(); LockerRoom.samplelocks[1].unlock(); LockerRoom.samplelocks[2].unlock(); } } } public class Test20121201_II { // public static ProfilableReentrantLock [] locks = // new ProfilableReentrantLock [10]; // static { // for (int i = 0; i<locks.length; i++) { // locks[i] = new ProfilableReentrantLock(); // } // } /** * @param args * @throws InterruptedException */ public static void main(String[] args) throws InterruptedException { 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 if (args.length >= 1 ) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "PFLB_JUST_LOCK_UNLOCK"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder =true; if ( Bag.forestministryusepresetgraphborder ) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1,0.0,0.0,0.0,0.0,0.0,0.0,31.375,26.0); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); fl.add(exec.submit(new GraphMessenger(startSignal))); fl.add(exec.submit(new Testrun_II( startSignal))); TimeUnit.MILLISECONDS.sleep(2000); exec.shutdown(); for (Future<?> f : fl) f.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

Advanced Concurrency Topic:
Runtime Deadlock Detection XXII
Treetorplus3 and jdfrbeta01
Prototype no.2 Simple Blocker and Blockee How to:

java -cp treetorplus3.jar;jdfrbeta01.jar javax.util.concurrent.profilable.test.Test20121204_I .

You will get the images at the folder specified.

You can also try to modify this file.

/* * jdfr: Java Dead-lock Free Runtime (the goal of this project) * * Author Zhikai Wang/www.heteroclinic.net * * Please keep this header. * * 2012 * */ package javax.util.concurrent.profilable.test; import java.util.ArrayList; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.ProfilableRunnable; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class TestBlockUnblock_blockee extends ProfilableRunnable{ public TestBlockUnblock_blockee(CountDownLatch startsignal) { super(startsignal); } @Override public void subContract() { try { try { TimeUnit.MILLISECONDS.sleep(500); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } LockerRoom.samplelocks[0].lock(); } finally { LockerRoom.samplelocks[0].unlock(); } } } class TestBlockUnblock_blocker extends ProfilableRunnable{ public TestBlockUnblock_blocker(CountDownLatch startsignal) { super(startsignal); } @Override public void subContract() { try { LockerRoom.samplelocks[0].lock(); try { TimeUnit.MILLISECONDS.sleep(2000); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } } finally { LockerRoom.samplelocks[0].unlock(); } } } public class Test20121204_I { /** * @param args * @throws InterruptedException */ public static void main(String[] args) throws InterruptedException { 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 if (args.length >= 1 ) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "PFLB_BLOCK_UNBLOCK_SIMPLE"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder =true; if ( Bag.forestministryusepresetgraphborder ) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1,0.0,0.0,0.0,0.0,0.0,0.0,41.375,29.25); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); //TODO how can we guarantee the static locks' constructors' messages are passed? because the message queue is static. We can buffer messages even Messenger thread is not started. fl.add(exec.submit(new GraphMessenger(startSignal))); fl.add(exec.submit(new TestBlockUnblock_blocker( startSignal))); fl.add(exec.submit(new TestBlockUnblock_blockee( startSignal))); TimeUnit.MILLISECONDS.sleep(4000); exec.shutdown(); for (Future<?> f : fl) f.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

Advanced Concurrency Topic:
Runtime Deadlock Detection XXIII
Treetorplus3 and jdfrbeta01
Prototype no.3 A More Complex Blocker and Blockee How to:

java -cp treetorplus3.jar;jdfrbeta01.jar javax.util.concurrent.profilable.test.Test20121209_BLOKER_BLOKEE_COMLEX .\

You will get the images at the folder specified.

You can also try to modify this file.

/* * jdfr: Java Dead-lock Free Runtime (the goal of this project) * * Author Zhikai Wang/www.heteroclinic.net * * Please keep this header. * * 2012 * */ package javax.util.concurrent.profilable.test; import java.util.ArrayList; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.ProfilableRunnable; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class TestBlockUnblock_blockee_complex extends ProfilableRunnable{ public TestBlockUnblock_blockee_complex(CountDownLatch startsignal) { super(startsignal); } @Override public void subContract() { try { LockerRoom.samplelocks[1].lock(); LockerRoom.samplelocks[2].lock(); try { TimeUnit.MILLISECONDS.sleep(500); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } LockerRoom.samplelocks[0].lock(); } finally { LockerRoom.samplelocks[0].unlock(); LockerRoom.samplelocks[1].unlock(); LockerRoom.samplelocks[2].unlock(); } } } class TestBlockUnblock_blocker_complex extends ProfilableRunnable{ public TestBlockUnblock_blocker_complex(CountDownLatch startsignal) { super(startsignal); } @Override public void subContract() { try { LockerRoom.samplelocks[3].lock(); LockerRoom.samplelocks[4].lock(); LockerRoom.samplelocks[0].lock(); try { TimeUnit.MILLISECONDS.sleep(2000); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } } finally { LockerRoom.samplelocks[0].unlock(); LockerRoom.samplelocks[3].unlock(); LockerRoom.samplelocks[4].unlock(); } } } public class Test20121209_BLOKER_BLOKEE_COMLEX { public static void main(String[] args) throws InterruptedException { 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 if (args.length >= 1 ) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "PROFLB_BLOKER_BLOKEE_COMLEX"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder =true; if ( Bag.forestministryusepresetgraphborder ) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1,0.0,0.0,0.0,0.0,0.0,0.0,51.375,39.0); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); fl.add(exec.submit(new GraphMessenger(startSignal))); fl.add(exec.submit(new TestBlockUnblock_blockee_complex( startSignal))); fl.add(exec.submit(new TestBlockUnblock_blocker_complex( startSignal))); TimeUnit.MILLISECONDS.sleep(10000); exec.shutdown(); for (Future<?> f : fl) f.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

Advanced Concurrency Topic:
Runtime Deadlock Detection XXIV
Treetorplus3 and jdfrbeta01
Prototype no.4 A Simple Dead-lock Profiled How to:

java -cp treetorplus3.jar;jdfrbeta01.jar javax.util.concurrent.profilable.test.Test20121210_DEAD_LOCK_VISUAL .\

You will get the images at the folder specified.
After the dead-lock is formed, the program will not stop unless a forced ctrl-C. The late tryer caused the dead-lock is painted by 'stop-sign' color.
If you find any errors or you want to leave other comments, please send me email.

You can also try to modify this file.

/* * jdfr: Java Dead-lock Free Runtime (the goal of this project) * * Author Zhikai Wang/www.heteroclinic.net * * Please keep this header. * * 2012 * */ package javax.util.concurrent.profilable.test; import java.util.ArrayList; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.ProfilableRunnable; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class DLRunholder extends ProfilableRunnable{ public DLRunholder(CountDownLatch startsignal) { super(startsignal); } @Override public void subContract() { try { LockerRoom.samplelocks[1].lock(); LockerRoom.samplelocks[2].lock(); try { TimeUnit.MILLISECONDS.sleep(500); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } LockerRoom.samplelocks[0].lock(); } finally { LockerRoom.samplelocks[0].unlock(); LockerRoom.samplelocks[1].unlock(); LockerRoom.samplelocks[2].unlock(); } } } class DLRuntryer extends ProfilableRunnable{ public DLRuntryer(CountDownLatch startsignal) { super(startsignal); } @Override public void subContract() { try { LockerRoom.samplelocks[0].lock(); LockerRoom.samplelocks[3].lock(); try { TimeUnit.MILLISECONDS.sleep(500); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } LockerRoom.samplelocks[2].lock(); } finally { LockerRoom.samplelocks[0].unlock(); LockerRoom.samplelocks[3].unlock(); LockerRoom.samplelocks[2].unlock(); } } } public class Test20121210_DEAD_LOCK_VISUAL { /** * @param args * @throws InterruptedException */ public static void main(String[] args) throws InterruptedException { // 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 if (args.length >= 1 ) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "DEAD_LOCK_VISUAL"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder =true; if ( Bag.forestministryusepresetgraphborder ) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1,0.0,0.0,0.0,0.0,0.0,0.0,51.375,39.0); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); fl.add(exec.submit(new GraphMessenger(startSignal))); fl.add(exec.submit(new DLRuntryer( startSignal))); fl.add(exec.submit(new DLRunholder( startSignal))); TimeUnit.MILLISECONDS.sleep(20000); // when the deadlock is formed, the program will not reach here. exec.shutdown(); for (Future<?> f : fl) f.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

PNGs:

Figure 01

Figure 02

Figure 03

Figure 04

Figure 05

Figure 06

Figure 07

Figure 08

Figure 09

Figure 10

Advanced Concurrency Topic:
Runtime Deadlock Detection XXV
A Bad Prototype Here, we present a bad prototye. We also give some reasons to present it even it is bad.
How to:

java -cp treetorplus3.jar;jdfrbadprototype01.jar javax.util.concurrent.profilable.test.TwoLayersDeadlockImprovisedSolution .\

You would need these two jars: and treetorplus3.jar and jdfrbadprototype01.jar.
You can study the source code inside jdfrbadprototype01.jar. You can also check out the entry point TwoLayersDeadlockImprovisedSolution.java.

package javax.util.concurrent.profilable.test; import java.util.ArrayList; import java.util.Iterator; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.LoopRun; import javax.util.concurrent.profilable.ProfilableRunnable; import javax.util.concurrent.profilable.locks.ProfilableReentrantLock; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class TwoLayersDeadlockImprovisedSolutionTryer1 extends LoopRun { public TwoLayersDeadlockImprovisedSolutionTryer1(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { try { while (!halted) { //LockerRoom.samplelocks[0].lock(); if (LockerRoom.samplelocks[0].tryLock() ) { System.out.println("---- Tryer1: lock0 tried and acquired."); this.locksheld.put(LockerRoom.samplelocks[0].getProfiableId(), LockerRoom.samplelocks[0]); } else { //LockerRoom.samplelocks[0].g long blockerthreadid = LockerRoom.samplelocks[0].getOwnerId(); ProfilableRunnable pr = ProfilableRunnable.dict_threadid_runnableobj.get(blockerthreadid); if ( null != pr.getBlocker() ) { System.out.println("---- Tryer1: lock0 Peer thread blocked."); // the lock we tried's owner is being blocked. if (this.isItHeldbyMe(pr.getBlockerProfilableid()) ) { System.out.println("---- Tryer1: lock0 I hold what Peer thread want."); // we have to handle deadlock here // OK, to avoid deadlock, I will give you just what you want... // But we will see other problems, which will be discussed later. ProfilableReentrantLock lk = this.locksheld.get(pr.getBlockerProfilableid()); this.locksheld.remove(pr.getBlockerProfilableid()); lk.unlock(); System.out.println("---- Tryer1: lock0 yielded."); continue; } else { System.out.println("---- Tryer1: lock0 entering blocked tree. I don't have what it wants."); LockerRoom.samplelocks[0].lock();// try to lock a again, getting the lock or being blocked. } } else { System.out.println("---- Tryer1: lock0 entering blocked tree. The peer is not blocked."); LockerRoom.samplelocks[0].lock();// try to lock a again, getting the lock or being blocked. } } TimeUnit.MILLISECONDS.sleep(2000); //LockerRoom.samplelocks[1].lock(); if (LockerRoom.samplelocks[1].tryLock() ) { System.out.println("---- Tryer1: lock1 tried and acquired."); this.locksheld.put(LockerRoom.samplelocks[1].getProfiableId(), LockerRoom.samplelocks[1]); } else { //LockerRoom.samplelocks[1].g long blockerthreadid = LockerRoom.samplelocks[1].getOwnerId(); System.out.println("---- Tryer1: lock1 Peer thread blockerthreadid "+ blockerthreadid); ProfilableRunnable pr = ProfilableRunnable.dict_threadid_runnableobj.get(blockerthreadid); System.out.println("---- Tryer1: lock1 Peer thread blockerthread pr "+ pr.getProfiableId()); if ( null != pr.getBlocker() ) { System.out.println("---- Tryer1: lock1 Peer thread blocked."); // the lock we tried's owner is being blocked. if (this.isItHeldbyMe(pr.getBlockerProfilableid()) ) { System.out.println("---- Tryer1: lock1 I hold what Peer thread want."); // we have to handle deadlock here // OK, to avoid deadlock, I will give you just what you want... // But we will see other problems, which will be discussed later. ProfilableReentrantLock lk = this.locksheld.get(pr.getBlockerProfilableid()); this.locksheld.remove(pr.getBlockerProfilableid()); lk.unlock(); //System.out.println("Tryer 1 yielded."); System.out.println("---- Tryer1: lock1 yielded."); } else { System.out.println("---- Tryer1: lock1 entering blocked tree. I don't have what it wants."); LockerRoom.samplelocks[1].lock();// try to lock a again, getting the lock or being blocked. } } else { System.out.println("---- Tryer1: lock1 entering blocked stutus. The peer is not blocked."); LockerRoom.samplelocks[1].lock();// try to lock a again, getting the lock or being blocked. } } TimeUnit.MILLISECONDS.sleep(500); // LockerRoom.samplelocks[0].unlock(); // LockerRoom.samplelocks[1].unlock(); Iterator<Long> it = this.locksheld.keySet().iterator(); boolean shouldyield = false; if (this.locksheld.size() == 2) shouldyield = true; while (it.hasNext()) { //long key = it.next(); this.locksheld.get(it.next()).unlock(); } this.locksheld.clear(); if (shouldyield) { //Thread.currentThread(); Thread.yield(); } } } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } finally { // LockerRoom.samplelocks[0].unlock(); // LockerRoom.samplelocks[1].unlock(); Iterator<Long> it = this.locksheld.keySet().iterator(); while (it.hasNext()) { //long key = it.next(); this.locksheld.get(it.next()).unlock(); } this.locksheld.clear(); } } } class TwoLayersDeadlockImprovisedSolutionTryer2 extends LoopRun { public TwoLayersDeadlockImprovisedSolutionTryer2(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { try { while (!halted) { //LockerRoom.samplelocks[1].lock(); if (LockerRoom.samplelocks[1].tryLock() ) { System.out.println("---- Tryer2: lock1 tried and acquired."); this.locksheld.put(LockerRoom.samplelocks[1].getProfiableId(), LockerRoom.samplelocks[1]); } else { //LockerRoom.samplelocks[1].g long blockerthreadid = LockerRoom.samplelocks[1].getOwnerId(); ProfilableRunnable pr = ProfilableRunnable.dict_threadid_runnableobj.get(blockerthreadid); if ( null != pr.getBlocker() ) { System.out.println("---- Tryer2: lock1 Peer thread blocked."); // the lock we tried's owner is being blocked. if (this.isItHeldbyMe(pr.getBlockerProfilableid()) ) { System.out.println("---- Tryer2: lock1 I hold what Peer thread want."); // we have to handle deadlock here // OK, to avoid deadlock, I will give you just what you want... // But we will see other problems, which will be discussed later. ProfilableReentrantLock lk = this.locksheld.get(pr.getBlockerProfilableid()); this.locksheld.remove(pr.getBlockerProfilableid()); lk.unlock(); System.out.println("---- Tryer2: lock1 yielded."); continue; } else { System.out.println("---- Tryer2: lock1 entering blocked tree. I don't have what it wants."); LockerRoom.samplelocks[1].lock();// try to lock a again, getting the lock or being blocked. } } else { System.out.println("---- Tryer2: lock1 entering blocked status. The peer is not blocked"); TimeUnit.MILLISECONDS.sleep(200); LockerRoom.samplelocks[1].lock();// try to lock a again, getting the lock or being blocked. } } TimeUnit.MILLISECONDS.sleep(3000); //LockerRoom.samplelocks[0].lock(); if (LockerRoom.samplelocks[0].tryLock() ) { System.out.println("---- Tryer2: lock0 tried and acquired."); this.locksheld.put(LockerRoom.samplelocks[0].getProfiableId(), LockerRoom.samplelocks[0]); } else { //LockerRoom.samplelocks[0].g long blockerthreadid = LockerRoom.samplelocks[0].getOwnerId(); ProfilableRunnable pr = ProfilableRunnable.dict_threadid_runnableobj.get(blockerthreadid); if ( null != pr.getBlocker() ) { System.out.println("---- Tryer2: lock0 Peer thread blocked."); // the lock we tried's owner is being blocked. if (this.isItHeldbyMe(pr.getBlockerProfilableid()) ) { System.out.println("---- Tryer2: lock0 I hold what Peer thread want."); // we have to handle deadlock here // OK, to avoid deadlock, I will give you just what you want... // But we will see other problems, which will be discussed later. ProfilableReentrantLock lk = this.locksheld.get(pr.getBlockerProfilableid()); this.locksheld.remove(pr.getBlockerProfilableid()); lk.unlock(); System.out.println("---- Tryer2: lock0 yielded."); } else { System.out.println("---- Tryer2: lock0 entering blocked tree. I don't have what it wants."); LockerRoom.samplelocks[0].lock();// try to lock a again, getting the lock or being blocked. } } else { System.out.println("---- Tryer2: lock0 entering blocked status. The peer is not blocked"); TimeUnit.MILLISECONDS.sleep(200); LockerRoom.samplelocks[0].lock();// try to lock a again, getting the lock or being blocked. } } TimeUnit.MILLISECONDS.sleep(500); // LockerRoom.samplelocks[1].unlock(); // LockerRoom.samplelocks[0].unlock(); Iterator<Long> it = this.locksheld.keySet().iterator(); boolean shouldyield = false; if (this.locksheld.size() == 2) shouldyield = true; while (it.hasNext()) { //long key = it.next(); this.locksheld.get(it.next()).unlock(); } this.locksheld.clear(); if (shouldyield) { //Thread.currentThread(); Thread.yield(); } } } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } finally { // LockerRoom.samplelocks[1].unlock(); // LockerRoom.samplelocks[0].unlock(); Iterator<Long> it = this.locksheld.keySet().iterator(); while (it.hasNext()) { //long key = it.next(); this.locksheld.get(it.next()).unlock(); } this.locksheld.clear(); } } } public class TwoLayersDeadlockImprovisedSolution { /** * @param args * @throws InterruptedException */ public static void main(String[] args) throws InterruptedException { // 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 if (args.length >= 1) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "LIVE_LOCK_DEMO"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with // ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder = false; if (Bag.forestministryusepresetgraphborder) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 51.375, 39.0); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); Future<?> mesgrfuture = exec.submit(new GraphMessenger(startSignal)); LoopRun lpr1 = new TwoLayersDeadlockImprovisedSolutionTryer1(startSignal); LoopRun lpr2 = new TwoLayersDeadlockImprovisedSolutionTryer2(startSignal); fl.add(exec.submit(lpr1)); fl.add(exec.submit(lpr2)); // fl.add(exec.submit(new GraphMessenger(startSignal))); TimeUnit.MILLISECONDS.sleep(20000); lpr1.setHalted(true); lpr2.setHalted(true); //TimeUnit.MILLISECONDS.sleep(500); exec.shutdown(); for (Future<?> f : fl) { f.cancel(true); //TimeUnit.MILLISECONDS.sleep(20000); } TimeUnit.MILLISECONDS.sleep(3000);// CountDownLatch will be better. // So far, I don't want to // change the base jars. mesgrfuture.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

Why it is bad?
Simply, it does not full-fill the purpose of the desgin or the requirement(s). In "Advanced Concurrency Topic: Runtime Deadlock Detection XIX Visualization of an Imaginary Concurrency Event" and "Advanced Concurrency Topic: Runtime Deadlock Detection XX Visualization Results of XIX", I drew a series of diagrams. We tried to conjecture a scheduler that creates a live-lock. Two threads keep yielding each other, but neither of them can acquire all the resources it needs. Neither of them can finish its job.
To build this prototype, we made an assumption. It was also made from the beginning I dived into the dead-lock detection topic. The assumption is that we would be able to read one thread's status from another thread. Thus, we can detect deadlock. Live-lock is construct-able if a thread can know what its peer thread trying to get. If it just gives up one but not all the peer needs, live-lock could happen.
From this prototype, we know this assumption is wrong. If we execute the command line given, it will create either a dead-lock or the starvation of one of the threads. A thread's status is so volatile. A running thread will be blocked, go to sleeping, or perished. A blocked thread can be unblocked just next several CPU ticks. One thing is certain if a thread had finished. We may say two threads are like two particles, can this be called 'entangling', to observe accurately will affect the behavior the object being observed. Or to say, we can describe space/status or time accurately either of them but not both of them at the same time. I am not in physics area, so I stop short here and come back to our topic.
So if we can not read another thread's status from one thread, which is a fundamental mis-understanding, are we completely wrong so we can do nothing( we may also argue that we can lock status, a thread status has read write lock etc-- nightmare of spaghetti)? In our previous discussion, we show a healthy system is a tree-like structure. When a dead-lock is formed, it becomes a cyclic graph. But once the dead-lock is formed, no threads can change their status, suppose we use a no-time-out lock(). What we did in the middle of this topic, help us properly construct the graph. When dead-lock happens, we can detect it. The profiling or detecting mission is accomplished.
Advanced Concurrency Topic:
Runtime Deadlock Detection XXVI
An Artificial Livelock Although our attempt at XXV failed, we can still make a scheduler that follows the digram we drew.
You would need these two jars: and treetorplus3.jar and jdfr1.0.jar.

How to:

java -cp treetorplus3.jar;jdfr1.0.jar javax.util.concurrent.profilable.test.Test20130115_ArtificialLivelock .\

You can check out the entry point:

package javax.util.concurrent.profilable.test; import java.util.ArrayList; //import java.util.Iterator; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.LoopRun; //import javax.util.concurrent.profilable.ProfilableRunnable; //import javax.util.concurrent.profilable.locks.ProfilableReentrantLock; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class ArtificialLivelockTryer1 extends LoopRun { protected String CV = ""; public ArtificialLivelockTryer1(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { try { while (!halted ) { System.out.println("Tryer1: start a new loop"); //[1] if ( LockerRoom.samplelocks[1].tryLock() ) { CV+="R1+"; } else { LockerRoom.samplelocks[1].lock(); CV+="R1+"; } TimeUnit.MILLISECONDS.sleep(200); //[1] //[2] if ( LockerRoom.samplelocks[2].tryLock() ) { CV+="R2+"; } else { LockerRoom.samplelocks[2].lock(); CV+="R2+"; } TimeUnit.MILLISECONDS.sleep(200); //[2] //[3] if ( LockerRoom.samplelocks[3].tryLock() ) { CV+="R3+"; } else { LockerRoom.samplelocks[3].lock(); CV+="R3+"; } //[3] //[4] //get blocked //[4] //[5] //Tryer2 tries R1 result it realsing R1 //[5] //[6] TimeUnit.MILLISECONDS.sleep(200); //[6] //[7] //Tryer2 will try R3 //[7] //[8] //Blocking Tryer2 TimeUnit.MILLISECONDS.sleep(200); //[8] //[9] // tryer1 tries R4 resulting tryer1 release R3 if ( LockerRoom.samplelocks[4].tryLock() ) { CV+="R4+"; } else { //LockerRoom.samplelocks[3].unlock(); if (LoopRun.properlyUnlock(LockerRoom.samplelocks[3])) CV+="R3-"; } //[9] //[10] //nothing happens this phase // tryer1 has R3,R4 // tryer2 has R1,R2 TimeUnit.MILLISECONDS.sleep(200); //[10] //[11] // drop all locks, end this thread //LockerRoom.samplelocks[1].unlock(); // CV+="R1-"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[1])) CV+="R1-"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[3])) CV+="R3-"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[4])) CV+="R4-"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[2])) CV+="R2-"; //[11] // break; //halted =true; // tell parent class proper end CV+="\n"; } } catch (InterruptedException e) { e.printStackTrace(); } catch (Exception e) { e.printStackTrace(); } finally { if (LoopRun.properlyUnlock(LockerRoom.samplelocks[1])) CV+="R1e"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[3])) CV+="R3e"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[4])) CV+="R4e"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[2])) CV+="R2e"; } System.out.println("Tryer1 CV:\n"+CV); } } class ArtificialLivelockTryer2 extends LoopRun { protected String CV = ""; public ArtificialLivelockTryer2(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { try { while (!halted) { //[1] if ( LockerRoom.samplelocks[3].tryLock() ) { CV+="R3+"; } else { LockerRoom.samplelocks[3].lock(); CV+="R3+"; } TimeUnit.MILLISECONDS.sleep(200); //[1] //[2] if ( LockerRoom.samplelocks[4].tryLock() ) { CV+="R4+"; } else { LockerRoom.samplelocks[4].lock(); CV+="R4+"; } TimeUnit.MILLISECONDS.sleep(200); //[2] //[3] //block tryer1, tryer is trying R3 TimeUnit.MILLISECONDS.sleep(200); //[3] //[4] //no time slice, but there is a graph, graph in [3] shows try edge, graph in [4] shows a tree //[4] //[5] if ( LockerRoom.samplelocks[1].tryLock() ) { //this will be false CV+="R1+"; } else { if (LoopRun.properlyUnlock(LockerRoom.samplelocks[3])) //LockerRoom.samplelocks[3].unlock(); CV+="R3-"; } TimeUnit.MILLISECONDS.sleep(200); //[5] //[6] // let tryer1 get R3 TimeUnit.MILLISECONDS.sleep(200); //[6] //[7] if ( LockerRoom.samplelocks[3].tryLock() ) { //this will be false CV+="R3+"; } else { LockerRoom.samplelocks[3].lock(); CV+="R3+"; } // //[7] //[8] // get blocked //[8] //[9] // tryer1 tries R4 resulting tryer1 release R3 //TimeUnit.MILLISECONDS.sleep(200); //[9] //[10] //nothing happens this phase // tryer1 has R3,R4 // tryer2 has R1,R2 TimeUnit.MILLISECONDS.sleep(200); //[10] //[11] // drop all locks, end this thread //LockerRoom.samplelocks[1].unlock(); if (LoopRun.properlyUnlock(LockerRoom.samplelocks[1])) CV+="R1-"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[3])) //LockerRoom.samplelocks[3].unlock(); CV+="R3-"; if (LoopRun.properlyUnlock(LockerRoom.samplelocks[4])) //LockerRoom.samplelocks[4].unlock(); CV+="R4-"; //[11] // break; //halted =true; // tell parent class proper end CV+="\n"; //System.out.println("Tryer2 CV:\n"+CV); } } catch (InterruptedException e) { e.printStackTrace(); } catch (Exception e) { e.printStackTrace(); } finally { if (LoopRun.properlyUnlock(LockerRoom.samplelocks[1])) //LockerRoom.samplelocks[1].unlock(); CV+="R1e"; //LockerRoom.samplelocks[3].unlock(); if (LoopRun.properlyUnlock(LockerRoom.samplelocks[3])) CV+="R3e"; //LockerRoom.samplelocks[4].unlock(); if (LoopRun.properlyUnlock(LockerRoom.samplelocks[4])) CV+="R4e"; } System.out.println("Tryer2 CV:\n"+CV); } } public class Test20130115_ArtificialLivelock { /** * @param args * @throws InterruptedException */ public static void main(String[] args) throws InterruptedException { 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 if (args.length >= 1) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "LIVE_LOCK_DEMO"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with // ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder = true; if (Bag.forestministryusepresetgraphborder) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1,0.0,0.0,0.0,0.0,0.0,0.0,51.375,35.75); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); Future<?> mesgrfuture = exec.submit(new GraphMessenger(startSignal)); LoopRun lpr1 = new ArtificialLivelockTryer1(startSignal); LoopRun lpr2 = new ArtificialLivelockTryer2(startSignal); fl.add(exec.submit(lpr1)); fl.add(exec.submit(lpr2)); // fl.add(exec.submit(new GraphMessenger(startSignal))); TimeUnit.MILLISECONDS.sleep(2000); lpr1.setHalted(true); lpr2.setHalted(true); TimeUnit.MILLISECONDS.sleep(500); exec.shutdown(); for (Future<?> f : fl) { f.cancel(true); //TimeUnit.MILLISECONDS.sleep(20000); } TimeUnit.MILLISECONDS.sleep(10000);// CountDownLatch will be better. // So far, I don't want to // change the base jars. mesgrfuture.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

So, you would see the concern is no longer to create a live-lock. At the end of each thread, we did something. I hope this will provide some hint about how to deal with concurrent program that looks bizzare. In general, we should not fear live-lock. As long as the threads are alive, we will have a chance to change the resource access pattern. If a system has no hope, that is the real problem.

Advanced Concurrency Topic:
Runtime Deadlock Detection XXVII
More Tested Examples Multi-tier

How to:

java -cp treetorplus3.jar;jdfr1.0.jar javax.util.concurrent.profilable.test.Test20130120_MultiTier  .\

Entry point:

package javax.util.concurrent.profilable.test; import java.util.ArrayList; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.LoopRun; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class MulitiTierTryer1 extends LoopRun { //protected String CV = ""; public MulitiTierTryer1(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { try { while (!halted ) { LockerRoom.samplelocks[1].lock(); LockerRoom.samplelocks[2].lock(); TimeUnit.MILLISECONDS.sleep(2000); halted = true; } } catch (InterruptedException e) { e.printStackTrace(); } catch (Exception e) { e.printStackTrace(); } finally { LoopRun.properlyUnlock(LockerRoom.samplelocks[1]); LoopRun.properlyUnlock(LockerRoom.samplelocks[2]); } } } class MulitiTierTryer2 extends LoopRun { //protected String CV = ""; public MulitiTierTryer2(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { try { while (!halted ) { LockerRoom.samplelocks[3].lock(); LockerRoom.samplelocks[4].lock(); TimeUnit.MILLISECONDS.sleep(200); LockerRoom.samplelocks[2].lock(); halted = true; } } catch (Exception e) { e.printStackTrace(); } finally { LoopRun.properlyUnlock(LockerRoom.samplelocks[3]); LoopRun.properlyUnlock(LockerRoom.samplelocks[4]); LoopRun.properlyUnlock(LockerRoom.samplelocks[2]); } } } class MulitiTierTryer3 extends LoopRun { //protected String CV = ""; public MulitiTierTryer3(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { try { while (!halted ) { LockerRoom.samplelocks[5].lock(); LockerRoom.samplelocks[6].lock(); TimeUnit.MILLISECONDS.sleep(200); LockerRoom.samplelocks[3].lock(); halted = true; } } catch (Exception e) { e.printStackTrace(); } finally { LoopRun.properlyUnlock(LockerRoom.samplelocks[5]); LoopRun.properlyUnlock(LockerRoom.samplelocks[6]); LoopRun.properlyUnlock(LockerRoom.samplelocks[3]); } } } class MulitiTierTryer4 extends LoopRun { //protected String CV = ""; public MulitiTierTryer4(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { try { while (!halted ) { LockerRoom.samplelocks[0].lock(); LockerRoom.samplelocks[9].lock(); TimeUnit.MILLISECONDS.sleep(200); LockerRoom.samplelocks[5].lock(); halted = true; } } catch (Exception e) { e.printStackTrace(); } finally { LoopRun.properlyUnlock(LockerRoom.samplelocks[0]); LoopRun.properlyUnlock(LockerRoom.samplelocks[9]); LoopRun.properlyUnlock(LockerRoom.samplelocks[5]); } } } public class Test20130120_MultiTier { /** * @param args * @throws InterruptedException */ public static void main(String[] args) throws InterruptedException { 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 if (args.length >= 1) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "PROF_MUTLTI_TIER"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with // ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder = true; if (Bag.forestministryusepresetgraphborder) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1,0.0,0.0,0.0,0.0,0.0,0.0,91.375,71.5); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); Future<?> mesgrfuture = exec.submit(new GraphMessenger(startSignal)); //LoopRun lpr1 = new ArtificialLivelockTryer1(startSignal); //LoopRun lpr2 = new ArtificialLivelockTryer2(startSignal); LoopRun lpr1 = new MulitiTierTryer1(startSignal); LoopRun lpr2 = new MulitiTierTryer2(startSignal); LoopRun lpr3 = new MulitiTierTryer3(startSignal); LoopRun lpr4 = new MulitiTierTryer4(startSignal); fl.add(exec.submit(lpr1)); fl.add(exec.submit(lpr2)); fl.add(exec.submit(lpr3)); fl.add(exec.submit(lpr4)); // fl.add(exec.submit(new GraphMessenger(startSignal))); TimeUnit.MILLISECONDS.sleep(5000); lpr1.setHalted(true); lpr2.setHalted(true); lpr3.setHalted(true); lpr4.setHalted(true); TimeUnit.MILLISECONDS.sleep(500); exec.shutdown(); for (Future<?> f : fl) { f.cancel(true); //TimeUnit.MILLISECONDS.sleep(20000); } TimeUnit.MILLISECONDS.sleep(5000);// CountDownLatch will be better. // So far, I don't want to // change the base jars. mesgrfuture.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

Fast
How to:

java -cp treetorplus3.jar;jdfr1.0.jar javax.util.concurrent.profilable.test.Test20130120_Fast .\

Entry point:

package javax.util.concurrent.profilable.test; // Search YOU_CAN_ADJUST_THIS_VALUE // On my latop (Q9000 processor): // 100 milli-second, two thread / three locks, proper lock/unlock order //Tryer2 count: 1272 //Thread stopped by itself! //Tryer1 count: 324 //Thread stopped by itself! //50 milli-second, two thread / three locks, proper lock/unlock order //MSG: createATNodeforProfilable:2 2 11 //Tryer2 count: 296 //Thread stopped by itself! //Tryer1 count: 214 //Thread stopped by itself! // it produces too much pitures, so we don't show them. import java.util.ArrayList; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.LoopRun; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class FastTryer1 extends LoopRun { //protected String CV = ""; public FastTryer1(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { long count = 0; try { while (!halted ) { LockerRoom.samplelocks[1].lock(); LockerRoom.samplelocks[2].lock(); LockerRoom.samplelocks[3].lock(); //TimeUnit.MILLISECONDS.sleep(2000); //halted = true; LockerRoom.samplelocks[1].unlock(); LockerRoom.samplelocks[2].unlock(); LockerRoom.samplelocks[3].unlock(); ++count; } } // catch (InterruptedException e) { // e.printStackTrace(); // } catch (Exception e) { e.printStackTrace(); } finally { LoopRun.properlyUnlock(LockerRoom.samplelocks[1]); LoopRun.properlyUnlock(LockerRoom.samplelocks[2]); } System.out.println("Tryer1 count: "+ count); } } class FastTryer2 extends LoopRun { //protected String CV = ""; public FastTryer2(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { long count = 0; try { while (!halted ) { LockerRoom.samplelocks[1].lock(); LockerRoom.samplelocks[2].lock(); LockerRoom.samplelocks[3].lock(); //TimeUnit.MILLISECONDS.sleep(2000); //halted = true; LockerRoom.samplelocks[1].unlock(); LockerRoom.samplelocks[2].unlock(); LockerRoom.samplelocks[3].unlock(); ++count; } } // catch (InterruptedException e) { // e.printStackTrace(); // } catch (Exception e) { e.printStackTrace(); } finally { LoopRun.properlyUnlock(LockerRoom.samplelocks[1]); LoopRun.properlyUnlock(LockerRoom.samplelocks[2]); } System.out.println("Tryer2 count: "+ count); } } public class Test20130120_Fast { /** * @param args * @throws InterruptedException */ public static void main(String[] args) throws InterruptedException { 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 if (args.length >= 1) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "PROF_FAST"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with // ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder = true; if (Bag.forestministryusepresetgraphborder) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1,0.0,0.0,0.0,0.0,0.0,0.0,91.375,71.5); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); Future<?> mesgrfuture = exec.submit(new GraphMessenger(startSignal)); //LoopRun lpr1 = new ArtificialLivelockTryer1(startSignal); //LoopRun lpr2 = new ArtificialLivelockTryer2(startSignal); LoopRun lpr1 = new FastTryer1(startSignal); LoopRun lpr2 = new FastTryer2(startSignal); fl.add(exec.submit(lpr1)); fl.add(exec.submit(lpr2)); // fl.add(exec.submit(new GraphMessenger(startSignal))); //TODO YOU_CAN_ADJUST_THIS_VALUE long thisvalue = 50; TimeUnit.MILLISECONDS.sleep(thisvalue); lpr1.setHalted(true); lpr2.setHalted(true); TimeUnit.MILLISECONDS.sleep(500); exec.shutdown(); for (Future<?> f : fl) { f.cancel(true); //TimeUnit.MILLISECONDS.sleep(20000); } TimeUnit.MILLISECONDS.sleep(20000);// CountDownLatch will be better. // So far, I don't want to // change the base jars. mesgrfuture.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

Random
How to:

java -cp treetorplus3.jar;jdfr1.0.jar javax.util.concurrent.profilable.test.Test20130121_Random  .\

Entry point:

package javax.util.concurrent.profilable.test; import java.util.ArrayList; import java.util.Calendar; import java.util.List; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import javax.util.concurrent.profilable.IndexPermutation; import javax.util.concurrent.profilable.LockerRoom; import javax.util.concurrent.profilable.LoopRun; import javax.util.concurrent.profilable.messenger.GraphMessenger; import net.heteroclinic.graph.Bag; import net.heteroclinic.graph.ForestMinistry; class RandomTryer1 extends LoopRun { //protected String CV = ""; public RandomTryer1(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { int [] indices = IndexPermutation.getARandomPermutation(10,5); try { while (!halted ) { for (int i:indices) { LockerRoom.samplelocks[i-1].lock(); } TimeUnit.MILLISECONDS.sleep(200); for (int i:indices) { LoopRun.properlyUnlock(LockerRoom.samplelocks[i-1]); } halted = true; } } catch (Exception e) { e.printStackTrace(); } finally { for (int i:indices) { LoopRun.properlyUnlock(LockerRoom.samplelocks[i-1]); } } } } class RandomTryer2 extends LoopRun { //protected String CV = ""; public RandomTryer2(CountDownLatch startsignal) { super(startsignal); } @Override public void loop() { int [] indices = IndexPermutation.getARandomPermutation(10,5); try { while (!halted ) { for (int i:indices) { LockerRoom.samplelocks[i-1].lock(); } TimeUnit.MILLISECONDS.sleep(200); for (int i:indices) { LoopRun.properlyUnlock(LockerRoom.samplelocks[i-1]); } halted = true; } } catch (Exception e) { e.printStackTrace(); } finally { for (int i:indices) { LoopRun.properlyUnlock(LockerRoom.samplelocks[i-1]); } } } } public class Test20130121_Random { /** * @param args * @throws InterruptedException */ public static void main(String[] args) throws InterruptedException { Calendar.getInstance().getTimeInMillis(); 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 if (args.length >= 1) { Bag.testresultfilepath = args[0]; } else { Bag.testresultfilepath = "C:\\Users\\Graphics\\Desktop\\treetortest\\"; } Bag.testunitname = "PROF_RANDOM"; Bag.testresultfiletype = ".png"; Bag.treeinteveralinforest = 1.0d * Bag.nodespace; // first pass set Bag.forestministryusepresetgraphborder false // second pass set true, change the values with // ForestMinistry.initGraphBorder Bag.forestministryusepresetgraphborder = true; if (Bag.forestministryusepresetgraphborder) { Bag.forestministryupdategraphborder = false; ForestMinistry.initGraphBorder(-1,0.0,0.0,0.0,0.0,0.0,0.0,51.375,58.5); } else { Bag.forestministryupdategraphborder = true; } CountDownLatch startSignal = new CountDownLatch(1); List<Future<?>> fl = new ArrayList<Future<?>>(); ExecutorService exec = Executors.newCachedThreadPool(); Future<?> mesgrfuture = exec.submit(new GraphMessenger(startSignal)); //LoopRun lpr1 = new ArtificialLivelockTryer1(startSignal); //LoopRun lpr2 = new ArtificialLivelockTryer2(startSignal); LoopRun lpr1 = new RandomTryer1(startSignal); LoopRun lpr2 = new RandomTryer2(startSignal); fl.add(exec.submit(lpr1)); fl.add(exec.submit(lpr2)); // fl.add(exec.submit(new GraphMessenger(startSignal))); TimeUnit.MILLISECONDS.sleep(500); lpr1.setHalted(true); lpr2.setHalted(true); TimeUnit.MILLISECONDS.sleep(500); exec.shutdown(); for (Future<?> f : fl) { f.cancel(true); //TimeUnit.MILLISECONDS.sleep(20000); } TimeUnit.MILLISECONDS.sleep(5000);// CountDownLatch will be better. // So far, I don't want to // change the base jars. mesgrfuture.cancel(true); ForestMinistry.printStaticGraphBorder(); } }

Advanced Concurrency Topic:
Runtime Deadlock Detection XXVIII
Period So far, months have been spent upon this topic. The resources are limited, I have to put a period. We may continue on with the same topic or similiar topic.

Today, we release jdfr1.0.jar.
- it fully supports Java ReentrantLock
- it has several proto-types, quick-starts or just say examples -- in the Blog section

It will be a very useful tool to profile concurrent programming. We also have treetor treetorplus3.jar which can render about several thousands nodes of a-cyclic graph or a forest. If I got enough support, we may switch to OpenGL rendering engine and using more advanced IPC.

We corrected some mis-understandings. They are critical but finally not fatal to this project.
I am still not sure about next step. I hope there will be more people download and study what I did. It will be a great pleasure that you can achieve something with these tools. Science and technology does not rely on luck. If you find any bug or errors, please feel free to point them out. This project is done by one person, so it is convenient to control. In real life projects, we have to resolve human conflicts, legacy pacakges etc. Some time you do not even have the source code not mention how to modify them. So we can not simply put a easy or difficult label for a project.
The methods we tried or proposed, may be helpful while extending to profile database system, interprocess concurrent programming, the operating system, or for clustered computing units. Concurrent programming in some sense destroyed the von Neuman architecture, much more effort is needed for understanding or utilizing the nature of concurrency. Advanced Concurrency Topic:
Runtime Deadlock Detection XXVII
More Tested Examples Multi-tier

How to:

java -cp treetorplus3.jar;jdfr1.0.jar javax.util.concurrent.profilable.test.Test20130120_MultiTier  .\

Entry point:

Fast
How to:

java -cp treetorplus3.jar;jdfr1.0.jar javax.util.concurrent.profilable.test.Test20130120_Fast  .\

Entry point:

Random
How to:

java -cp treetorplus3.jar;jdfr1.0.jar javax.util.concurrent.profilable.test.Test20130121_Random  .\

Entry point: