现代操作系统书本中的java实现生产者/消费者问题的代码改良

本文主要是介绍现代操作系统书本中的java实现生产者/消费者问题的代码改良,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

以下代码为改良版。

public class ProducerConsumer {static final int N = 3; // constant giving the buffer sizestatic producer p = new producer(); // instantiate a new producer threadstatic consumer c = new consumer( ); // instantiate a new consumer threadstatic our_monitor mon = new our_monitor( ); // instantiate a new monitorpublic static void main(String args[]) {p.start(); // start the producer threadc.start(); // start the consumer thread}static class producer extends Thread {public void run( ) {// run method contains the thread codeint item;while (true) { //producer loopitem = produce_item( );mon.insert(item);}}private int produce_item( ) { // actually producereturn 0;}}static class consumer extends Thread {public void run( ) {//run method contains the thread codeint item;while (true) { // consumer loopitem = mon.remove( );consume_item (item);}}private void consume_item(int item) { }// actually consume}static class our_monitor {// this is a monitorprivate int buffer[] = new int[N];private int count = 0, lo = 0, hi = 0; // counters and indicespublic synchronized void insert(int val){if (count >= N) {go_to_sleep(count,hi,"Insert"); // if the buffer is full, go to sleep}buffer[hi] = val; // insert an item into the bufferSystem.out.println("Produce number:" + val + ",at position=" + hi+ "\r\n");hi = (hi + 1) % N; // slot to place next item incount = count + 1; // one more item in the buffer nownotify(); // if consumer was sleeping, wake it up}public synchronized int remove( ) {int val;if (count == 0) {go_to_sleep(count,lo,"Remove"); // if the buffer is empty, go to sleep}    val = buffer [lo]; // fetch an item from the bufferSystem.out.println("Consume number:" + val+ ",at position=" + lo + "\r\n");lo = (lo + 1) % N; // slot to fetch next item fromcount = count - 1; // one few items in the buffernotify( ); // if producer was sleeping, wake it upreturn val;}private void go_to_sleep(int count,int val,String action) { try{System.out.println("Current total number:" + count+ ",value=" + val+",Action=" + action+ "\r\n");wait( );} catch(InterruptedException exc){}}}
}
//Figure 2-35. A solution to the producer-consumer problem in Java,copy from <<Modern Operating System>> by Andrew S.Tanenbaum.

先前从书中摘抄的,似乎不能正确执行。

public class ProducerConsumer {static final int N = 3; // constant giving the buffer sizestatic producer p = new producer(); // instantiate a new producer threadstatic consumer c = new consumer( ); // instantiate a new consumer threadstatic our_monitor mon = new our_monitor( ); // instantiate a new monitorpublic static void main(String args[]) {p.start(); // start the producer threadc.start(); // start the consumer thread}static class producer extends Thread {public void run( ) {// run method contains the thread codeint item;while (true) { //producer loopitem = produce_item( );mon.insert(item);}}private int produce_item( ) { // actually producereturn 0;}}static class consumer extends Thread {public void run( ) {//run method contains the thread codeint item;while (true) { // consumer loopitem = mon.remove( );consume_item (item);}}private void consume_item(int item) { }// actually consume}static class our_monitor {// this is a monitorprivate int buffer[] = new int[N];private int count = 0, lo = 0, hi = 0; // counters and indicespublic synchronized void insert(int val){if (count == N) go_to_sleep(); // if the buffer is full, go to sleepbuffer[hi] = val; // insert an item into the bufferSystem.out.println("Produce number:" + val + ",at position=" + hi);hi = (hi + 1) % N; // slot to place next item incount = count + 1; // one more item in the buffer nowif (count == 1) notify(); // if consumer was sleeping, wake it up}public synchronized int remove( ) {int val;if (count == 0) go_to_sleep(); // if the buffer is empty, go to sleepval = buffer [lo]; // fetch an item from the bufferSystem.out.println("Consume number:" + val+ ",at position=" + lo);lo = (lo + 1) % N; // slot to fetch next item fromcount = count - 1; // one few items in the bufferif (count == N - 1) notify( ); // if producer was sleeping, wake it upreturn val;}private void go_to_sleep( ) { try{System.out.println("队列不能满足要求,挂起。。。\\n");wait( );} catch(InterruptedException exc){}}}
}
//Figure 2-35. A solution to the producer-consumer problem in Java.


这篇关于现代操作系统书本中的java实现生产者/消费者问题的代码改良的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/796735

相关文章

JVM 的类初始化机制

前言 当你在 Java 程序中new对象时,有没有考虑过 JVM 是如何把静态的字节码(byte code)转化为运行时对象的呢,这个问题看似简单,但清楚的同学相信也不会太多,这篇文章首先介绍 JVM 类初始化的机制,然后给出几个易出错的实例来分析,帮助大家更好理解这个知识点。 JVM 将字节码转化为运行时对象分为三个阶段,分别是:loading 、Linking、initialization

Spring Security 基于表达式的权限控制

前言 spring security 3.0已经可以使用spring el表达式来控制授权,允许在表达式中使用复杂的布尔逻辑来控制访问的权限。 常见的表达式 Spring Security可用表达式对象的基类是SecurityExpressionRoot。 表达式描述hasRole([role])用户拥有制定的角色时返回true (Spring security默认会带有ROLE_前缀),去

浅析Spring Security认证过程

类图 为了方便理解Spring Security认证流程,特意画了如下的类图,包含相关的核心认证类 概述 核心验证器 AuthenticationManager 该对象提供了认证方法的入口,接收一个Authentiaton对象作为参数; public interface AuthenticationManager {Authentication authenticate(Authenti

Spring Security--Architecture Overview

1 核心组件 这一节主要介绍一些在Spring Security中常见且核心的Java类,它们之间的依赖,构建起了整个框架。想要理解整个架构,最起码得对这些类眼熟。 1.1 SecurityContextHolder SecurityContextHolder用于存储安全上下文(security context)的信息。当前操作的用户是谁,该用户是否已经被认证,他拥有哪些角色权限…这些都被保

Spring Security基于数据库验证流程详解

Spring Security 校验流程图 相关解释说明(认真看哦) AbstractAuthenticationProcessingFilter 抽象类 /*** 调用 #requiresAuthentication(HttpServletRequest, HttpServletResponse) 决定是否需要进行验证操作。* 如果需要验证,则会调用 #attemptAuthentica

Spring Security 从入门到进阶系列教程

Spring Security 入门系列 《保护 Web 应用的安全》 《Spring-Security-入门(一):登录与退出》 《Spring-Security-入门(二):基于数据库验证》 《Spring-Security-入门(三):密码加密》 《Spring-Security-入门(四):自定义-Filter》 《Spring-Security-入门(五):在 Sprin

Java架构师知识体认识

源码分析 常用设计模式 Proxy代理模式Factory工厂模式Singleton单例模式Delegate委派模式Strategy策略模式Prototype原型模式Template模板模式 Spring5 beans 接口实例化代理Bean操作 Context Ioc容器设计原理及高级特性Aop设计原理Factorybean与Beanfactory Transaction 声明式事物

Java进阶13讲__第12讲_1/2

多线程、线程池 1.  线程概念 1.1  什么是线程 1.2  线程的好处 2.   创建线程的三种方式 注意事项 2.1  继承Thread类 2.1.1 认识  2.1.2  编码实现  package cn.hdc.oop10.Thread;import org.slf4j.Logger;import org.slf4j.LoggerFactory

好题——hdu2522(小数问题:求1/n的第一个循环节)

好喜欢这题,第一次做小数问题,一开始真心没思路,然后参考了网上的一些资料。 知识点***********************************无限不循环小数即无理数,不能写作两整数之比*****************************(一开始没想到,小学没学好) 此题1/n肯定是一个有限循环小数,了解这些后就能做此题了。 按照除法的机制,用一个函数表示出来就可以了,代码如下

hdu1043(八数码问题,广搜 + hash(实现状态压缩) )

利用康拓展开将一个排列映射成一个自然数,然后就变成了普通的广搜题。 #include<iostream>#include<algorithm>#include<string>#include<stack>#include<queue>#include<map>#include<stdio.h>#include<stdlib.h>#include<ctype.h>#inclu