ON THE WORST CASE PERFORMANCE OF BUDDY SYSTEMS

被引：6

作者：

LLOYD, EL ^{[1
]}

LOUI, MC ^{[1
]}

机构：

[1] UNIV ILLINOIS,URBANA,IL 61801

来源：

ACTA INFORMATICA | 1985年 / 22卷 / 04期

关键词：

D O I：

10.1007/BF00288778

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：451 / 473

页数：23

共 15 条

[1] MEMORY-FRAGMENTATION IN BUDDY METHODS FOR DYNAMIC STORAGE-ALLOCATION [J].

BROMLEY, AG .

ACTA INFORMATICA, 1980, 14 (02) :107-117

[2] CLASS OF DYNAMIC MEMORY ALLOCATION ALGORITHMS [J].

HIRSCHBE.DS .

COMMUNICATIONS OF THE ACM, 1973, 16 (10) :615-618

[3] A FAST STORAGE ALLOCATOR [J].

KNOWLTON, KC .

COMMUNICATIONS OF THE ACM, 1965, 8 (10) :623-&

[4]

KNUTH DE, 1973, ART COMPUTER PROGRAM, V1, P634

[5] A dynamic storage allocation problem [J].

Krogdahl, S. .

1600, (02)

[6] SIMULATIONS AMONG MULTIDIMENSIONAL TURING-MACHINES [J].

LOUI, MC .

THEORETICAL COMPUTER SCIENCE, 1982, 21 (02) :145-161

[7] OPTIMAL DYNAMIC EMBEDDING OF TREES INTO ARRAYS [J].

LOUI, MC .

SIAM JOURNAL ON COMPUTING, 1983, 12 (03) :463-472

[8]

LOUI MC, UNPUB J COMPUT SYST

[9]

PETERSON DL, 1977, COMMUN ACM, V20, P421

[10] STATISTICAL PROPERTIES OF BUDDY SYSTEM [J].

PURDOM, PW ;

STIGLER, WM .

JOURNAL OF THE ACM, 1970, 17 (04) :683-&

← 1 2 →