1. Write a program that uses UNIX system calls to "ping-pong" a byte between two processes overa pair of pipes, one for each direction. Measure the program's performance, in exchanges persecond.2. Answer Memory Allocation Question belowvoid func() {int x; // declares an integer on the stack}void func() {int x = (int) malloc(sizeof (int));}#include void malloc(size_t size);double d = (double *) malloc(sizeof (double));int x = malloc (10+ sizeof(int));printf("%d\n", sizeof(x));Note: allocating and freeing memory isfraught with possible errors.Can you explain?See text section 14.4 for importantcaveats.int x[10];printf("%d\n", sizeof(x));

According to Bartleby Guidelines we need to answer only one question so I have answered first…

Answered: 1. Write a program that uses UNIX…

1. Write a program that uses UNIX system calls to "ping-pong" a byte between two processes over a pair of pipes, one for each direction. Measure the program's performance, in exchanges per second.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Round-Robin (RR): Write a Java program to implement a Round-Robin (RR) scheduling algorithm with quantum q that will be entered by user. Your program should first prompts the user to input a list of process ID, arrival time, and burst time (in ms) for each process to be run on the CPU. The list is terminated by 0 0 0 for the process ID, arrival time, and burst time. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the RR scheduling algorithm. Also print the turnaround, response, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
Computer Science #include<cmath>#include<stdio.h>__global__voidprocess_kernel1(float *input1,float *input2,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = sinf(input1[index]) + cosf(input2[index]);}__global__voidprocess_kernel2(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = logf(input[index]);}_global__voidprocess_kernel3(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x *…
In c++
Write a sequence of statements that display a subroutine’s return address. Hint: the esp register points to the return address stored on the call stack. You can call procedure WriteHex. This can be solved in 2 lines of code. The following exercise can be solved using either 32-bit or 64-bit code. Assembly language
Write a sequence of statements that display a subroutine’s return address. Be sure that whatever modifications you make to the stack do not prevent the subroutine from returning to itscaller
Each function has local memory associated with it to hold incoming parameters, local variables, and (in some cases) temporary variables. This region of memory is called a stack frame. Question 7 options: True False
In an assembly language program, local variables are kept in a stack. True or false: this assertion
It is possible to demonstrate the return address of a function by using a series of instructions. Keep in mind that any modifications to the stack must not prohibit the process from returning control to the person who called it.
In Python, 1. Elements in a Quene or Stack are removed in the order in which they were added. 2. Elements in a Quene or Stack are removed in reverse order: the most recently added item is the first to be removed. Choose the appropriate choice
Examine the stack's performance when it is allowed to operate in its natural state.
Computer Science Recreate the following C program in aarch64 assembly: #include static void swap(long *a, long *b) { long temp = *a; *a = *b; *b = temp; } int main(void) { long a, b; scanf("%ld %ld", &a, &b); printf("Before swap: %ld %ld\n", a, b); swap(&a, &b); printf("After swap: %ld %ld\n", a, b); return 0; }
Instruction: Explain the function of the program line by line thoroughly.Program: #include <iostream> using namespace std; //Swap functionvoid swap(int *xp, int *yp){ int temp = *xp; *xp = *yp; *yp = temp;} void selectionSort(int arr[], int n){ int i, j, min_idx; // One by one move boundary of // unsorted subarray for (i = 0; i < n-1; i++) { // Find the minimum element in // unsorted array min_idx = i; for (j = i+1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; // Swap the found minimum element // with the first element if(min_idx!=i) swap(&arr[min_idx], &arr[i]); }} //Function to print an arrayvoid printArray(int arr[], int size){ int i; for (i=0; i < size; i++) cout << arr[i] << " "; cout << endl;} int main(){ int x, n; cout << "Enter number of integers: "; cin >>n; int *arr = new int(n); for (int i = 0; i < n; i++) { cout << " Enter Integer No. " << (i + 1) << ": ";…