Pinned Repositories
BitTorrentClone
P2P File Sharing Software
CacheManager
A cache manager to support multiple readers/writers. Think of a service to manage in-memory cache which can support such clients. Writers/readers are random and can make requests at any time Strong consistency guarantees: A reader should never read stale data (data written to already) Readers should get notified if the data they have has gone stale. Readers get preference over writers, multiple readers-one writer at a time. No starvation. Bonus: Design the system so that it can be distributed. No need to consider high availability for this exercise.
COP-5536-ADVANCED-DATA-STRUCTURES
University of Florida Fall 2016
COP-5615-DISTRIBUTED-OPERATING-SYSTEM
University of Florida Fall 2016
COP-5618-Concurrent-Programming
University of Florida Fall 2016
MIPSSimulator
Optimal-Center-Star
The main idea of this paper is to provide a improvised version of Center star algorithm with an advantage of achieving better run time as it makes use of concepts like keyword tree and sliding window to align matched regions. It uses Global Alignment (Needleman Wunsch - dynamic programming) algorithm only to align mismatched sequences, thereby saving a lot of time involved in rather aligning entire sequence by dynamic programming.
OptimalMSA
PipelinedMIPSSimulator
jmashruw's Repositories
jmashruw/COP-5536-ADVANCED-DATA-STRUCTURES
University of Florida Fall 2016
jmashruw/COP-5615-DISTRIBUTED-OPERATING-SYSTEM
University of Florida Fall 2016
jmashruw/COP-5618-Concurrent-Programming
University of Florida Fall 2016
jmashruw/MIPSSimulator
jmashruw/CacheManager
A cache manager to support multiple readers/writers. Think of a service to manage in-memory cache which can support such clients. Writers/readers are random and can make requests at any time Strong consistency guarantees: A reader should never read stale data (data written to already) Readers should get notified if the data they have has gone stale. Readers get preference over writers, multiple readers-one writer at a time. No starvation. Bonus: Design the system so that it can be distributed. No need to consider high availability for this exercise.
jmashruw/Optimal-Center-Star
The main idea of this paper is to provide a improvised version of Center star algorithm with an advantage of achieving better run time as it makes use of concepts like keyword tree and sliding window to align matched regions. It uses Global Alignment (Needleman Wunsch - dynamic programming) algorithm only to align mismatched sequences, thereby saving a lot of time involved in rather aligning entire sequence by dynamic programming.
jmashruw/OptimalMSA
jmashruw/PipelinedMIPSSimulator