{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:12:00Z","timestamp":1741151520508,"version":"3.38.0"},"reference-count":13,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2003,2]]},"abstract":"<jats:p> Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster and scheduling them efficiently. In such a system, memory becomes a critical resource for both kinds of job. Thus, the minimization of the impact caused by the overflow of physical into virtual memory on the performance of distributed jobs together with the development of an efficient memory management adapted to the needs of NOWs (Networks of Workstations) are major issues in this kind of environment. An algorithm is presented to adjust time slices dynamically to the necessities of distributed and local tasks in order to reduce the number of page faults across the cluster. Additionally, a memory management policy aimed at preserving enough memory for both workloads is evaluated. Our proposals are implemented in a Linux cluster and compared with alternative algorithms. <\/jats:p>","DOI":"10.1177\/1094342003017001004","type":"journal-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T22:04:01Z","timestamp":1056578641000},"page":"39-48","source":"Crossref","is-referenced-by-count":2,"title":["Dealing with Memory Constraints in a Non-Dedicated Linux Cluster"],"prefix":"10.1177","volume":"17","author":[{"given":"Francesc","family":"Gin\u00e9","sequence":"first","affiliation":[]},{"given":"Francesc","family":"Solsona","sequence":"additional","affiliation":[{"name":"UNIVERSITAT DE LLEIDA, SPAIN"}]},{"given":"Porfidio","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"Emilio","family":"Luque","sequence":"additional","affiliation":[{"name":"UNIVERSITAT AUT\u00d2NOMA DE BARCELONA, SPAIN"}]}],"member":"179","published-online":{"date-parts":[[2003,2,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"Acharya, A. and Setia, S. 1999. Availability and utility of idle memory in workstation clusters . In Proceedings of the ACM SIGMETRICS `99 Conference on the Measurement and Modeling of Computer Systems, pp. 35-46 .","DOI":"10.1145\/301453.301478"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1109\/40.342018"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"Arpaci, R.H., Dusseau, A.C., Vahdat, A.M., Liu, L.T., Anderson, T.E., and Patterson, D.A. 1995. The interaction of parallel and sequential workloads on a network of workstations . In Proceedings of the ACM SIGMETRICS `95 Conference on the Measurement and Modeling of Computer Systems, pp. 267-278 .","DOI":"10.1145\/223587.223618"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"Burger, D., Hyder, R., Miller, B., and Wood, D. 1996. Paging tradeoffs in distributed shared-memory multiprocessors . Journal of Supercomputing, 16(10): 87-104 .","DOI":"10.1007\/BF00128100"},{"key":"atypb5","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G. and Rudolph, L. 1992. Gang scheduling performance benefits for fine-grain synchronization . Journal of Parallel and Distributed Computing, 164(4): 306-318 .","DOI":"10.1016\/0743-7315(92)90014-E"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45540-X_4"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45417-9_32"},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"Litzkow, M., Livny, M., and Mutka, M. 1998. Condor: A hunter of idle workstations . In Proceedings of the 8th International Conference of Distributed Computing Systems, pp 104-111 .","DOI":"10.1109\/DCS.1988.12507"},{"key":"atypb9","unstructured":"Ousterhout, J.K. 1982. Scheduling techniques for concurrent systems . In: Proceedings of the 3rd International Conference on Distributed Computing Systems, pp. 22-30 ."},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"Parsons, E.W. and Sevcik, K.C. 1997. Multiprocessor scheduling for high-variability service time distributions . Lecture Notes in Computer Science, 949: 166-192 .","DOI":"10.1007\/3-540-63574-2_21"},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"Sobalvarro, P.G. and Weihl, W.E. 1995. Demand based coscheduling of parallel jobs on multiprogrammed multiprocessors . In Proceedings of the IPPS '95 Workshop on Job Scheduling Strategies, pp. 63-75 .","DOI":"10.1007\/3-540-60153-8_25"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"Solsona, F., Gin\u00e9, F., Hern\u00e1ndez, P., and Luque, E. 2000. Implementing explicit and implicit coscheduling in a PVM environment . Lecture Notes in Computer Science, 1981: 75-88 .","DOI":"10.1007\/3-540-44942-6_6"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44681-8_105"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342003017001004","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342003017001004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T04:24:41Z","timestamp":1741062281000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342003017001004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["10.1177\/1094342003017001004"],"URL":"https:\/\/doi.org\/10.1177\/1094342003017001004","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}