{"push_id":911361800,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"d8c747ad28bb05c331bb7bc118dff07acaef0e4d","before":"e7abdd6064eb969fcf465ab84648b1cbbb99ddea","commits":[{"sha":"a4989e77e1ee530f05e8455d17dac2eb870f4280","author":{"email":"744e920d378a62a7a7a9f1c42224125457cd8b33@gmail.com","name":"Anirudh Sivaraman"},"message":"Use PIFOPipelineStage within pifo_machine","distinct":true,"url":"https://api.github.com/repos/anirudhSK/pifo-machine/commits/a4989e77e1ee530f05e8455d17dac2eb870f4280"},{"sha":"1135cd3f70655642bc6845fda21d8f2d36ee8bfe","author":{"email":"744e920d378a62a7a7a9f1c42224125457cd8b33@gmail.com","name":"Anirudh Sivaraman"},"message":"Flesh out stream insertion for pipeline stage","distinct":true,"url":"https://api.github.com/repos/anirudhSK/pifo-machine/commits/1135cd3f70655642bc6845fda21d8f2d36ee8bfe"},{"sha":"d8c747ad28bb05c331bb7bc118dff07acaef0e4d","author":{"email":"744e920d378a62a7a7a9f1c42224125457cd8b33@gmail.com","name":"Anirudh Sivaraman"},"message":"PIFO pipeline reference model, which models:\n\n1. A single \"PIFO\".\n2. A \"priority queue\" / \"calendar queue\" wrapped over the PIFO.\n3. A \"stage\" consisting of many \"priority queues\" and/or \"calendar queues\".\n4. On the input side, the stage consists of a priority \"computer\"\nthat computes priorities/departure times before enqueuing into the\npriority/calendar queues in that stage.\n5. On the output side, the stage consists of a look-up table that\ndirects dequeue results to the next hop for further processing.\n\nBased on Da's suggestion, we are assuming the entire pipeline executes\nin one clock cycle end-to-end (as opposed to one clock cycle per\npipeline stage). But, we'll be imposing constraints on the number of ops\nper clock within each stage of this pipeline.  Runs now, haven't\nverified the results though.  Moving onto generating reasonable tests.","distinct":true,"url":"https://api.github.com/repos/anirudhSK/pifo-machine/commits/d8c747ad28bb05c331bb7bc118dff07acaef0e4d"}]}