- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
我有两个 c 文件:producer.c 和 consumer.c。消费者在内存中创建一个共享缓冲区,等待生产者将项目放入缓冲区进行消费。生产者将共享内存附加到其内存映射,然后开始将项目放入缓冲区。
问题是如何将它们一起编译运行?
这是实际的任务。 (我知道我可以用一个使用线程的 c 文件来完成,但这不是我被要求做的。)
In this part you will develop a producer-consumer application that will use shared memory for process communication (POSIX shared memory, not System V shared memory). There will be N producers and N consumers. N can be 1, 2, or 3.
You will develop a producer program (producer.c) and a consumer program (consumer.c). When started, the producer program will create N child processes which will be acting as N producers (i.e. each child process will be a producer process).
Similarly, when started, the consumer program will create N child processes, where each child process will be acting as a consumer process. You will consider that consumers are identified as 0, 1, 2, depending on N. For example, if N is 2, then there will two consumers, 0 and 1.
The consumer program will be run first. When run, the consumer program will first create a shared memory of size 4 KB. This shared memory will be the place where you will have a shared single buffer sitting. The buffer can be accessed by producers and consumers. The buffer size is 100. It can hold at most 100 items (integers). In the shared memory you can have some other shared variables that you feel necessary. The consumer program will also create one or more semaphores (you decide how many).
Then it will create N child processes (N consumers) using the fork() system call (You will not need to use the exec() system call). The main process of the consumer program (parent), after creating the child processes, should not terminate. It should wait until all children (i.e. consumers) finish their tasks and terminate. When all children terminate, it will remove (delete) the shared memory from the system. It will also remove (delete) the semaphores. Then it can terminate as well.
Each producer will read an input file of positive integers (one integer per line) and will just pass the integers through a shared buffer sitting in a shared memory (created by the consumer program) between the producers and consumers.
Each consumer will read integers from the shared buffer and will write a received integer z to an output file associated with consumer if z mod N is equal to the ID of the consumer. For example, if N is 3 and if the ID of a consumer is 2 and the consumer has received an integer 7, it will do nothing with it (ignore), but if it receives 8, it will write the integer to its output file. An output file will contain one integer in a line. While producers and consumers are accessing the shared buffer, they should use semaphores so that access is synchronized. Additionally, if the buffer is full, producers should sleep, and if there is nothing to consume, consumers should sleep. We should not have busy waiting. You will use POSIX semaphores (named semaphores). The consumer program will be invoked as follows:
consumer N …Here, N is the number of consumer processes to be created. The value of this parameter must be the same with the corresponding parameter of the producer program. Here, the is the name of the output file that will be used by the consumer with ID X. The number of output file names entered will be equal to N. is a name we can use to identify the shared memory. is a name we can use to identify the semaphores (it can be a prefix that can be used for names of many semaphores). These same names must be used when invoking the producer. The producer program will be named as producer and will be invoked with the following parameters:
producer N …Here, N is the number of producers. The is the name of an input file for producer X. An input file is a text file storing integers. The number of input file names we enter will be equal to N. There can be one or more integers in a file. An input file can be quite huge (billions of integers). is a name we can use to identify the shared memory. is a name we can use to identify the semaphores.
An example invocation of the programs can be like the following.
consumer 3 out0.txt out1.txt out2.txt mysmem mysemaphores producer 3 in0.txt in1.txt in2.txt mysmem mysemaphore
最佳答案
问题是如何同步共享内存的两个进程。你可以使用 Posix semaphores ,但还有许多其他方法可以做到这一点。
关于c - 同时运行两个共享内存的 C 程序,如何?,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/8103560/
我在具有 2CPU 和 3.75GB 内存 (https://aws.amazon.com/ec2/instance-types/) 的 c3.large Amazon EC2 ubuntu 机器上运
我想通过用户空间中的mmap-ing并将地址发送到内核空间从用户空间写入VGA内存(视频内存,而不是缓冲区),我将使用pfn remap将这些mmap-ed地址映射到vga内存(我将通过 lspci
在 Mathematica 中,如果你想让一个函数记住它的值,它在语法上是很轻松的。例如,这是标准示例 - 斐波那契: fib[1] = 1 fib[2] = 1 fib[n_]:= fib[n] =
我读到动态内存是在运行时在堆上分配的,而静态内存是在编译时在堆栈上分配的,因为编译器知道在编译时必须分配多少内存。 考虑以下代码: int n; cin>>n; int a[n]; 如果仅在运行期间读
我是 Python 的新手,但我之前还不知道这一点。我在 for 循环中有一个基本程序,它从站点请求数据并将其保存到文本文件但是当我检查我的任务管理器时,我发现内存使用量只增加了?长时间运行时,这对我
我正在设计一组数学函数并在 CPU 和 GPU(使用 CUDA)版本中实现它们。 其中一些函数基于查找表。大多数表占用 4KB,其中一些占用更多。基于查找表的函数接受一个输入,选择查找表的一两个条目,
读入一个文件,内存被动态分配给一个字符串,文件内容将被放置在这里。这是在函数内部完成的,字符串作为 char **str 传递。 使用 gdb 我发现在行 **(str+i) = fgetc(aFil
我需要证实一个理论。我正在学习 JSP/Java。 在查看了一个现有的应用程序(我没有写)之后,我注意到一些我认为导致我们的性能问题的东西。或者至少是其中的一部分。 它是这样工作的: 1)用户打开搜索
n我想使用memoization缓存某些昂贵操作的结果,这样就不会一遍又一遍地计算它们。 两个memoise和 R.cache适合我的需要。但是,我发现缓存在调用之间并不可靠。 这是一个演示我看到的问
我目前正在分析一些 javascript shell 代码。这是该脚本中的一行: function having() { memory = memory; setTimeout("F0
我有一种情况,我想一次查询数据库,然后再将整个数据缓存在内存中。 我得到了内存中 Elasticsearch 的建议,我用谷歌搜索了它是什么,以及如何在自己的 spring boot 应用程序中实现它
我正在研究 Project Euler (http://projecteuler.net/problem=14) 的第 14 题。我正在尝试使用内存功能,以便将给定数字的序列长度保存为部分结果。我正在
所以,我一直在做 Java 内存/注意力游戏作业。我还没有达到我想要的程度,它只完成了一半,但我确实让 GUI 大部分工作了......直到我尝试向我的框架添加单选按钮。我认为问题可能是因为我将 JF
我一直在尝试使用 Flask-Cache 的 memoize 功能来仅返回 statusTS() 的缓存结果,除非在另一个请求中满足特定条件,然后删除缓存。 但它并没有被删除,并且 Jinja 模板仍
我对如何使用 & 运算符来减少内存感到非常困惑。 我可以回答下面的问题吗? clase C{ function B(&$a){ $this->a = &$a; $thi
在编写代码时,我遇到了一个有趣的问题。 我有一个 PersonPOJO,其 name 作为其 String 成员之一及其 getter 和 setter class PersonPOJO { priv
在此代码中 public class Base { int length, breadth, height; Base(int l, int b, int h) { l
Definition Structure padding is the process of aligning data members of the structure in accordance
在 JavaScript Ninja 的 secret 中,作者提出了以下方案,用于在没有闭包的情况下内存函数结果。他们通过利用函数是对象这一事实并在函数上定义一个属性来存储过去调用函数的结果来实现这
我正在尝试找出 map 消耗的 RAM 量。所以,我做了以下事情;- Map cr = crPair.collectAsMap(); // 200+ entries System.out.printl
我是一名优秀的程序员,十分优秀!