{"push_id":866306645,"size":3,"distinct_size":3,"ref":"refs/heads/bcomponents-experiments","head":"fe5cdadd33dc4feedab4ec5722dbe3bac4556aa8","before":"4991a0f73d767ea892723df78d0afddbbbc025b5","commits":[{"sha":"f1ae7fcd97009b3bb6efbdb192185dc1fa9d498d","author":{"email":"8e48487a13340aa38de2788551e14a90e69e20a1@students.mimuw.edu.pl","name":"Michał Ciszewski"},"message":"Add additional common bank allocation algorithms\n\nNew algorithms for allocating the common bank in the first stage of the\nbiconnected components heuristic are implemented: a 2-approximation\nalgorithm and a no operation algorithm. A common bank allocation algorithm\ncan be selected by using option '--common-bank-allocation-algorithm' in\nan invocation of the 8051 backend.","distinct":true,"url":"https://api.github.com/repos/mimuw-distributed-systems-group/wNesC-Compiler/commits/f1ae7fcd97009b3bb6efbdb192185dc1fa9d498d"},{"sha":"e1ad3c62be317e86f0038db91fa8bf5458414683","author":{"email":"8e48487a13340aa38de2788551e14a90e69e20a1@students.mimuw.edu.pl","name":"Michał Ciszewski"},"message":"Allow for selecting target bank choice methods\n\nIt is now possible to select target bank choice methods for allocations in\ncut vertices, DFS allocations and arbitrary subtree partitioning allocations.\nOptions '--bank-choice-method-cut-vertices', '--bank-choice-method-dfs' and\n'--bank-choice-method-asp' can be used to this end.","distinct":true,"url":"https://api.github.com/repos/mimuw-distributed-systems-group/wNesC-Compiler/commits/e1ad3c62be317e86f0038db91fa8bf5458414683"},{"sha":"fe5cdadd33dc4feedab4ec5722dbe3bac4556aa8","author":{"email":"8e48487a13340aa38de2788551e14a90e69e20a1@students.mimuw.edu.pl","name":"Michał Ciszewski"},"message":"Implement new methods for picking allocations\n\nNew methods for picking allocations can be selected for the arbitrary subtree\npartitioning in the biconnected components heuristic. A method can be chosen\nby using option '--allocation-picker-asp'. An allocation with the greatest\nfunctions size amongst a specific number of allocation with the smallest\nweights sums or an allocation with the smallest weights sum amongst a specific\nnumber of allocations with the greatest functions sizes can be chosen.","distinct":true,"url":"https://api.github.com/repos/mimuw-distributed-systems-group/wNesC-Compiler/commits/fe5cdadd33dc4feedab4ec5722dbe3bac4556aa8"}]}