Databases
StackOverflow2013
Postsdbo
PORun two C programs simultaneously sharing memory, how?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PORun two C programs simultaneously sharing memory, how?
    primarykey
    data
    text
    <p>I have two c files: producer.c and consumer.c. Consumer creates a shared buffer in memory and waits producer to put items into buffer to consume. Producer attaches shared memory to its memory map, then starts putting items into buffer.</p> <p>The question is how to compile and run them together?</p> <p>Here is the actual assignment. (I know I can do it with one c file using threads, but this is not I am asked to do.)</p> <blockquote> <p>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. </p> <p>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). </p> <p>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. </p> <p>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). </p> <p>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. </p> <p>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. </p> <p>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:<br> consumer N … </p> <p>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:<br> producer N … </p> <p>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.</p> <p>An example invocation of the programs can be like the following.<br> consumer 3 out0.txt out1.txt out2.txt mysmem mysemaphores producer 3 in0.txt in1.txt in2.txt mysmem mysemaphore</p> </blockquote>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USJoe
    1. USmert
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. PORun two C programs simultaneously sharing memory, how?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PORun two C programs simultaneously sharing memory, how?
      1. This table or related slice is empty.
      1. VTUpMod
    1. COWhat do you mean by "together" exactly?
      singulars
      1. PORun two C programs simultaneously sharing memory, how?
      1. USMat
    2. COWhat is your OS?
      singulars
      1. PORun two C programs simultaneously sharing memory, how?
      1. USpmod
    3. COYou'll need one of these new-fashioned multi-tasking operating systems. Unix systems got that thing on mainframes for a while, and I've heard you can get it at home on this fancy new Amiga computer.
      singulars
      1. PORun two C programs simultaneously sharing memory, how?
      1. USthiton
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload