{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"Accelerating-RecSys-Training","owner":"STAR-Laboratory","isFork":false,"description":"Accelerating Recommender model training by leveraging popular choices -- VLDB 2022","allTopics":["computer-science","machine-learning","accelerator","recommender-system","computer-architecture","computer-systems","hybrid-training","popularity-recommender","deep-learning"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":27,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-09-18T00:10:17.770Z"}},{"type":"Public","name":"scale-srs","owner":"STAR-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-12T22:08:17.179Z"}},{"type":"Public","name":"STAR-Laboratory.github.io","owner":"STAR-Laboratory","isFork":true,"description":"📐 Jekyll theme for building a personal site, blog, project documentation, or portfolio.","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":24891,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-02-26T06:39:38.264Z"}},{"type":"Public","name":"aqua_rowhammer_mitigation","owner":"STAR-Laboratory","isFork":true,"description":"AQUA (IEEE MICRO 2022) Artifact","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":4,"license":"The Unlicense","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-05T21:10:39.402Z"}},{"type":"Public","name":"RandomizedRowSwap","owner":"STAR-Laboratory","isFork":false,"description":"Code Repository of the ASPLOS-2022 Paper on Randomized Row Swap","allTopics":["computer-science","security","computer-architecture","memory-systems","rowhammer","memory-security"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-05-16T19:04:21.195Z"}},{"type":"Public","name":"Hydra-ISCA2022","owner":"STAR-Laboratory","isFork":false,"description":"This is the source code for an implementation of Low-Overhead Hybrid Tracking (HYDRA) idea.","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-04-26T05:38:08.450Z"}},{"type":"Public","name":"FaultSim-A-Memory-Reliability-Simulator","owner":"STAR-Laboratory","isFork":true,"description":"FaultSim is a memory reliability simulator for 2D and 3D systems. FaultSim is created with the joint effort of Georgia Tech and AMD Inc -- ACM-TACO 2015","allTopics":["simulation","fault-tolerance","reliability","computer-architecture","error-correcting-codes","resilience","memory-systems"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":8,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-02-02T03:28:56.674Z"}},{"type":"Public","name":"morphcounters","owner":"STAR-Laboratory","isFork":true,"description":"Morphable Counters: Enabling Compact Integrity Trees For Low-Overhead Secure Memories -- MICRO 2018","allTopics":["security","compression","merkle-tree","sgx","memory-systems"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":4,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-01-28T23:55:23.402Z"}},{"type":"Public","name":"Thesaurus","owner":"STAR-Laboratory","isFork":true,"description":"Thesaurus: Efficient Cache Compression via Dynamic Clustering -- ASPLOS 2020","allTopics":["compression","clustering","cache","computer-architecture","clustering-algorithm","compression-algorithm","compression-implementations"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":"GNU General Public License v2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-09-14T23:20:56.860Z"}},{"type":"Public","name":"2DCC","owner":"STAR-Laboratory","isFork":true,"description":"2DCC: Cache Compression in Two Dimensions -- DATE 2020","allTopics":["compression","cache","computer-architecture","compression-algorithm","compression-implementations"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":"GNU General Public License v2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-09-14T22:45:57.202Z"}}],"repositoryCount":10,"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"}