In this project, your task is to design a user-level file system with the FUSE file system library. In addition, we have provided a test case (test_case.c) to help you debug and guide you as you develop your code. We have also provided some crucial debugging tips for FUSE. Finally, FUSE-based file systems are used in several real-world applications including Android-based phones.

Assume you are building a new startup for cloud infrastructure, Nimbus Systems, a competitor of Amazon Cloud Services. As the CEO, you decide to move the page table and memory allocation to software. In part 1 of this project, you will create a user-level page table that translates virtual addresses to physical addresses using a multi-level page table structure. In part 2, you will design and implement a translation lookaside…

In this project, you will learn how to implement scheduling mechanisms and policies. In project 1, you used the Linux pThread library for multi-threaded programming. In project 2, you will get a chance to implement a thread library, scheduling mechanism, and policies inside a thread library. You are required to implement a user-level thread library that has a similar interface compared to the pThread Library.

This simple warm-up project will help you recall basic systems programming concepts before tackling the second project. In the first part of this project, you will use the Linux pThread library to write a simple multi-threaded program. Part 2 involves writing functions for simple bit manipulations. Part 3 introduces user-level context switching with ucontext.h and asks you to debug a non-terminating program.

Introduction In project 3, you will implement a reliable sender using an unreliable UDP socket. There are two programs provided in the project 3 archive: sender.py and receiver.py. You will only modify sender.py. The sender.py program is a UDP sender that must implement the techniques of reliable delivery that we discussed during lecture to upload a file to the receiver. Specifically, you will…

Introduction In project 2, you will design and implement RU-DNS, a simple protocol mimicking the Domain Name System (DNS) we discussed in class. Rather than relying on the Internet’s DNS, you will build a set of DNS resolvers with private databases and a client program that resolves queries against this (distributed and hierarchical) database. Overall, there will be 6 programs in this project:

Introduction The goal of this project is to give you some hands-on practice with both Python and the basics of how two programs can talk to each other over a network. Don’t worry if this is your first time writing socket code, we’ll build things up step by step. You’ll be working with starter files that guide you through each task, and by the end you’ll have two separate programs: a server and a…

MIE1628 Assignment on Azure Cloud Platform PART A: 1. Explain below the 5 components shown in orange boxes. Explain which Azure components you will use where in this big data architecture and why. Raw Data Unstructured Data Structured Data Ingest Data Data Store Prepare and transform data Model and serve data Azure Databricks Azure Data Factory Azure Synapse Analytics Azure Cosmos…

1. Note: This assignment needs to be done by using the Azure Cloud Platform. In this assignment, you will be working with Azure Data Factory, Azure SQL DB, Blob storage account and ADLS Gen2. Submit a compressed archive (zip, tar, etc.) of your code, along with screenshots (output/input commands with results). Please include a pdf document with answers to the questions below.

Part A: Input Data - kddcup.data_10_percent.gz 10% subset. (2.1M; 75M Uncompressed) from Please read the paper provided with your assignment in the Quercus and answer the following question. 1. What is an Intrusion Detection System? Is it possible to implement an Intrusion Detection System on this dataset? Explain the workflow described in the paper for implementing the Intrusion Detection System.

PART A: Advanced Data Analysis with PySpark or SQL Spark (35 points) 1. Count Odd and Even Numbers o Using the provided integer.txt file, develop a spark script to count the number of odd and even integers. 2. Salary Aggregation with Statistical Analysis o Analyze the salary.txt file to compute total salaries per department. Expand your analysis to investigate trends or discrepancies in salary distributions.

Part 1: Line Counting with MapReduce (20 marks) 1. (15 marks) Implement a MapReduce program to count the number of lines in a large text file (shakespeare.txt). Analyze the performance of your implementation, considering factors such as the number of mappers and reducers, input file size, and network communication overhead. Provide a detailed performance analysis, including graphs as needed and a discussion of optimization strategies.

In this project, you will design a digital multiplier using Verilog, synthesize the design using standard cells from the TSMC 65nm technology, and place & route your synthesized netlist to obtain a Cadence layout of the digital circuit. Section 11.9.1 in the textbook will provide you with a starting point on unsigned array multiplication, as well as an example of a 4x4 array multiplier.

Consider a row decoder used to select one word within a 32-word register file, where each word is 64 bits wide. An example of such a decoder, for the case when it uses 4 stages of static CMOS logic to drive each word line, is shown in Fig. 1(a) (IP stands for ‘Input’). (a) (b) Figure 1. (a) An example of a 4-stage decoder architecture.

1 Device characterization 1. Use Cadence Composer to generate I-V curves for nMOS and pMOS transistors in the 65nmCMOS process (similar to those in Figures 8.16 and 8.17 in the textbook). Plot the eight curves on a single page for Wp = 64 units, and Wn = 32 units (for subfigure (b) in both figures, use twice the minimum gate length).

You are to write an implementation of the branch-and-bound partitioning algorithm described in class. It is to take netlist of (equal-sized) blocks and divide it into two equal-sized partitions (bi-partitioning) with the goal to minimize the number of nets that connect blocks in the two partitions. In addition, the input file will specify pairs of blocks that form “communities”. It is desirable if such pairs of blocks are assigned to the same partition.

You are to write an implementation of a basic analytical placer (AP), with overlap removal (spreading). As described in class, you will formulate the placement problem mathematically as a system of linear equations to be solved. You will use an existing package (UMFPACK within SuiteSparse) to solve the linear system (see Piazza page). For spreading, you will implement the flow-based approach, as described in class, and in the Darav et al.

You are to write an implementation of the FPGA maze router described in class, and study the impact of logic block pin placement on routability. You must have your program display the routing with graphics. A graphics package, EZGL, is provided on the course web page (courtesy of Prof. V. Betz). You are to develop your router so that it executes on Linux and you will hand it in electronically on the ECF network (i.e.

In this programming assignment, you will implement a simple web server to maintain your personal music library. Through this assignment, you will gain experience developing a more complex program that utilizes multiple CPU cores concurrently, implements persistent data storage, and incorporates external crates from the Rust ecosystem as dependencies. Basic Web Server As a starting point, your new web server, called 

In this programming assignment, you are expected to implement a command-line utility that makes HTTP requests, similar in spirit to the curl UNIX utility. This assignment will help you gain more experiences on using external crates in the Rust ecosystem as dependencies, and on handling errors. Basic Features As a starting point, your new command-line utility — called curl for simplicity in this assignment — should be able to make a standard 

In this programming assignment, you are expected to implement a command-line utility that searches for a specific string in one or multiple files, similar in spirit to the UNIX grep command. This assignment will help you practice command-line argument parsing, working with external crates as dependencies, and using file I/O in Rust. Foundation: Basic Search As a starting point, your command-line utility should accept a string, such as a simple string, and one file (possibly also including its path) as command-line arguments.

In this programming assignment, you are expected to implement a command-line utility for two human players to take turns and play a Reversi board game. The material you have learned in the first two lectures, including the guessing game example and basic programming concepts, will be useful when completing this assignment. Game Rules Here is a brief description of the Reversi board game.

Question 1 (Classifying MNIST via Basic Shallow RNN) It is not only the XOR computation that could be much easier via RNN. In fact, using RNNs we can perform conventional classification also efficiently with simple NNs. In this question, we aim to classify MNIST via a shallow vanilla RNN. Let’s first load MNIST dataset and break it into training and testing datasets.

In this assignment, we are going to implement two target architectures: a plain convolutional neural network (CNN) and a CNN with skip connection. The architecture of each CNN is described below. Both of these NNs perform binary classifications on 32 × 32 RGB images. We then implement and train them on a subset of CIFAR-10 dataset. 2.1 Plain CNN The architecture of the plain CNN is shown below.

Question 1 (Implementing Deep FNN) In this assignment, we implement a deep FNN for a simple classification task. Read the following test to get familiar with required packages and modules. Required Packages We are going to use three main packages torch , numpy and sklearn . The two former are used for computational tasks while the latter is used to generate some simple dataset.