zookeeperTutorial.html 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870
  1. <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
  2. <html>
  3. <head>
  4. <META http-equiv="Content-Type" content="text/html; charset=UTF-8">
  5. <meta content="Apache Forrest" name="Generator">
  6. <meta name="Forrest-version" content="0.8">
  7. <meta name="Forrest-skin-name" content="pelt">
  8. <title>Programming with ZooKeeper - A basic tutorial</title>
  9. <link type="text/css" href="skin/basic.css" rel="stylesheet">
  10. <link media="screen" type="text/css" href="skin/screen.css" rel="stylesheet">
  11. <link media="print" type="text/css" href="skin/print.css" rel="stylesheet">
  12. <link type="text/css" href="skin/profile.css" rel="stylesheet">
  13. <script src="skin/getBlank.js" language="javascript" type="text/javascript"></script><script src="skin/getMenu.js" language="javascript" type="text/javascript"></script><script src="skin/fontsize.js" language="javascript" type="text/javascript"></script>
  14. <link rel="shortcut icon" href="images/favicon.ico">
  15. </head>
  16. <body onload="init()">
  17. <script type="text/javascript">ndeSetTextSize();</script>
  18. <div id="top">
  19. <!--+
  20. |breadtrail
  21. +-->
  22. <div class="breadtrail">
  23. <a href="http://www.apache.org/">Apache</a> &gt; <a href="http://hadoop.apache.org/">Hadoop</a> &gt; <a href="http://hadoop.apache.org/zookeeper/">ZooKeeper</a><script src="skin/breadcrumbs.js" language="JavaScript" type="text/javascript"></script>
  24. </div>
  25. <!--+
  26. |header
  27. +-->
  28. <div class="header">
  29. <!--+
  30. |start group logo
  31. +-->
  32. <div class="grouplogo">
  33. <a href="http://hadoop.apache.org/"><img class="logoImage" alt="Hadoop" src="images/hadoop-logo.jpg" title="Apache Hadoop"></a>
  34. </div>
  35. <!--+
  36. |end group logo
  37. +-->
  38. <!--+
  39. |start Project Logo
  40. +-->
  41. <div class="projectlogo">
  42. <a href="http://hadoop.apache.org/zookeeper/"><img class="logoImage" alt="ZooKeeper" src="images/zookeeper_small.gif" title="The Hadoop database"></a>
  43. </div>
  44. <!--+
  45. |end Project Logo
  46. +-->
  47. <!--+
  48. |start Search
  49. +-->
  50. <div class="searchbox">
  51. <form action="http://www.google.com/search" method="get" class="roundtopsmall">
  52. <input value="hadoop.apache.org" name="sitesearch" type="hidden"><input onFocus="getBlank (this, 'Search the site with google');" size="25" name="q" id="query" type="text" value="Search the site with google">&nbsp;
  53. <input name="Search" value="Search" type="submit">
  54. </form>
  55. </div>
  56. <!--+
  57. |end search
  58. +-->
  59. <!--+
  60. |start Tabs
  61. +-->
  62. <ul id="tabs">
  63. <li>
  64. <a class="unselected" href="http://hadoop.apache.org/zookeeper/">Project</a>
  65. </li>
  66. <li>
  67. <a class="unselected" href="http://wiki.apache.org/hadoop/ZooKeeper">Wiki</a>
  68. </li>
  69. <li class="current">
  70. <a class="selected" href="index.html">ZooKeeper 3.1 Documentation</a>
  71. </li>
  72. </ul>
  73. <!--+
  74. |end Tabs
  75. +-->
  76. </div>
  77. </div>
  78. <div id="main">
  79. <div id="publishedStrip">
  80. <!--+
  81. |start Subtabs
  82. +-->
  83. <div id="level2tabs"></div>
  84. <!--+
  85. |end Endtabs
  86. +-->
  87. <script type="text/javascript"><!--
  88. document.write("Last Published: " + document.lastModified);
  89. // --></script>
  90. </div>
  91. <!--+
  92. |breadtrail
  93. +-->
  94. <div class="breadtrail">
  95. &nbsp;
  96. </div>
  97. <!--+
  98. |start Menu, mainarea
  99. +-->
  100. <!--+
  101. |start Menu
  102. +-->
  103. <div id="menu">
  104. <div onclick="SwitchMenu('menu_1.1', 'skin/')" id="menu_1.1Title" class="menutitle">Overview</div>
  105. <div id="menu_1.1" class="menuitemgroup">
  106. <div class="menuitem">
  107. <a href="index.html">Welcome</a>
  108. </div>
  109. <div class="menuitem">
  110. <a href="zookeeperOver.html">Overview</a>
  111. </div>
  112. <div class="menuitem">
  113. <a href="zookeeperStarted.html">Getting Started</a>
  114. </div>
  115. <div class="menuitem">
  116. <a href="releasenotes.html">Release Notes</a>
  117. </div>
  118. </div>
  119. <div onclick="SwitchMenu('menu_selected_1.2', 'skin/')" id="menu_selected_1.2Title" class="menutitle" style="background-image: url('skin/images/chapter_open.gif');">Developer</div>
  120. <div id="menu_selected_1.2" class="selectedmenuitemgroup" style="display: block;">
  121. <div class="menuitem">
  122. <a href="api/index.html">API Docs</a>
  123. </div>
  124. <div class="menuitem">
  125. <a href="zookeeperProgrammers.html">Programmer's Guide</a>
  126. </div>
  127. <div class="menuitem">
  128. <a href="javaExample.html">Java Example</a>
  129. </div>
  130. <div class="menupage">
  131. <div class="menupagetitle">Barrier and Queue Tutorial</div>
  132. </div>
  133. <div class="menuitem">
  134. <a href="recipes.html">Recipes</a>
  135. </div>
  136. </div>
  137. <div onclick="SwitchMenu('menu_1.3', 'skin/')" id="menu_1.3Title" class="menutitle">Admin &amp; Ops</div>
  138. <div id="menu_1.3" class="menuitemgroup">
  139. <div class="menuitem">
  140. <a href="zookeeperAdmin.html">Administrator's Guide</a>
  141. </div>
  142. </div>
  143. <div onclick="SwitchMenu('menu_1.4', 'skin/')" id="menu_1.4Title" class="menutitle">Contributor</div>
  144. <div id="menu_1.4" class="menuitemgroup">
  145. <div class="menuitem">
  146. <a href="zookeeperInternals.html">ZooKeeper Internals</a>
  147. </div>
  148. </div>
  149. <div onclick="SwitchMenu('menu_1.5', 'skin/')" id="menu_1.5Title" class="menutitle">Miscellaneous</div>
  150. <div id="menu_1.5" class="menuitemgroup">
  151. <div class="menuitem">
  152. <a href="http://wiki.apache.org/hadoop/ZooKeeper">Wiki</a>
  153. </div>
  154. <div class="menuitem">
  155. <a href="http://wiki.apache.org/hadoop/ZooKeeper/FAQ">FAQ</a>
  156. </div>
  157. <div class="menuitem">
  158. <a href="http://hadoop.apache.org/zookeeper/mailing_lists.html">Mailing Lists</a>
  159. </div>
  160. </div>
  161. <div id="credit"></div>
  162. <div id="roundbottom">
  163. <img style="display: none" class="corner" height="15" width="15" alt="" src="skin/images/rc-b-l-15-1body-2menu-3menu.png"></div>
  164. <!--+
  165. |alternative credits
  166. +-->
  167. <div id="credit2"></div>
  168. </div>
  169. <!--+
  170. |end Menu
  171. +-->
  172. <!--+
  173. |start content
  174. +-->
  175. <div id="content">
  176. <div title="Portable Document Format" class="pdflink">
  177. <a class="dida" href="zookeeperTutorial.pdf"><img alt="PDF -icon" src="skin/images/pdfdoc.gif" class="skin"><br>
  178. PDF</a>
  179. </div>
  180. <h1>Programming with ZooKeeper - A basic tutorial</h1>
  181. <div id="minitoc-area">
  182. <ul class="minitoc">
  183. <li>
  184. <a href="#ch_Introduction">Introduction</a>
  185. </li>
  186. <li>
  187. <a href="#sc_barriers">Barriers</a>
  188. </li>
  189. <li>
  190. <a href="#sc_producerConsumerQueues">Producer-Consumer Queues</a>
  191. </li>
  192. <li>
  193. <a href="#sc_sourceListing">Complete Source Listing</a>
  194. </li>
  195. </ul>
  196. </div>
  197. <a name="N10009"></a><a name="ch_Introduction"></a>
  198. <h2 class="h3">Introduction</h2>
  199. <div class="section">
  200. <p>In this tutorial, we show simple implementations of barriers and
  201. producer-consumer queues using ZooKeeper. We call the respective classes Barrier and Queue.
  202. These examples assume that you have at least one ZooKeeper server running.</p>
  203. <p>Both primitives use the following common excerpt of code:</p>
  204. <pre class="code">
  205. static ZooKeeper zk = null;
  206. static Integer mutex;
  207. String root;
  208. SyncPrimitive(String address) {
  209. if(zk == null){
  210. try {
  211. System.out.println("Starting ZK:");
  212. zk = new ZooKeeper(address, 3000, this);
  213. mutex = new Integer(-1);
  214. System.out.println("Finished starting ZK: " + zk);
  215. } catch (IOException e) {
  216. System.out.println(e.toString());
  217. zk = null;
  218. }
  219. }
  220. //else mutex = new Integer(-1);
  221. }
  222. synchronized public void process(WatchedEvent event) {
  223. synchronized (mutex) {
  224. //System.out.println("Process: " + event.getType());
  225. mutex.notify();
  226. }
  227. }
  228. </pre>
  229. <p>Both classes extend SyncPrimitive. In this way, we execute steps that are
  230. common to all primitives in the constructor of SyncPrimitive. To keep the examples
  231. simple, we create a ZooKeeper object the first time we instantiate either a barrier
  232. object or a queue object, and we declare a static variable that is a reference
  233. to this object. The subsequent instances of Barrier and Queue check whether a
  234. ZooKeeper object exists. Alternatively, we could have the application creating a
  235. ZooKeeper object and passing it to the constructor of Barrier and Queue.</p>
  236. <p>
  237. We use the process() method to process notifications triggered due to watches.
  238. In the following discussion, we present code that sets watches. A watch is internal
  239. structure that enables ZooKeeper to notify a client of a change to a node. For example,
  240. if a client is waiting for other clients to leave a barrier, then it can set a watch and
  241. wait for modifications to a particular node, which can indicate that it is the end of the wait.
  242. This point becomes clear once we go over the examples.
  243. </p>
  244. </div>
  245. <a name="N1001F"></a><a name="sc_barriers"></a>
  246. <h2 class="h3">Barriers</h2>
  247. <div class="section">
  248. <p>
  249. A barrier is a primitive that enables a group of processes to synchronize the
  250. beginning and the end of a computation. The general idea of this implementation
  251. is to have a barrier node that serves the purpose of being a parent for individual
  252. process nodes. Suppose that we call the barrier node "/b1". Each process "p" then
  253. creates a node "/b1/p". Once enough processes have created their corresponding
  254. nodes, joined processes can start the computation.
  255. </p>
  256. <p>In this example, each process instantiates a Barrier object, and its constructor takes as parameters:</p>
  257. <ul>
  258. <li>
  259. <p>the address of a ZooKeeper server (e.g., "zoo1.foo.com:2181")</p>
  260. </li>
  261. <li>
  262. <p>the path of the barrier node on ZooKeeper (e.g., "/b1")</p>
  263. </li>
  264. <li>
  265. <p>the size of the group of processes</p>
  266. </li>
  267. </ul>
  268. <p>The constructor of Barrier passes the address of the Zookeeper server to the
  269. constructor of the parent class. The parent class creates a ZooKeeper instance if
  270. one does not exist. The constructor of Barrier then creates a
  271. barrier node on ZooKeeper, which is the parent node of all process nodes, and
  272. we call root (<strong>Note:</strong> This is not the ZooKeeper root "/").</p>
  273. <pre class="code">
  274. /**
  275. * Barrier constructor
  276. *
  277. * @param address
  278. * @param root
  279. * @param size
  280. */
  281. Barrier(String address, String root, int size) {
  282. super(address);
  283. this.root = root;
  284. this.size = size;
  285. // Create barrier node
  286. if (zk != null) {
  287. try {
  288. Stat s = zk.exists(root, false);
  289. if (s == null) {
  290. zk.create(root, new byte[0], Ids.OPEN_ACL_UNSAFE,
  291. CreateMode.PERSISTENT);
  292. }
  293. } catch (KeeperException e) {
  294. System.out
  295. .println("Keeper exception when instantiating queue: "
  296. + e.toString());
  297. } catch (InterruptedException e) {
  298. System.out.println("Interrupted exception");
  299. }
  300. }
  301. // My node name
  302. try {
  303. name = new String(InetAddress.getLocalHost().getCanonicalHostName().toString());
  304. } catch (UnknownHostException e) {
  305. System.out.println(e.toString());
  306. }
  307. }
  308. </pre>
  309. <p>
  310. To enter the barrier, a process calls enter(). The process creates a node under
  311. the root to represent it, using its host name to form the node name. It then wait
  312. until enough processes have entered the barrier. A process does it by checking
  313. the number of children the root node has with "getChildren()", and waiting for
  314. notifications in the case it does not have enough. To receive a notification when
  315. there is a change to the root node, a process has to set a watch, and does it
  316. through the call to "getChildren()". In the code, we have that "getChildren()"
  317. has two parameters. The first one states the node to read from, and the second is
  318. a boolean flag that enables the process to set a watch. In the code the flag is true.
  319. </p>
  320. <pre class="code">
  321. /**
  322. * Join barrier
  323. *
  324. * @return
  325. * @throws KeeperException
  326. * @throws InterruptedException
  327. */
  328. boolean enter() throws KeeperException, InterruptedException{
  329. zk.create(root + "/" + name, new byte[0], Ids.OPEN_ACL_UNSAFE,
  330. CreateMode.EPHEMERAL_SEQUENTIAL);
  331. while (true) {
  332. synchronized (mutex) {
  333. List&lt;String&gt; list = zk.getChildren(root, true);
  334. if (list.size() &lt; size) {
  335. mutex.wait();
  336. } else {
  337. return true;
  338. }
  339. }
  340. }
  341. }
  342. </pre>
  343. <p>
  344. Note that enter() throws both KeeperException and InterruptedException, so it is
  345. the reponsability of the application to catch and handle such exceptions.</p>
  346. <p>
  347. Once the computation is finished, a process calls leave() to leave the barrier.
  348. First it deletes its corresponding node, and then it gets the children of the root
  349. node. If there is at least one child, then it waits for a notification (obs: note
  350. that the second parameter of the call to getChildren() is true, meaning that
  351. ZooKeeper has to set a watch on the the root node). Upon reception of a notification,
  352. it checks once more whether the root node has any child.</p>
  353. <pre class="code">
  354. /**
  355. * Wait until all reach barrier
  356. *
  357. * @return
  358. * @throws KeeperException
  359. * @throws InterruptedException
  360. */
  361. boolean leave() throws KeeperException, InterruptedException{
  362. zk.delete(root + "/" + name, 0);
  363. while (true) {
  364. synchronized (mutex) {
  365. List&lt;String&gt; list = zk.getChildren(root, true);
  366. if (list.size() &gt; 0) {
  367. mutex.wait();
  368. } else {
  369. return true;
  370. }
  371. }
  372. }
  373. }
  374. }
  375. </pre>
  376. </div>
  377. <a name="N10051"></a><a name="sc_producerConsumerQueues"></a>
  378. <h2 class="h3">Producer-Consumer Queues</h2>
  379. <div class="section">
  380. <p>
  381. A producer-consumer queue is a distributed data estructure thata group of processes
  382. use to generate and consume items. Producer processes create new elements and add
  383. them to the queue. Consumer processes remove elements from the list, and process them.
  384. In this implementation, the elements are simple integers. The queue is represented
  385. by a root node, and to add an element to the queue, a producer process creates a new node,
  386. a child of the root node.
  387. </p>
  388. <p>
  389. The following excerpt of code corresponds to the constructor of the object. As
  390. with Barrier objects, it first calls the constructor of the parent class, SyncPrimitive,
  391. that creates a ZooKeeper object if one doesn't exist. It then verifies if the root
  392. node of the queue exists, and creates if it doesn't.
  393. </p>
  394. <pre class="code">
  395. /**
  396. * Constructor of producer-consumer queue
  397. *
  398. * @param address
  399. * @param name
  400. */
  401. Queue(String address, String name) {
  402. super(address);
  403. this.root = name;
  404. // Create ZK node name
  405. if (zk != null) {
  406. try {
  407. Stat s = zk.exists(root, false);
  408. if (s == null) {
  409. zk.create(root, new byte[0], Ids.OPEN_ACL_UNSAFE,
  410. CreateMode.PERSISTENT);
  411. }
  412. } catch (KeeperException e) {
  413. System.out
  414. .println("Keeper exception when instantiating queue: "
  415. + e.toString());
  416. } catch (InterruptedException e) {
  417. System.out.println("Interrupted exception");
  418. }
  419. }
  420. }
  421. </pre>
  422. <p>
  423. A producer process calls "produce()" to add an element to the queue, and passes
  424. an integer as an argument. To add an element to the queue, the method creates a
  425. new node using "create()", and uses the SEQUENCE flag to instruct ZooKeeper to
  426. append the value of the sequencer counter associated to the root node. In this way,
  427. we impose a total order on the elements of the queue, thus guaranteeing that the
  428. oldest element of the queue is the next one consumed.
  429. </p>
  430. <pre class="code">
  431. /**
  432. * Add element to the queue.
  433. *
  434. * @param i
  435. * @return
  436. */
  437. boolean produce(int i) throws KeeperException, InterruptedException{
  438. ByteBuffer b = ByteBuffer.allocate(4);
  439. byte[] value;
  440. // Add child with value i
  441. b.putInt(i);
  442. value = b.array();
  443. zk.create(root + "/element", value, Ids.OPEN_ACL_UNSAFE,
  444. CreateMode.PERSISTENT_SEQUENTIAL);
  445. return true;
  446. }
  447. </pre>
  448. <p>
  449. To consume an element, a consumer process obtains the children of the root node,
  450. reads the node with smallest counter value, and returns the element. Note that
  451. if there is a conflict, then one of the two contending processes won't be able to
  452. delete the node and the delete operation will throw an exception.</p>
  453. <p>
  454. A call to getChildren() returns the list of children in lexicographic order.
  455. As lexicographic order does not necessary follow the numerical order of the counter
  456. values, we need to decide which element is the smallest. To decide which one has
  457. the smallest counter value, we traverse the list, and remove the prefix "element"
  458. from each one.</p>
  459. <pre class="code">
  460. /**
  461. * Remove first element from the queue.
  462. *
  463. * @return
  464. * @throws KeeperException
  465. * @throws InterruptedException
  466. */
  467. int consume() throws KeeperException, InterruptedException{
  468. int retvalue = -1;
  469. Stat stat = null;
  470. // Get the first element available
  471. while (true) {
  472. synchronized (mutex) {
  473. List&lt;String&gt; list = zk.getChildren(root, true);
  474. if (list.size() == 0) {
  475. System.out.println("Going to wait");
  476. mutex.wait();
  477. } else {
  478. Integer min = new Integer(list.get(0).substring(7));
  479. for(String s : list){
  480. Integer tempValue = new Integer(s.substring(7));
  481. //System.out.println("Temporary value: " + tempValue);
  482. if(tempValue &lt; min) min = tempValue;
  483. }
  484. System.out.println("Temporary value: " + root + "/element" + min);
  485. byte[] b = zk.getData(root + "/element" + min,
  486. false, stat);
  487. zk.delete(root + "/element" + min, 0);
  488. ByteBuffer buffer = ByteBuffer.wrap(b);
  489. retvalue = buffer.getInt();
  490. return retvalue;
  491. }
  492. }
  493. }
  494. }
  495. }
  496. </pre>
  497. </div>
  498. <a name="N1006F"></a><a name="sc_sourceListing"></a>
  499. <h2 class="h3">Complete Source Listing</h2>
  500. <div class="section">
  501. <div class="note example">
  502. <div class="label">SyncPrimitive.Java</div>
  503. <div class="content">
  504. <title>SyncPrimitive.Java</title>
  505. <pre class="code">
  506. import java.io.IOException;
  507. import java.net.InetAddress;
  508. import java.net.UnknownHostException;
  509. import java.nio.ByteBuffer;
  510. import java.util.List;
  511. import java.util.Random;
  512. import org.apache.zookeeper.CreateMode;
  513. import org.apache.zookeeper.KeeperException;
  514. import org.apache.zookeeper.WatchedEvent;
  515. import org.apache.zookeeper.Watcher;
  516. import org.apache.zookeeper.ZooKeeper;
  517. import org.apache.zookeeper.ZooDefs.Ids;
  518. import org.apache.zookeeper.data.Stat;
  519. public class SyncPrimitive implements Watcher {
  520. static ZooKeeper zk = null;
  521. static Integer mutex;
  522. String root;
  523. SyncPrimitive(String address) {
  524. if(zk == null){
  525. try {
  526. System.out.println("Starting ZK:");
  527. zk = new ZooKeeper(address, 3000, this);
  528. mutex = new Integer(-1);
  529. System.out.println("Finished starting ZK: " + zk);
  530. } catch (IOException e) {
  531. System.out.println(e.toString());
  532. zk = null;
  533. }
  534. }
  535. //else mutex = new Integer(-1);
  536. }
  537. synchronized public void process(WatchedEvent event) {
  538. synchronized (mutex) {
  539. //System.out.println("Process: " + event.getType());
  540. mutex.notify();
  541. }
  542. }
  543. /**
  544. * Barrier
  545. */
  546. static public class Barrier extends SyncPrimitive {
  547. int size;
  548. String name;
  549. /**
  550. * Barrier constructor
  551. *
  552. * @param address
  553. * @param root
  554. * @param size
  555. */
  556. Barrier(String address, String root, int size) {
  557. super(address);
  558. this.root = root;
  559. this.size = size;
  560. // Create barrier node
  561. if (zk != null) {
  562. try {
  563. Stat s = zk.exists(root, false);
  564. if (s == null) {
  565. zk.create(root, new byte[0], Ids.OPEN_ACL_UNSAFE,
  566. CreateMode.PERSISTENT);
  567. }
  568. } catch (KeeperException e) {
  569. System.out
  570. .println("Keeper exception when instantiating queue: "
  571. + e.toString());
  572. } catch (InterruptedException e) {
  573. System.out.println("Interrupted exception");
  574. }
  575. }
  576. // My node name
  577. try {
  578. name = new String(InetAddress.getLocalHost().getCanonicalHostName().toString());
  579. } catch (UnknownHostException e) {
  580. System.out.println(e.toString());
  581. }
  582. }
  583. /**
  584. * Join barrier
  585. *
  586. * @return
  587. * @throws KeeperException
  588. * @throws InterruptedException
  589. */
  590. boolean enter() throws KeeperException, InterruptedException{
  591. zk.create(root + "/" + name, new byte[0], Ids.OPEN_ACL_UNSAFE,
  592. CreateMode.EPHEMERAL_SEQUENTIAL);
  593. while (true) {
  594. synchronized (mutex) {
  595. List&lt;String&gt; list = zk.getChildren(root, true);
  596. if (list.size() &lt; size) {
  597. mutex.wait();
  598. } else {
  599. return true;
  600. }
  601. }
  602. }
  603. }
  604. /**
  605. * Wait until all reach barrier
  606. *
  607. * @return
  608. * @throws KeeperException
  609. * @throws InterruptedException
  610. */
  611. boolean leave() throws KeeperException, InterruptedException{
  612. zk.delete(root + "/" + name, 0);
  613. while (true) {
  614. synchronized (mutex) {
  615. List&lt;String&gt; list = zk.getChildren(root, true);
  616. if (list.size() &gt; 0) {
  617. mutex.wait();
  618. } else {
  619. return true;
  620. }
  621. }
  622. }
  623. }
  624. }
  625. /**
  626. * Producer-Consumer queue
  627. */
  628. static public class Queue extends SyncPrimitive {
  629. /**
  630. * Constructor of producer-consumer queue
  631. *
  632. * @param address
  633. * @param name
  634. */
  635. Queue(String address, String name) {
  636. super(address);
  637. this.root = name;
  638. // Create ZK node name
  639. if (zk != null) {
  640. try {
  641. Stat s = zk.exists(root, false);
  642. if (s == null) {
  643. zk.create(root, new byte[0], Ids.OPEN_ACL_UNSAFE,
  644. CreateMode.PERSISTENT);
  645. }
  646. } catch (KeeperException e) {
  647. System.out
  648. .println("Keeper exception when instantiating queue: "
  649. + e.toString());
  650. } catch (InterruptedException e) {
  651. System.out.println("Interrupted exception");
  652. }
  653. }
  654. }
  655. /**
  656. * Add element to the queue.
  657. *
  658. * @param i
  659. * @return
  660. */
  661. boolean produce(int i) throws KeeperException, InterruptedException{
  662. ByteBuffer b = ByteBuffer.allocate(4);
  663. byte[] value;
  664. // Add child with value i
  665. b.putInt(i);
  666. value = b.array();
  667. zk.create(root + "/element", value, Ids.OPEN_ACL_UNSAFE,
  668. CreateMode.PERSISTENT_SEQUENTIAL);
  669. return true;
  670. }
  671. /**
  672. * Remove first element from the queue.
  673. *
  674. * @return
  675. * @throws KeeperException
  676. * @throws InterruptedException
  677. */
  678. int consume() throws KeeperException, InterruptedException{
  679. int retvalue = -1;
  680. Stat stat = null;
  681. // Get the first element available
  682. while (true) {
  683. synchronized (mutex) {
  684. List&lt;String&gt; list = zk.getChildren(root, true);
  685. if (list.size() == 0) {
  686. System.out.println("Going to wait");
  687. mutex.wait();
  688. } else {
  689. Integer min = new Integer(list.get(0).substring(7));
  690. for(String s : list){
  691. Integer tempValue = new Integer(s.substring(7));
  692. //System.out.println("Temporary value: " + tempValue);
  693. if(tempValue &lt; min) min = tempValue;
  694. }
  695. System.out.println("Temporary value: " + root + "/element" + min);
  696. byte[] b = zk.getData(root + "/element" + min,
  697. false, stat);
  698. zk.delete(root + "/element" + min, 0);
  699. ByteBuffer buffer = ByteBuffer.wrap(b);
  700. retvalue = buffer.getInt();
  701. return retvalue;
  702. }
  703. }
  704. }
  705. }
  706. }
  707. public static void main(String args[]) {
  708. if (args[0].equals("qTest"))
  709. queueTest(args);
  710. else
  711. barrierTest(args);
  712. }
  713. public static void queueTest(String args[]) {
  714. Queue q = new Queue(args[1], "/app1");
  715. System.out.println("Input: " + args[1]);
  716. int i;
  717. Integer max = new Integer(args[2]);
  718. if (args[3].equals("p")) {
  719. System.out.println("Producer");
  720. for (i = 0; i &lt; max; i++)
  721. try{
  722. q.produce(10 + i);
  723. } catch (KeeperException e){
  724. } catch (InterruptedException e){
  725. }
  726. } else {
  727. System.out.println("Consumer");
  728. for (i = 0; i &lt; max; i++) {
  729. try{
  730. int r = q.consume();
  731. System.out.println("Item: " + r);
  732. } catch (KeeperException e){
  733. i--;
  734. } catch (InterruptedException e){
  735. }
  736. }
  737. }
  738. }
  739. public static void barrierTest(String args[]) {
  740. Barrier b = new Barrier(args[1], "/b1", new Integer(args[2]));
  741. try{
  742. boolean flag = b.enter();
  743. System.out.println("Entered barrier: " + args[2]);
  744. if(!flag) System.out.println("Error when entering the barrier");
  745. } catch (KeeperException e){
  746. } catch (InterruptedException e){
  747. }
  748. // Generate random integer
  749. Random rand = new Random();
  750. int r = rand.nextInt(100);
  751. // Loop for rand iterations
  752. for (int i = 0; i &lt; r; i++) {
  753. try {
  754. Thread.sleep(100);
  755. } catch (InterruptedException e) {
  756. }
  757. }
  758. try{
  759. b.leave();
  760. } catch (KeeperException e){
  761. } catch (InterruptedException e){
  762. }
  763. System.out.println("Left barrier");
  764. }
  765. }
  766. </pre>
  767. </div>
  768. </div>
  769. </div>
  770. <p align="right">
  771. <font size="-2"></font>
  772. </p>
  773. </div>
  774. <!--+
  775. |end content
  776. +-->
  777. <div class="clearboth">&nbsp;</div>
  778. </div>
  779. <div id="footer">
  780. <!--+
  781. |start bottomstrip
  782. +-->
  783. <div class="lastmodified">
  784. <script type="text/javascript"><!--
  785. document.write("Last Published: " + document.lastModified);
  786. // --></script>
  787. </div>
  788. <div class="copyright">
  789. Copyright &copy;
  790. 2008 <a href="http://www.apache.org/licenses/">The Apache Software Foundation.</a>
  791. </div>
  792. <!--+
  793. |end bottomstrip
  794. +-->
  795. </div>
  796. </body>
  797. </html>