{"push_id":1200523661,"size":6,"distinct_size":6,"ref":"refs/heads/implicit-free-without-ftr","head":"0d7aa40f2fb72af253a25a7b52bf8852e5882086","before":"c730c5dd69785a75fdece245eb06a399f346923a","commits":[{"sha":"69839e03a09b85461e24a728c481aca453adee1d","author":{"name":"Saksham Jain","email":"c210245c0b6acd5504a220c908a46f575e1de5b9@gmail.com"},"message":"Automated setting of prev_alloc bit\n\nInstead of manually changing the prev_alloc bit each time a block\nalloced/freed, it is changed whenever a header of prev block is changed.\n\nSigned-off-by: Saksham Jain <sakjain92.work@gmail.com>","distinct":true,"url":"https://api.github.com/repos/sakjain92/15-513-Malloclab/commits/69839e03a09b85461e24a728c481aca453adee1d"},{"sha":"730709be707282e10d9562ac408f611f5132b4cb","author":{"name":"Saksham Jain","email":"c210245c0b6acd5504a220c908a46f575e1de5b9@gmail.com"},"message":"Use external queue head instead of epilogue\n\nWas using epilogue earlier as head of queue. This caused two issues:\n1) Whenever heap extended, epilogue had to be managed (copied)\n2) Only one list could be maintained.\n\nNow using a global variable as queue head\n\nSigned-off-by: Saksham Jain <sakjain92.work@gmail.com>","distinct":true,"url":"https://api.github.com/repos/sakjain92/15-513-Malloclab/commits/730709be707282e10d9562ac408f611f5132b4cb"},{"sha":"b14e8f105a2b6e0230a970b68928f640ef0bc31a","author":{"name":"Saksham Jain","email":"c210245c0b6acd5504a220c908a46f575e1de5b9@gmail.com"},"message":"Add mm-segregated.c file\n\nUses segregated lists to keep tab of blocks of different sizes.\nTip: To increase further efficiency, use balanced tree for individual\ntrees to get best fit. But this might increase freeing and allocation\ntime.\n\nSigned-off-by: Saksham Jain <sakjain92.work@gmail.com>","distinct":true,"url":"https://api.github.com/repos/sakjain92/15-513-Malloclab/commits/b14e8f105a2b6e0230a970b68928f640ef0bc31a"},{"sha":"94bde2f0acf822e8975ee0792e917e31b00859d4","author":{"name":"Saksham Jain","email":"c210245c0b6acd5504a220c908a46f575e1de5b9@gmail.com"},"message":"Keep heads of queues on heap instead of global data\n\nDue to restriction in size of data to be kept in global (and because we\nwould want many heads in case of segregated free list), keeping the\nheads on heap.\nTips: Changing heap size allocated for heads has definately an impact on\nutilization. But increasing it also reduces throughput. Why so?\n\nSigned-off-by: Saksham Jain <sakjain92.work@gmail.com>","distinct":true,"url":"https://api.github.com/repos/sakjain92/15-513-Malloclab/commits/94bde2f0acf822e8975ee0792e917e31b00859d4"},{"sha":"0702dd9a64c8410aaf83e0c9b84694ca8feaa09e","author":{"name":"Saksham Jain","email":"c210245c0b6acd5504a220c908a46f575e1de5b9@gmail.com"},"message":"Add results of explicit and segregated list\n\nSigned-off-by: Saksham Jain <sakjain92.work@gmail.com>","distinct":true,"url":"https://api.github.com/repos/sakjain92/15-513-Malloclab/commits/0702dd9a64c8410aaf83e0c9b84694ca8feaa09e"},{"sha":"0d7aa40f2fb72af253a25a7b52bf8852e5882086","author":{"name":"Saksham Jain","email":"c210245c0b6acd5504a220c908a46f575e1de5b9@gmail.com"},"message":"Add best fit support in segregated list\n\nThis doesn't add much to utilization but reduces throughput sharply.\nTip: Use balanced tree for more throughput.\nTip: Need to concentrate on smaller minimum chunk to increase\nutilization\n\nSigned-off-by: Saksham Jain <sakjain92.work@gmail.com>","distinct":true,"url":"https://api.github.com/repos/sakjain92/15-513-Malloclab/commits/0d7aa40f2fb72af253a25a7b52bf8852e5882086"}]}
{"actor":{"display_login":"sakjain92"}}