Posts

Showing posts from February, 2017

The WeakReference class, monitoring memory leak and garbage collection in a Java application

-
Image
 Below is a Stack implementation that uses an internal resizeable array structure.  public class MyStack< T > implements Stack< T > { private static final int CAPACITY = 100 ; private Object[] array ; private int pos = 0 ; public MyStack () { this . array = new Object[ CAPACITY ] ; } @Override public void push ( T item) { if ( pos >= array . length / 2 ) { Object[] newArray = new Object[ pos * 2 ] ; System. arraycopy ( array , 0 , newArray , 0 , array . length ) ; array = newArray ; } array [ pos ++] = item ; } @Override public T pop () { if (isEmpty()) { throw new RuntimeException( "empty stack" ) ; } @SuppressWarnings ( "unchecked" ) T item = ( T ) array [ pos - 1 ] ; pos -= 1 ; return item ; } @Override @SuppressWarnings ( "unchecked" ) public T peek...
Post a Comment
Read more

Understanding SimpleScalar codebase

-
Among others, sim-safe is the most user-friendly simulator and the implementation is crafted for clarity. Generally there are two types of simulators: Functional simulators implement architecture (what programmers see) perform the actual execution sim-fast, sim-safe , sim-profile, sim-cache Performance simulators implement micro-architecture model system internals measure time sim-outorder Question: What is Dlite debugger? How can we debug a simulator?? DLite is a symbolic debugger. To use it, start the simulator with -i option Then user the debugger commands, for example: "step" Question: To work with TLB, do I have to fully understand sim-outorder ?? http://www.simplescalar.com/docs/simple_tutorial_v2.pdf page:14 http://www.simplescalar.com/docs/hack_guide_v2.pdf Question: How does sim-safe count number of instructions? Where is iTLB related code? In main.c file: /* options database*/ struct opt_odb_t *sim_odb; /* simulated re...
Post a Comment
Read more

More on Virtual Memory and TLB

-
Below is a series of videos on virtual memory: https://www.youtube.com/watch?v=KNUJhZCQZ9c Virtual memory is a layer of indirection. Without virtual memory the program address would be equal to the RAM address.  Discs are 1000x slower than RAM. What happens if a page is not on RAM?  Page table tells that the page is on disc. Hardware (CPU) generates a page fault exception . This exception will be picked up by the operating system. ( page fault handler ) Operating system kicks out (evicts) another page from RAM and writes it to disc If the page is dirty, it needs to be written back to disc first. Then OS reads the page from disk and puts it in RAM Then OS updates the page table to map the new page Finally OS jumps back to the instruction that caused the page fault A page fault is the slowest possible thing that can happen to a computer. (except for human interaction) Some operating sytems do not use paging: iOS kills the program if it uses too much memory....
Post a Comment
Read more

Popular posts from this blog

Trie Data Structure and Finding Patterns in a Collection of Words

-
Image
 I faced a very hard problem recently about finding substrings based on a collection of patterns.  Example For  words = ["Apple", "Melon", "Orange", "Watermelon"]  and  parts = ["a", "mel", "lon", "el", "An"] , the output should be  findSubstrings(words, parts) = ["Apple", "Me[lon]", "Or[a]nge", "Water[mel]on"] . While  "Watermelon"  contains three substrings from the  parts  array,  "a" ,  "mel" , and  "lon" ,  "mel"  is the longest substring that appears first in the string. Note: Number of words and number of parts can be huge! A brute force method or careless usage of Java String methods would make it impossible to handle a large number of words and parts (patterns). Solution Approach Whenever we want to search patterns inside a string, we should think about the Trie data structure:  https://en.wikipedia....
Read more

My Crappy Looking Solution to "Binary Tree Common Ancestor" Problem

-
I was able to solve this problem and make all the tests pass: https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor/problem But I'm not happy with the code, so later I need to refactor the code. Here it is: static Node lca(Node root, int v1, int v2) { ArrayList result = new ArrayList<>(); Node result2 = traverse (root, v1, v2, result); if (result.isEmpty()) return result2; return result.get( 0 ); } private static Node traverse(Node root, int v1, int v2, ArrayList result) { if (!result.isEmpty()) { return result.get( 0 ); } if (root. left == null && root. right == null ) { return root; } if (root. data == v1 || root. data == v2) { return root; } Node node1 = null , node2 = null ; if (root. left != null ) node1 = traverse (root. left , v1, v2, result); if (root. right != null ) node2 = traverse (root. right , v1, v...
Read more

A Graph Application in Java: Using WordNet to Find Outcast Words

-
Image
I'll explain our intent with an example: Let's say we have the following words: horse, zebra, cat, bear, table Which one is the outcast? The table.. But how can a computer system find this? We are talking about the whole English language and any word can be in this list. The number of words in the list can be huge, so the solution should use appropriate data structures and algorithms.  We'll use WordNet which is a graph of English words. It contains the semantic relationships between words and our concern is the "is a" relationship. For our example, we know that horse and cat are both animals. "Table" is not an animal and it is the outcast in this situation. But we even have the ability to tell that horse and zebra is very close. Below is a unit test that shows a high level view of our application in Java: public class OutcastTest {     private WordNet wordNet;     private Outcast outcast;     @Before ...
Read more