FilesExpand file tree

 master

/

ProducerConsumer.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

116 lines (101 loc) · 2.16 KB

 master

/

ProducerConsumer.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

116 lines (101 loc) · 2.16 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

#include <iostream>

#include <vector>

#include <thread>

#include <chrono>

#include <mutex>

#include <queue>

using namespace std;

const int PRODUCER_COUNT = 2;

const int CONSUMER_COUNT = 4;

class WorkerQueue{

public:

void add(int elem){

unique_lock<mutex> locker(mu);

q.push(elem);

cout<<"Produced elem "<<q.back()<<endl;

locker.unlock();

cond.notify_one();

}

int remove(int threadID){

unique_lock<mutex> locker(mu);

cond.wait(locker, [&]() { return !q.empty(); });

a = q.front();

q.pop();

cout<<"Thread: "<<threadID<<" consumed "<<a<<endl;

locker.unlock();

return a;

}

void operator()(){

return;

}

private:

int a;

queue<int> q;

mutex mu;

condition_variable cond;

};

class Consumer{

public:

Consumer(WorkerQueue& wq):wq(wq){

}

int removeElem(int threadID){

return wq.remove(threadID);

}

int operator()(int i){

int a;

while(1){

{

removeElem(i);

}

this_thread::sleep_for(chrono::milliseconds(1000));

}

}

private:

WorkerQueue& wq;

};

class Producer{

public:

Producer(WorkerQueue& wq):wq(wq){

}

void operator()(){

while(1){

{

++elem;

wq.add(elem);

}

this_thread::sleep_for(chrono::milliseconds(100));

}

}

private:

WorkerQueue& wq;

int elem = 1000;

};

int main(){

WorkerQueue wq;

Consumer a(ref(wq));

Consumer b(ref(wq));

Producer p(ref(wq));

thread producerThread(ref(p));

thread c1Thread(ref(a), 1);

thread c2Thread(ref(b), 2);

//vector<thread> consumerThreads;

//vector<Consumer*> consumerVector;

//vector<Producer*> producerVector;

// //vector<thread> producerThreads;

// for (int i = 0 ; i < PRODUCER_COUNT; ++i){

// producerVector.push_back(new Producer(&wq));

// thread t(new Producer(&wq));

// producerThreads.push_back(t);

// }

// for (int i = 0 ; i < CONSUMER_COUNT; ++i){

// consumerVector.push_back(new Consumer(&wq));

// thread t(consumerVector[i]);

// consumerThreads.push_back(t);

// }

//cout<<"Number of consumer threads = "<<consumerVector.size()<<endl;

//cout<<"number of producers threads = "<<producerVector.size()<<endl;

producerThread.join();

c1Thread.join();

c2Thread.join();

return 1;

}