Information Technology Reference
In-Depth Information
this patch, the patch can help the machine han-
dling a massive paging in a thrashing situation in
a more tolerant means than the traditional way of
Linux that was killing processes. Moreover, the
responsiveness of the machine keeps being reason-
able for heavier memory load. The medium-term
scheduler does not require special resources or
extensive needs; therefore, it can be easily adapted
by almost any Linux machines. Furthermore,
there is no prevention from implementing the
medium-term scheduler on a parallel machine
or a cluster; hence, heavy load projects like the
Human Genome Project can benefit from the new
scheduling strategic.
In the future, we would like to find a pattern
for memory usage reoccurrence. Such a pattern
can improve the efficiency of the scheduling
decisions. Some applications like (Wiseman
et al., 2004), (Wiseman, 2001), (Wiseman and
Klein, 2003) have a pattern of memory usage
reoccurrence and the Operating System can take
an advantage of it.
Alverson, G., Kahan, S., Korry, R., McCann,
C., & Smith, B. (1995). Scheduling on the Tera
MTA. In
Proceedings of the 1st Workshop on Job
Scheduling Strategies for Parallel Processing,
In Conjunction with IPPS '95
Fess Parker's Red
Lion Resort, Santa Barbara, California, April 25,
(pp. 19-44). Berlin: Springer-Verlag.
Batat,A., & Feitelson, D. G. (2000). Gang schedul-
ing with memory considerations. In
Proceedings
of the 14th International Parallel and Distributed
Processing Symposium (IPDPS'2000)
, Cancun,
Mexico, May 1-5, (pp. 109-114). Los Alamitos,
CA: IEEE.
Beck, M., Bohme, H., Dziadzka, M., Kunitz,
U., Magnus, R., & Verworner, D. (1998).
Linux
Kernel Internals
(2nd Ed.). Harlow, MA:Addison
Wesley, Longman
Belady, L. A. (1966). A Study of Replacement
Algorithms for Virtual Storage Computers.
IBM
Systems Journal
,
5
(2), 78-101.
Benchmark, B. E. N. C. H.-M. A. T. L. A. B.
(2004).
Matlab Performance Tests
. Natick, MA:
The MathWorks, Inc. Retrieved from http://www.
mathworks.com/
referenceS
Abrossimov, V., Rozier, M., & Shapiro, M. (1989).
Virtual Memory Management for Operating
System Kernels. In
Proceedings of the 12
th
ACM
Symposium on Operating Systems Principles
,
Litchfield Park,AZ, December 3-6, (pp. 123-126).
New-York: ACM SIGOPS.
Bovet, D., & Cesati, M. (2003).
Undersatnding
the Linux Kernel
, (2nd Ed.). Sebastopol, CA:
O'Reilly Press.
Card, R., Dumas, E., & Mevel, F. (1998).
The Linux
Kernel Book
. New York: John Wiley & Sons.
Albers, S., & Mitzenmacher, M. (2000).
Average-Case Analyses of First Fit and Ran-
dom Fit Bin Packing.
Random Structures
Alg.
,
16
, 240-259. doi:10.1002/(SICI)1098-
2418(200005)16:3<240::AID-RSA2>3.0.CO;2-
V
Chu,Y., & Ito, M. R. (2000). The 2-way Thrashing-
Avoidance Cache (TAC):An Efficient Instruction
Cache Scheme for Object-Oriented Languages. In
Proceedings of 17th IEEE International Confer-
ence on Computer Design (ICCD2000)
, Austin,
Texas, September 17-20, (pp. 93-98). Los Alami-
tos, CA: IEEE.
Search WWH ::
Custom Search