{"payload":{"pageCount":4,"repositories":[{"type":"Public","name":"RawHash","owner":"CMU-SAFARI","isFork":false,"description":"RawHash is the first mechanism that can accurately and efficiently map raw nanopore signals to large reference genomes (e.g., a human reference genome) in real-time without using powerful computational resources (e.g., GPUs). Described by Firtina et al. (published at <a href=\"https://academic.oup.com/bioinformatics/article/39/Supplement_1/i297/7210440\" rel=\"nofollow\">https://academic.oup.com/bioinformatics/article/39/Supplement_1/i297/7210440</a>)","topicNames":["bioinformatics","nanopore","seeding","segmentation","event-detection","genome-analysis","hash-tables","contamination","read-mapping","relative-abundances"],"topicsNotShown":8,"allTopics":["bioinformatics","nanopore","seeding","segmentation","event-detection","genome-analysis","hash-tables","contamination","read-mapping","relative-abundances","nanopore-sequencing","nanopore-analysis-pipeline","nanopore-reads","nanopore-data","nanopore-minion","raw-signal","rawhash","raw-nanopore-signal-analysis"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":1,"issueCount":2,"starsCount":39,"forksCount":4,"license":"GNU General Public License v3.0","participation":[0,0,4,1,0,1,0,0,0,0,0,2,2,1,0,3,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,2,1,0,0,0,2,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-24T17:09:45.691Z"}},{"type":"Public","name":"AirLift","owner":"CMU-SAFARI","isFork":false,"description":"AirLift is a tool that updates mapped reads from one reference genome to another. Unlike existing tools, It accounts for regions not shared between the two reference genomes and enables remapping across all parts of the references. Described by Kim et al. (preliminary version at <a href=\"http://arxiv.org/abs/1912.08735\" rel=\"nofollow\">http://arxiv.org/abs/1912.08735</a>)","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":1,"issueCount":5,"starsCount":26,"forksCount":4,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-23T09:22:36.167Z"}},{"type":"Public","name":"Pythia","owner":"CMU-SAFARI","isFork":false,"description":"A customizable hardware prefetching framework using online reinforcement learning as described in the MICRO 2021 paper by Bera et al. (<a href=\"https://arxiv.org/pdf/2109.12021.pdf\" rel=\"nofollow\">https://arxiv.org/pdf/2109.12021.pdf</a>).","topicNames":["machine-learning","reinforcement-learning","computer-architecture","prefetcher","microarchitecture","cache-replacement","branch-predictor","champsim-simulator","champsim-tracer"],"topicsNotShown":0,"allTopics":["machine-learning","reinforcement-learning","computer-architecture","prefetcher","microarchitecture","cache-replacement","branch-predictor","champsim-simulator","champsim-tracer"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":106,"forksCount":34,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-22T22:00:48.396Z"}},{"type":"Public","name":"SiMRA-DRAM","owner":"CMU-SAFARI","isFork":false,"description":"Source code &amp; scripts for experimental characterization and demonstration of 1) simultaneous many-row activation, 2) up to nine-input majority operations and 3) copying one row's content to up 31 rows in real DDR4 DRAM chips. Described in our DSN'24 paper by Yuksel et al. at <a href=\"https://arxiv.org/abs/2405.06081\" rel=\"nofollow\">https://arxiv.org/abs/2405.06081</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"VHDL","color":"#adb2cb"},"pullRequestCount":0,"issueCount":0,"starsCount":6,"forksCount":0,"license":"Other","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,1,2,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-17T12:38:15.079Z"}},{"type":"Public","name":"DRAM-Bender","owner":"CMU-SAFARI","isFork":false,"description":"DRAM Bender is the first open source DRAM testing infrastructure that can be used to easily and comprehensively test state-of-the-art DDR4 modules of different form factors. Five prototypes are available on different FPGA boards. Described in our preprint: <a href=\"https://arxiv.org/pdf/2211.05838.pdf\" rel=\"nofollow\">https://arxiv.org/pdf/2211.05838.pdf</a>","topicNames":["testing","dram","rowhammer","fpga"],"topicsNotShown":0,"allTopics":["testing","dram","rowhammer","fpga"],"primaryLanguage":{"name":"VHDL","color":"#adb2cb"},"pullRequestCount":1,"issueCount":0,"starsCount":41,"forksCount":6,"license":"MIT License","participation":[3,2,0,0,0,0,0,0,1,0,2,0,2,0,4,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-10T13:26:35.922Z"}},{"type":"Public","name":"ramulator2","owner":"CMU-SAFARI","isFork":false,"description":"Ramulator 2.0 is a modern, modular, extensible, and fast cycle-accurate DRAM simulator. It provides support for agile implementation and evaluation of new memory system designs (e.g., new DRAM standards, emerging RowHammer mitigation techniques). Described in our paper <a href=\"https://people.inf.ethz.ch/omutlu/pub/Ramulator2_arxiv23.pdf\" rel=\"nofollow\">https://people.inf.ethz.ch/omutlu/pub/Ramulator2_arxiv23.pdf</a>","topicNames":["simulation","memory","dram"],"topicsNotShown":0,"allTopics":["simulation","memory","dram"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":2,"issueCount":18,"starsCount":162,"forksCount":40,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,5,0,0,0,0,0,1,0,0,1,2,0,0,0,0,0,1,0,15,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-10T03:07:09.278Z"}},{"type":"Public","name":"HBM-Read-Disturbance","owner":"CMU-SAFARI","isFork":false,"description":"Detailed read disturbance (RowHammer and RowPress) characterization of six real HBM2 DRAM chips yielding 23 new observations and 8 new takeaways, as described in the DSN'24 paper <a href=\"https://arxiv.org/pdf/2310.14665.pdf\" rel=\"nofollow\">https://arxiv.org/pdf/2310.14665.pdf</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-03T07:11:55.388Z"}},{"type":"Public","name":"ABACuS","owner":"CMU-SAFARI","isFork":false,"description":"New RowHammer mitigation mechanism that is area-, performance-, and energy-efficient especially at very low (e.g., 125) RowHammer thresholds, as described in the USENIX Security'24 paper <a href=\"https://arxiv.org/pdf/2310.09977.pdf\" rel=\"nofollow\">https://arxiv.org/pdf/2310.09977.pdf</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":12,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-02T14:08:33.281Z"}},{"type":"Public","name":"prim-benchmarks","owner":"CMU-SAFARI","isFork":false,"description":"PrIM (Processing-In-Memory benchmarks) is the first benchmark suite for a real-world processing-in-memory (PIM) architecture. PrIM is developed to evaluate, analyze, and characterize the first publicly-available real-world PIM architecture, the UPMEM PIM architecture. Described by Gómez-Luna et al. (<a href=\"https://arxiv.org/abs/2105.03814\" rel=\"nofollow\">https://arxiv.org/abs/2105.03814</a>).","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":2,"issueCount":3,"starsCount":124,"forksCount":45,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-29T13:51:46.737Z"}},{"type":"Public","name":"FCDRAM","owner":"CMU-SAFARI","isFork":false,"description":"Source code &amp; scripts for experimental characterization and demonstration of performing NOT and up to 16-input AND, NAND, OR, and NOR operations in real DDR4 DRAM chips. Described in our HPCA'24 paper by Yuksel et al. at <a href=\"https://arxiv.org/abs/2402.18736\" rel=\"nofollow\">https://arxiv.org/abs/2402.18736</a>","topicNames":["dram-characterization","processing-in-memory","processing-using-dram"],"topicsNotShown":0,"allTopics":["dram-characterization","processing-in-memory","processing-using-dram"],"primaryLanguage":{"name":"VHDL","color":"#adb2cb"},"pullRequestCount":0,"issueCount":0,"starsCount":8,"forksCount":0,"license":"Other","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-09T12:28:47.745Z"}},{"type":"Public","name":"CoMeT","owner":"CMU-SAFARI","isFork":false,"description":"CoMeT is a new low-cost RowHammer mitigation that uses Count-Min Sketch-based aggressor row tracking, as described in our HPCA'24 paper <a href=\"https://arxiv.org/pdf/2402.18769.pdf\" rel=\"nofollow\">https://arxiv.org/pdf/2402.18769.pdf</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":0,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-05T20:38:42.057Z"}},{"type":"Public","name":"MIMDRAM","owner":"CMU-SAFARI","isFork":false,"description":"Source code for the architectural simulator used for modeling the PUD system proposed in our HPCA 2024 paper `MIMDRAM: An End-to-End Processing-Using-DRAM System for High-Throughput, Energy-Efficient and Programmer-Transparent Multiple-Instruction Multiple-Data Processing''. Paper is at: <a href=\"https://arxiv.org/pdf/2402.19080.pdf\" rel=\"nofollow\">https://arxiv.org/pdf/2402.19080.pdf</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":6,"forksCount":4,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-05T07:37:13.294Z"}},{"type":"Public","name":"Rubicon","owner":"CMU-SAFARI","isFork":false,"description":"RUBICON is a novel framework to automatically develop deep-learning-based genomic basecallers for any given architecture, as described in our Genome Biology'24 paper <a href=\"https://genomebiology.biomedc\" rel=\"nofollow\">https://genomebiology.biomedc</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-22T13:54:32.953Z"}},{"type":"Public","name":"MetaTrinity","owner":"CMU-SAFARI","isFork":false,"description":"MetaTrinity is a novel metagenomic analysis tool employing efficient containment search techniques and heuristics for read mapping to achieve significant speedup while maintaining high accuracy. This positions MetaTrinity as an efficient solution, optimally balancing speed and precision in metagenomic analysis.","topicNames":["genomics","metagenomics","containment-search","clinical-research","metagenomic-analysis","microbiome-analysis","medical-application","readmapping"],"topicsNotShown":0,"allTopics":["genomics","metagenomics","containment-search","clinical-research","metagenomic-analysis","microbiome-analysis","medical-application","readmapping"],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":1,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-16T14:04:45.965Z"}},{"type":"Public","name":"Hermes","owner":"CMU-SAFARI","isFork":false,"description":"A speculative mechanism to accelerate long-latency off-chip load requests by removing on-chip cache access latency from their critical path, as described by MICRO 2022 paper by Bera et al. (<a href=\"https://arxiv.org/pdf/2209.00188.pdf\" rel=\"nofollow\">https://arxiv.org/pdf/2209.00188.pdf</a>)","topicNames":["machine-learning","cache","perceptron","computer-architecture","microarchitecture","perceptron-learning-algorithm","prefetching"],"topicsNotShown":0,"allTopics":["machine-learning","cache","perceptron","computer-architecture","microarchitecture","perceptron-learning-algorithm","prefetching"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":58,"forksCount":12,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-04T11:49:46.710Z"}},{"type":"Public","name":"RowPress","owner":"CMU-SAFARI","isFork":false,"description":"Source code &amp; scripts for experimental characterization and real-system demonstration of RowPress, a widespread read disturbance phenomenon in DRAM that is different from RowHammer. Described in our ISCA'23 paper by Luo et al. at <a href=\"https://people.inf.ethz.ch/omutlu/pub/RowPress_isca23.pdf\" rel=\"nofollow\">https://people.inf.ethz.ch/omutlu/pub/RowPress_isca23.pdf</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"VHDL","color":"#adb2cb"},"pullRequestCount":0,"issueCount":0,"starsCount":28,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-11T12:41:36.507Z"}},{"type":"Public","name":"SequenceLab","owner":"CMU-SAFARI","isFork":false,"description":"SequenceLab is a benchmark suite for evaluating computational methods for comparing genomic sequences, such as pre-alignment filters and pairwise sequence alignment algorithms. SequenceLab is described by Rumpf et al. at <a href=\"https://arxiv.org/abs/2310.16908\" rel=\"nofollow\">https://arxiv.org/abs/2310.16908</a>","topicNames":["benchmark","sequence-alignment","read-mapping"],"topicsNotShown":0,"allTopics":["benchmark","sequence-alignment","read-mapping"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-23T12:24:08.143Z"}},{"type":"Public","name":"PiDRAM","owner":"CMU-SAFARI","isFork":false,"description":"PiDRAM is the first flexible end-to-end framework that enables system integration studies and evaluation of real Processing-using-Memory techniques. Prototype on a RISC-V rocket chip system implemented on an FPGA. Described in our paper: <a href=\"https://arxiv.org/abs/2111.00082\" rel=\"nofollow\">https://arxiv.org/abs/2111.00082</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":54,"forksCount":7,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-11T13:52:51.077Z"}},{"type":"Public","name":"EINSim","owner":"CMU-SAFARI","isFork":false,"description":"DRAM error-correction code (ECC) simulator incorporating statistical error properties and DRAM design characteristics for inferring pre-correction error characteristics using only the post-correction errors. Described in the 2019 DSN paper by Patel et al.: <a href=\"https://people.inf.ethz.ch/omutlu/pub/understanding-and-modeling-in-DRAM-ECC_dsn19.pdf\" rel=\"nofollow\">https://people.inf.ethz.ch/omutlu/pub/understanding-and-modeling-in-DRAM-ECC_dsn19.pdf</a>.","topicNames":["simulator","reliability","statistical-inference","dram","error-correcting-codes","map-estimation","error-correction"],"topicsNotShown":0,"allTopics":["simulator","reliability","statistical-inference","dram","error-correcting-codes","map-estimation","error-correction"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":9,"forksCount":2,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-07T20:08:46.591Z"}},{"type":"Public","name":"Virtuoso","owner":"CMU-SAFARI","isFork":false,"description":"Virtuoso is a new simulator that focuses on modelling various memory management and virtual memory aspects.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":19,"forksCount":6,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-17T14:15:00.109Z"}},{"type":"Public","name":"SelfManagingDRAM","owner":"CMU-SAFARI","isFork":false,"description":"Source code for evaluating the performance and DRAM energy benefits of Self-Managing DRAM (SMD), proposed in <a href=\"https://arxiv.org/abs/2207.13358\" rel=\"nofollow\">https://arxiv.org/abs/2207.13358</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-11T16:29:18.059Z"}},{"type":"Public","name":"RawAlign","owner":"CMU-SAFARI","isFork":false,"description":"RawAlign is a real-time raw nanopore read mapper based on the Seed-Filter-Align paradigm as described by Lindegger et al. (<a href=\"https://arxiv.org/abs/2310.05037\" rel=\"nofollow\">https://arxiv.org/abs/2310.05037</a>)","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":5,"forksCount":0,"license":"GNU General Public License v3.0","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-02T12:21:13.528Z"}},{"type":"Public","name":"Utopia","owner":"CMU-SAFARI","isFork":false,"description":"Utopia is a new hybrid address mapping scheme that accelerates address translation while supporting all conventional VM features as described by Kanellopoulos et al. (<a href=\"https://arxiv.org/abs/2211.12205\" rel=\"nofollow\">https://arxiv.org/abs/2211.12205</a>)","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":0,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-01T12:11:17.830Z"}},{"type":"Public","name":"MQSim","owner":"CMU-SAFARI","isFork":false,"description":"MQSim is a fast and accurate simulator modeling the performance of modern multi-queue (MQ) SSDs as well as traditional SATA based SSDs. MQSim faithfully models new high-bandwidth protocol implementations, steady-state SSD conditions, and the full end-to-end latency of requests in modern SSDs. It is described in detail in the FAST 2018 paper by A…","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":4,"issueCount":22,"starsCount":265,"forksCount":144,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-25T02:06:54.634Z"}},{"type":"Public","name":"SimplePIM","owner":"CMU-SAFARI","isFork":false,"description":"SimplePIM is the first high-level programming framework for real-world processing-in-memory (PIM) architectures. Described in the PACT 2023 paper by Chen et al. (<a href=\"https://arxiv.org/pdf/2310.01893.pdf\" rel=\"nofollow\">https://arxiv.org/pdf/2310.01893.pdf</a>).","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":16,"forksCount":3,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,2,2,0,0,2,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-23T09:29:37.628Z"}},{"type":"Public","name":"Victima","owner":"CMU-SAFARI","isFork":false,"description":"Victima is a new software-transparent technique that greatly extends the address translation reach of modern processors by leveraging the underutilized resources of the cache hierarchy, as desribed in the MICRO 2023 paper by Kanellopoulos et al. (<a href=\"https://arxiv.org/pdf/2310.04158/\" rel=\"nofollow\">https://arxiv.org/pdf/2310.04158/</a>)","topicNames":["memory","virtual-memory"],"topicsNotShown":0,"allTopics":["memory","virtual-memory"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":22,"forksCount":10,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,29,6,4,33,13,1,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-13T22:39:21.488Z"}},{"type":"Public","name":"GateSeeder","owner":"CMU-SAFARI","isFork":false,"description":"GateSeeder is the first near-memory CPU-FPGA co-design for alleviating both the compute-bound and memory-bound bottlenecks in short and long-read mapping. GateSeeder outperforms Minimap2 by up to 40.3×, 4.8×, and 2.3× when mapping real ONT, HiFi, and Illumina reads, respectively.","topicNames":["bioinformatics","fpga","genomics","indexing","seeding","hbm","sequence-alignment","read-mapping","long-reads","minimap2"],"topicsNotShown":3,"allTopics":["bioinformatics","fpga","genomics","indexing","seeding","hbm","sequence-alignment","read-mapping","long-reads","minimap2","minimizers","short-reads","genome-on-diet"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-03T20:29:15.521Z"}},{"type":"Public","name":"Genome-on-Diet","owner":"CMU-SAFARI","isFork":false,"description":"Genome-on-Diet is a fast and memory-frugal framework for exemplifying sparsified genomics for read mapping, containment search, and metagenomic profiling. It is much faster &amp; more memory-efficient than minimap2 for Illumina, HiFi, and ONT reads. Described by Alser et al. (preliminary version: <a href=\"https://arxiv.org/abs/2211.08157\" rel=\"nofollow\">https://arxiv.org/abs/2211.08157</a>).","topicNames":["metagenomics","variant-calling","containment-search","genome-analysis","large-scale","sequence-alignment","read-mapping","metagenomic-analysis","microbiome-analysis","minimap2"],"topicsNotShown":4,"allTopics":["metagenomics","variant-calling","containment-search","genome-analysis","large-scale","sequence-alignment","read-mapping","metagenomic-analysis","microbiome-analysis","minimap2","wavefront-alignment","genome-on-diet","bioinformatics","genomics"],"primaryLanguage":{"name":"Roff","color":"#ecdebe"},"pullRequestCount":0,"issueCount":0,"starsCount":11,"forksCount":4,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,8,9,0,1,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-09-28T08:34:09.286Z"}},{"type":"Public","name":"ramulator","owner":"CMU-SAFARI","isFork":false,"description":"A Fast and Extensible DRAM Simulator, with built-in support for modeling many different DRAM technologies including DDRx, LPDDRx, GDDRx, WIOx, HBMx, and various academic proposals. Described in the IEEE CAL 2015 paper by Kim et al. at <a href=\"http://users.ece.cmu.edu/~omutlu/pub/ramulator_dram_simulator-ieee-cal15.pdf\" rel=\"nofollow\">http://users.ece.cmu.edu/~omutlu/pub/ramulator_dram_simulator-ieee-cal15.pdf</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":6,"issueCount":58,"starsCount":514,"forksCount":206,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-08-29T09:48:04.714Z"}},{"type":"Public","name":"SoftMC","owner":"CMU-SAFARI","isFork":false,"description":"SoftMC is an experimental FPGA-based memory controller design that can be used to develop tests for DDR3 SODIMMs using a C++ based API. The design, the interface, and its capabilities and limitations are discussed in our HPCA 2017 paper: \"SoftMC: A Flexible and Practical Open-Source Infrastructure for Enabling Experimental DRAM Studies\" &lt;<a href=\"https://people.inf.ethz.ch/omutlu/pub/softMC_hpca17.pdf\" rel=\"nofollow\">https:/…</a>","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Verilog","color":"#b2b7f8"},"pullRequestCount":0,"issueCount":1,"starsCount":120,"forksCount":27,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-08-24T21:20:39.021Z"}}],"repositoryCount":98,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}