In UNIX-based operating systems, opening a file using a file handle can be done only in the kernel. Give a possible implementation of an NFS file handle for a user-level NFS server for a UNIX system.

Suppose we have a Unix file system with block size of 8 Kbyte and pointers with size of 4 bytes. How large a file can be represented using only single indirect pointer in inode? A. 8 Kbyte B. 2K * 8 Kbyte C. 2K * 2K * 8 Kbyte D. 2K * 2K * 2K * 8 Kbyte

With the exception of fp being a file pointer rather than a file descriptor and the return value being an int status rather than a location, the standard library method int fseek(FILE *fp, long offset, int origin) is identical to Iseek. Compose fseek. Ensure that the caching used for the other library functions and your fseek are correctly coordinated.

Write a Java program using Thread with single Server and Multiple Clients. NOTE: Client must be running until Bye message is sent. Server should never stop. I need answer question pls

Write a LINUX C code for Banker’s Algorithm to deadlock avoidance.Note: Consider a system with five processes (P0–P4) and three resources (A, B, C).There are 9 instances of resource type A, 4 instances of resource type B, and 6instances of resource type C. (provide ubuntu screenshots)

In a process using threads, is there one stack per thread, or one stack per process? Explain. In the final version of the process state model, we have a state “blocked and swapped.” If the goal of blocking a process is to prevent the blocked process from wasting resources, why do not we only have “blocked and swapped”? Why a separate state “blocked”? Explain your answer. Linux systems do not allow all signals to be caught or ignored. Suppose they did; how would you stop an application that has ignored all signals from running? Assume at time 5, no system resources are being used except the processor and memory. Given this, consider this sequence of events: at time = 5: P1 executes a command to read from disk unit 3; at time = 15: P5’s time slice expires; at time = 18: P7 executes a command to write to disk unit 3; at time = 20: P3 executes a command to read from disk unit 2; at time = 24: P5 executes a command to write on disk unit 3; at time = 28: P5 is swapped out; at time = 33:…

You'll write a C++ program to demonstrate thread synchronization. Your main function should first create an empty file called *sync.txt*. Then it will create two separate threads: *Thread-A* and *Thread-B*. Both threads will open *sync.txt* and write to it simultaneously.   *Thread-A* will write the numbers 0 through 9, a total of fifty-thousand times in nested `for` loops, then exit. In other words, print the numbers 0 through 9 over and over again, with each run on a separate line, for 50,000 lines. Here's an example of one such line: ```text 0 1 2 3 4 5 6 7 8 9 ```   Somewhat similarly, *Thread-B* will write the letters A through Z fifty-thousand times in nested `for` loops, then exit. In other words, print the letters A through Z over and over again, with each run on a separate line, for 50,000 lines. Here's an example of one such line:   ```text A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ```   Do not write each line as one long string. You must write each character to the…

Given a directory tree of a file system, if /usr/jeff is the working directory, what is the absolute path name for the file whose relative path name is ../ast/z?

THREADS in C PROGRAM HELP PLEASE!! Using the thread3.c program provided below, itt will require some code modification. Those modifications include: - instead of 10,000 threads, create 40,000 threads in total - instead of creating just one kind of thread, create 4 kinds of threads (each with 10,000 instances) o group 1: adds 1 to counter o group 2: adds 5 to counter o group 3: subtracts 2 from counter o group 4: subtracts 10 from counter Run the program 5 times and take a screen shot showing the output of the run. Add comments throughout the code please! thread3.c given code: // Compile with://// clang -lpthread thread3.c -o thread3// or// gcc -lpthread thread3.c -o thread3//#include <stdio.h>#include <stdlib.h>#include <pthread.h> #define NTHREADS 10000 // shared variableint counter = 0; // thread to be executed - unspecified variable argumentsvoid *thread (void *vargp) {counter = counter +1;return NULL;} int main() {// array to keep Pthread IDs of created…

Starting out with hadoop and I need to find the 8-bit XOR checksum of all bytes from 1000000000 till 1000000999 (inclusive) with the offset in a file called "bigdata" in a directory called d1. How would I do this in Java using the HDFS API?