Implementation of a concurrent prethreaded version of the TINY web server:

Modified code for “sbuf.h” file:

The modified code for “sbuf.h” from section 12.5.4 in book is given below:

#ifndef SBUF_HEADER

#define SBUF_HEADER

#include "csapp.h"

typedef struct

{

int buf;          / Buffer array /

int n;             / Maximum number of slots /

int front;         / buf[(front+1)%n] is first item /

int rear;          / buf[rear%n] is last item /

sem_t mutex;       / Protects accesses to buf /

sem_t slots;       / Counts available slots /

sem_t items;       / Counts available items /

} sbuf_t;

//Function declaration

void sbuf_init(sbuf_t sp, int n);

void sbuf_deinit(sbuf_t sp);

void sbuf_insert(sbuf_t sp, int item);

int sbuf_remove(sbuf_t sp);

//Function declaration for sbuf_empty

int sbuf_empty(sbuf_t sp);

//Function declaration for sbuf_full

int sbuf_full(sbuf_t sp);

#endif

Modified code for “sbuf.c” file:

The modified code for “sbuf.c” from section 12.5.4 in book is given below:

#include "csapp.h"

#include "sbuf.h"

/ Create an empty, bounded, shared FIFO buffer with n slots /

void sbuf_init(sbuf_t sp, int n)

{

sp->buf = Calloc(n, sizeof(int));

sp->n = n;                       /* Buffer holds max of n items /

sp->front = sp->rear = 0;        / Empty buffer if front == rear /

Sem_init(&sp->mutex, 0, 1);      / Binary semaphore for locking /

Sem_init(&sp->slots, 0, n);      / Initially, buf has n empty slots /

Sem_init(&sp->items, 0, 0);      / Initially, buf has zero data items /

}

/ Clean up buffer sp /

void sbuf_deinit(sbuf_t sp)

{

Free(sp->buf);

}

/* Insert item onto the rear of shared buffer sp /

void sbuf_insert(sbuf_t sp, int item)

{

P(&sp->slots);                          /* Wait for available slot /

P(&sp->mutex);                          / Lock the buffer /

sp->buf[(++sp->rear)%(sp->n)] = item;   / Insert the item /

V(&sp->mutex);                          / Unlock the buffer /

V(&sp->items);                          / Announce available item /

}

/ Remove and return the first item from buffer sp /

int sbuf_remove(sbuf_t sp)

{

int item;

P(&sp->items);                          /* Wait for available item /

P(&sp->mutex);                          / Lock the buffer /

item = sp->buf[(++sp->front)%(sp->n)]; / Remove the item /

V(&sp->mutex);                          / Unlock the buffer /

V(&sp->slots);                          / Announce available slot /

return item;

}

//Function definition for empty buffer

int sbuf_empty(sbuf_t sp)

{

//Declare variable

int ne;

//For lock the buffer

P(&sp->mutex);

ne = sp->front == sp->rear;

//For lock the buffer

V(&sp->mutex);

return ne;

}

//Function definition for full buffer

int sbuf_full(sbuf_t *sp)

{

//Declare variable

int fn;

//For lock the buffer

P(&sp->mutex);

fn = (sp->rear - sp->front) == sp->n;

//For lock the buffer

V(&sp->mutex);

return fn;

}

For code “tiny.c” and “tiny.h”:

Same code as section 11.6 in book.

sample.html:

<!DOCTYPE html>

<html>

<head>

<meta charset="utf-8" />

<title>Home</title>

</head>

<body>

Tiny server Example

</body>

</html>

main.c:

#include <stdio.h>

#include "csapp.h"

#include "tiny.h"

#include "sbuf...

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 12, Problem 12.37HW

Chapter 12, Problem 12.39HW

Students have asked these similar questions

Specifications: Part-1Part-1: DescriptionIn this part of the lab you will build a single operation ALU. This ALU will implement a bitwise left rotation. Forthis lab assignment you are not allowed to use Digital's Arithmetic components.IF YOU ARE FOUND USING THEM, YOU WILL RECEIVE A ZERO FOR LAB2!The ALU you will be implementing consists of two 4-bit inputs (named inA and inB) and one 4-bit output (named out). Your ALU must rotate the bits in inA by the amount given by inB (i.e. 0-15).Part-1: User InterfaceYou are provided an interface file lab2_part1.dig; start Part-1 from this file.NOTE: You are not permitted to edit the content inside the dotted lines rectangle.Part-1: ExampleIn the figure above, the input values that we have selected to test are inA = {inA_3, inA_2, inA_1, inA_0} = {0, 1, 0,0} and inB = {inB_3, inB_2, inB_1, inB_0} = {0, 0, 1, 0}. Therefore, we must rotate the bus 0100 bitwise left by00102, or 2 in base 10, to get {0, 0, 0, 1}. Please note that a rotation left is…

How can I perform Laplace Transformation when using integration based on this? Where we convert time-based domain to frequency domain

what would be the best way I can explain the bevhoirs of Laplace and Inverse Transofrmation In MATLAB.

Chapter 12 Solutions

COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG

Ch. 12.1 - Prob. 12.1PP Ch. 12.1 - Prob. 12.2PP Ch. 12.2 - Practice Problem 12.3 (solution page 1036) In...Ch. 12.2 - Practice Problem 12.4 (solution page 1036) In the...Ch. 12.4 - Prob. 12.5PP Ch. 12.4 - Prob. 12.6PP Ch. 12.5 - Prob. 12.7PP Ch. 12.5 - Prob. 12.8PP Ch. 12.5 - Prob. 12.9PP Ch. 12.5 - Prob. 12.10PP

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Solution Summary: The author implements a concurrent prethreaded version of the TINY web server.

Concept explainers

Explanation of Solution

Want to see the full answer?

Chapter 12 Solutions