D9nLp1RpWwaKnAcDg53XlT5hd3vizt5lw3JXp3NFbp4mGPz5b76zvIi65IQF

Algorithms for Computing the WCRT Bound of OpenMP Task Systems With Conditional Branches

Release Time:2022-10-05  Hits:

Date of Publication: 2022-10-04

Journal: IEEE TRANSACTIONS ON COMPUTERS

Institution: 电子信息与电气工程学部

Volume: 70

Issue: 1

Page Number: 57-71

Prev One:The time-dependent rural postman problem: polyhedral results

Next One:An integer programming approach for the Chinese postman problem with time-dependent travel time