java kafka producer

();}finally{Lock.unlock ();}}Public Void Get (){Lock.lock ();try {While (!flag)consumer_con.await ();System.out.println (Thread.CurrentThread (). GetName () + ".... Consumers ... "+this.name);Flag=false;producer_con.signal ();} catch (Interruptedexception e) {//TODO auto-generated catch blocke.printstacktrace ();}finally{Lock.unlock ();}}}class Producer implements Runnable{Resource R=null;Public Producer (

Using Producer,consumerconnector Helloworldproducer.java PackageCn.ljh.kafka.kafka_helloworld;Importjava.util.Date;Importjava.util.Properties;ImportJava.util.Random;ImportKafka.javaapi.producer.Producer;ImportKafka.producer.KeyedMessage;ImportKafka.producer.ProducerConfig; Public classHelloworldproducer { Public Static voidMain (string[] args) {LongEvents = Long.parselong (args[0]); Random Rnd=NewRandom (); Properties Props=NewProperties (); //Config

Java implements producer consumers Java Implementation producer consumer

-generated constructor stub } //Production Products Public synchronized voidSet (String name,string efficasy) {//indicates inability to produce if(!flag) { Try { This. Wait ();//The current thread enters the wait state, yields the CPU, and releases the lock on the monitor. }Catch(interruptedexception e) {//TODO Auto-generated catch blockE.printstacktrace (); } } This. SetName (name); Try{Thread.Sleep (500); } Catch(interruptedexception e

"Toast" + ID + ":" + Status;}} /** * Toast Queue * * @author Lenovo * */class Toastqueue extends linkedblockingqueuePackage Org.rui.thread.block2;import Java.io.ioexception;import Java.io.pipedreader;import java.io.PipedWriter; Import Java.util.random;import Java.util.concurrent.executorservice;import Java.util.concurrent.executors;import java.util.concurrent.timeunit;/** * tasks using pipelines for input, output * * @author Lenovo * */class Sender implements Runnable {private Rand Om rand = ne

publicclassdepot{ privateintdepotSize; //Warehouse Size privateLocklock; //exclusive lock publicdepot () { depotsize= 0; lock=newreentrantlock (); } / ** * Goods warehousing * @param value */ publicvoidput (int Value) { try{ nbSp;lock.lock (); depotSize+=value; system.out.println (Thread.CurrentThread (). GetName () + " put "+value+" ---->thedepotSize: "+depotsize ); }finally{ lock.unlock (); } } /** * Merchandise out of the library * @param value */ public Voidget (intNbsp;valu

IntroductionProducer and consumer issues are a classic problem in threading models: producers and consumers share the same storage space during the same time period , as shown in, producers store data in space, and consumers access data, If not coordinated, the following conditions may occur:Producer Consumer ChartStorage space is full, and producers occupy it, consumers wait for producers to give up space to remove products, producers wait for consumers to consume products, thereby adding produ

(interruptedexception E1) { - e1.printstacktrace (); Wu } - } AboutE e = list.get (0); $List.remove (0); -System.out.println (Thread.CurrentThread (). GetName () + "consumer Products"); - Try { -Thread.Sleep (1000); A}Catch(interruptedexception E1) { + e1.printstacktrace (); the } - List.notifyall (); $ returne; the } the } the the /** - * Determine if the current warehouse is empty in * the * @return the

(); }}//producersclassProduceImplementsRunnable {PrivateClerk Clerk; PublicProduce (Clerk clerk) { This. Clerk =clerk; } @Override Public voidrun () { for(inti = 0; I ) { Try{Thread.Sleep (200); } Catch(interruptedexception e) {e.printstacktrace (); } clerk.get (); } }}//ConsumerclassConsumerImplementsRunnable {PrivateClerk Clerk; PublicConsumer (Clerk clerk) { This. Clerk =clerk; } @Override Public voidrun () { for(inti = 0; I ) {Clerk.sale (); } }} Public final v

to remove products, producers wait for consumers to consume products, thereby adding products to the space. Wait for each other, thus the deadlock occurs.Three ways in which Java solves threading models1. Wait () and notify ()Import Java.util.linkedlist;public class Producerconsumer {private linkedlist2, await () and signal (), the way the thread locksPackage Sort;import Java.util.linkedlist;import Java.util.concurrent.locks.condition;import Java.

Import Java.util.Random;Import Java.util.concurrent.LinkedBlockingQueue;Class producer{Random RDM = new Random ();void Produce (linkedblockingqueue{while (true){if (Productlist.size () {Productlist.add (Rdm.nextint (100));System.out.println (Thread.CurrentThread (). GetName () + "Produce number:" + productlist.peek ());}}}}Class Consumer{void consume (linkedblockingqueue{while (true){if (Productlist.size () >0){System.out.println (Thread.CurrentThread

Input implements Runnable { Privateperson person; PublicInput (person person) { This. person = person; } @Override Public voidRun () {intx =0; while(true) {synchronized (person) {if(Person.flag) {if(x = =0) {//judgment interval to produce different peoplePerson.name ="Tom"; Person.sex ="Male"; }Else{Person.name ="Zhang San"; Person.sex ="female"; } x = (x +1) %2;//interval to produce different peoplePerson.flag =false;//Put it once, take it oncePerson.notify ();//wake-up thread of a person}E

--; System.out.println ("Consumers are consuming Xiaomi mobile phones sell 1, the current number of products:" +con.currentnum+ "department"); }Else if(Con.currentnum = = 0) {//If you don't have a cell phoneSystem.out.println ("The phone has been bought, consumers stop spending, is waiting for production ..."); Try{con.wait ();//suspend consumption and release locks}Catch(interruptedexception e) {e.printstacktrace (); } }//else if}//syn Try{Thread.Sleep (14

Use Linkedblockingqueue in Java to implement producer, consumer mode Linkedblockingqueue implementation is thread-safe, which realizes FIFO (first-in first out) and other characteristics. is the first choice as producer consumers, Linkedblockingqueue can specify capacity, or can not be specified, not specified, the default is the largest integer.max_value, which

Label:First, the environment One Centos6.5 console Mongo 3.0 kafka_2.11-0.8.2.1 Storm-0.9.5 Zookeeper-3.4.6 Java 1.7 (later because the jar packaged on Mac is not run by the 1.8 compilation, instead Java 1.8) Other environment Temporary Second, the operation starts Start ZookeeperVerify that the configuration is correct, and that the configuration is self-searching

{//produce an apple and put it in the box +box.buff[(++box.putpoint)% box.boxlength] = 1; Abox.boxcount++; theSystem.out.println ("Put in an apple"); +SYSTEM.OUT.PRINTLN ("Total apples:" +box.boxcount); - box.notify (); $ Try { $Thread.Sleep (1000); -}Catch(interruptedexception e) { - e.printstacktrace (); the } -}//ElseWuyi the } - } Wu - } About } $ - //consumption of apples, consumers - classCus

Import Java.util.linkedlist;import java.util.queue;import java.util.random;/** * Simple Java program to demonstrate how T o use Wait, notify and Notifyall () * method in Java by solving producer consumer problem. * * @author Javin Paul */public class Producerconsumerinjava {public static void main (String args[]) {SYSTEM.O Ut.println ("How to use Wait and

IntroductionProducer and consumer issues are a classic problem in threading models: producers and consumers share the same storage space during the same time period , as shown in, producers store data in space, and consumers access data, If not coordinated, the following conditions may occur:Producer Consumer ChartStorage space is full, and producers occupy it, consumers wait for producers to give up space to remove products, producers wait for consumers to consume products, thereby adding produ

", StringEncoder.class.getName ());producerint i = 0;while (true) {Producer.send (New keyedmessageThread.Sleep (1000);}}}2. ConsumersPackage Storm.test.kafka;Import Java.util.HashMap;Import java.util.List;Import Java.util.Map;Import java.util.Properties;Import Kafka.consumer.Consumer;Import Kafka.consumer.ConsumerConfig;Import Kafka.consumer.ConsumerIterator;Import Kafka.consumer.KafkaStream;Import Kafka.javaapi.consumer.ConsumerConnector;Import Kafka.serializer.StringEncoder;public class Testco

Package Com.subject01;import Java.util.priorityqueue;import Java.util.concurrent.locks.condition;import Java.util.concurrent.locks.lock;import java.util.concurrent.locks.reentrantlock;/** * condition is only present in Java 1.5, It is used instead of the traditional object's Wait (), notify () to implement inter-threading collaboration, compared to wait (), notify () with object, * using Condition's await (), signal () This approach enables inter-thre