Computers and Technology, 19.03.2020 21:35 HOPING4632

Alice p. hacker has two types of memory that she's using to build her system to store her objects. the first type, type a is extremely fast, but it's expensive and she doesn't have much of it. she has 10gb of type a memory that can being used to store objects, and reading an object from this memory takes 5ms. the second type of memory, type z, is a lot slower, but it's cheap, and so alice bought a lot of it. she has 1tb of the second type of memory that she can use to store objects, and reading an object from this memory takes 200ms. alice decides she's going to build a system where she keeps all of her objects in the second type of memory, and then also keeps copies of some of those objects in the first type so that she can do some of her reads more quickly. alice has 2048 objects, all of the same size, which use up all of her second type of memory storage. alice decides to analyze different ways to pick and choose what she keeps in her type a memory, and how they affect her expected object read performance. round all answers to 3 decimal places. if alice is naive and decides to randomly fill her type a memory with objects and never change it, what is her expected time to read 10 randomly selected objects out of the 2048 (in ms)? alice now runs a workload where she reads 20 objects per minute. 50% of the objects she reads are objects she's seen in the past 30 seconds, and the other 50% of the objects are randomly chosen from the full 2048. using the same naive strategy as before, what is her expected average read time for an object with this workload? alice tries to improve her performance. she decides that every time she reads an object, if it is not in her type a memory, she will put it there. when she needs to remove something, she will remove the thing that she read least recently what is alice's average read time per object in the best case scenario? what is alice's average read time per object in the worst case scenario?

Answers: 3

Show answers

Another question on Computers and Technology

Computers and Technology, 23.06.2019 02:00

In the context of an internet connection, llc stands for leased line connection liability limited company local loop complex local loop carrier

Answers: 1

Answer

Computers and Technology, 23.06.2019 02:30

Which component acts as a platform on which application software runs

Answers: 2

Answer

Computers and Technology, 23.06.2019 19:00

This question involves a class named textfile that represents a text file. public class textfile { private string filename; private string filename; private arraylist words; // constructors not shown // postcondition: returns the number of bytes in this file public int filesize() { } // precondition: 0 < = index < words.size() // postcondition: removes numwords words from the words arraylist beginning at // index. public void deletewords(int index, int numwords) { } // precondition: 0 < = index < = words.size() // postcondition: adds elements from newwords array to words arraylist beginning // at index. pub lic voidaddwords(int index, string[] newwords) { } // other methods not shown } complete the filesize() method. the filesize() is computed in bytes. in a text file, each character in each word counts as one byte. in addition, there is a space in between each word in the words arraylist, and each of those spaces also counts as one byte. for example, suppose the words arraylist stores the following words: { mary had a little lamb; its fleece was white as snow. } the filesize() method would compute 4 + 3 + 1 + 6 + 5 + 4 + 6 + 3 + 5 + 2 + 5 as the sum of the lengths of each string in the arraylist. the value returned would be this sum plus 10, because there would also be 10 spaces in between the 11 words. complete the filesize() method below: // postcondition: returns the number of bytes in this file public int filesize() { }

Answers: 1

Answer

Computers and Technology, 24.06.2019 00:20

Describe a data structures that supports the stack push and pop operations and a third operation findmin, which returns the smallest element in the data structure, all in o(1) worst-case time.

Answers: 2

Answer

You know the right answer?

Alice p. hacker has two types of memory that she's using to build her system to store her objects. t...

Questions