Information Technology Reference
In-Depth Information
Coffman, E. G., Jr., Garey, M. R., & Johnson,
D. S. (1997). Approximation Algorithms for Bin
Packing: A Survey. In D. Hochbaum (ed.),
Ap-
proximation Algorithms for NP-Hard Problems,
(pp. 46-93). Boston: PWS Publishing.
Jiang, S., & Zhang, X. (2002). TPF: a System
Thrashing Protection Facility.
Software, Practice
& Experience
,
32
(3), 295-318. doi:10.1002/
spe.437
Jiang, S., & Zhang, X. (2005). Token-ordered
LRU: An Effective Page Replacement Policy
and Implementation in Linux systems.
Perfor-
mance Evaluation
,
60
(1-4), 5-29. doi:10.1016/j.
peva.2004.10.002
Denning, P. (1970). Virtual Memory. [CSUR].
ACM Computing Surveys
,
2
(3), 153-189.
doi:10.1145/356571.356573
Etsion, Y., Tsafrir, D., & Feitelson, D. G. (2004).
Desktop Scheduling: How Can We Know What
the User Wants? In
Proceedings of the 14th ACM
International Workshop on Network & Operat-
ing Systems Support for Digital Audio & Video
(NOSSDAV'2004)
, Cork, Ireland, June 16-18, (pp.
110-115). New York: ACM.
Karp, R. M. (1972). Reducibility Among Combi-
natorial Problems. In R.E. Miller & J.M. Thatcher,
(Eds.)
Complexity of Computer Computations
,
(pp. 85-103). New York: Plenum Press.
Klein, S. T., & Wiseman, Y. (2003). Parallel
Huffman Decoding with Applications to JPEG
Files.
The Computer Journal
,
46
(5), 487-497.
doi:10.1093/comjnl/46.5.487
Fekete, S. P., & Schepers, J. (2001). New Classes
of Fast Lower Bounds for Bin Packing Problems.
Mathematical Programming
,
91
(1), 11-31.
Komarinski, M. F., & Collett, C. (1998).
Linux
System Administration Handbook
. Upper Saddle
River, NJ: Prentice Hall.
Galvin, P. B., & Silberschatz,A. (1998).
Operating
System Concepts
(6
th
Ed.). Harlow, MA: Addison
Wesley Longman.
Manber, U. (1989).
Introduction to Algorithms - A
Creative Approach,
(pp.130-131). Harlow, MA:
Addison-Wesley.
Gent, I. (1998). Heuristic Solution of Open Bin
Packing Problems.
Journal of Heuristics
,
3
,
299-304. doi:10.1023/A:1009678411503
Martello, S., & Toth, P. (1990). Lower Bounds and
Reduction Procedures for the Bin Packing Prob-
lem.
Discrete Applied Mathematics
,
28
, 59-70.
doi:10.1016/0166-218X(90)90094-S
Gonzalez,A., Valero, M., Topham, N., & Parcerisa,
J. M. (1997). Eliminating Cache Conflict Misses
through XOR-Based Placement Functions. In
Proceedings of the International Conference on
Supercomputing
, Vienna, Austria, July 7-11, (pp.
76-83). New-York: ACM.
Marti, D. (2002). System Development Jump Start
Class.
Linux Journal, 7
.
Nikolopoulos, D. S. (2003). Malleable Memory
Mapping: User-Level Control of Memory Bounds
for Effective ProgramAdaptation. In
Proceedings
of the 17th International Parallel and Distributed
Processing Symposium (IPDPS'2003)
, Nice,
France, April 22-26, [CD-ROM]. Los Alamitos,
CA: IEEE.
Gorman, M. (2004).
Understanding The Linux
Virtual Memory Management
(Bruce Peren's
Open Book Series).
Jiang, S., & Zhang, X. (2001). Adaptive Page
Replacement to Protect Thrashing in Linux. In
Proceedings of the 5
th
USENIX Annual Linux
Showcase and Conference, (ALS'01)
, Oakland,
California, November 5-10, (pp. 143-151). Berke-
ley, CA: USENIX.
Search WWH ::
Custom Search