Worst case performance analysis of the two dimensional binary buddy systemFootnote^∗
^∗This research is supported in part by the Texas Advanced Research Program under grant no. 1028-ARP.

Keqin Li Department of Computer Science, University of Houston, Houston, TX, 77204-3475, USA

Kam Hoi Cheng Department of Computer Science, University of Houston, Houston, TX, 77204-3475, USA

References

Chowdhury , S. K. and Srimani , P. K. 1987 . Worst case performance of weighted buddy systems . Acta Informatica , 24 : 555 – 564 .
Google Scholar
Knowlton , K. C. 1965 . A fast storage allocator . Communications of the ACM , 8 : 623 – 625 .
Web of Science ®Google Scholar
Li , K. and Cheng , K. H. 1989 . Proc. 1st IEEE Symp. on Parallel and Distributed Processing . Complexity of resource allocation and job scheduling problems in partitionable mesh connected systems . May 1989 . pp. 358 – 365 .
Google Scholar
Li , K. and Cheng , K. H. 1990 . Proc. ACM 18th Computer Science Conference . A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system . Feb 1990 . pp. 22 – 28 .
Google Scholar
Lloyd , E. L. and Loui , M. C. 1985 . On the worst case performance of buddy systems . Acta Informatica , 22 : 451 – 473 .
Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Worst case performance analysis of the two dimensional binary buddy systemFootnote^∗
^∗This research is supported in part by the Texas Advanced Research Program under grant no. 1028-ARP.

References

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

Worst case performance analysis of the two dimensional binary buddy systemFootnote∗∗This research is supported in part by the Texas Advanced Research Program under grant no. 1028-ARP.

References

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Worst case performance analysis of the two dimensional binary buddy systemFootnote^∗
^∗This research is supported in part by the Texas Advanced Research Program under grant no. 1028-ARP.