Although distributed threads on distributed shared memory (DSM) provide an easy programming model for distributed computer systems, it is not easy to build a high performance system with them, because a software DSM system is prone to page-thrashing. One way to reduce page-thrashing is to utilize thread migration, which leads to changes in page access patterns on DSM. In this papel; we propose thread scheduling methods based upon page access information and discuss an analytical model for evaluating this information. Then, we describe our implementation of distributed threads, PARSEC (Parallel sofhyare environment for workstation cluster}. Using user-level threads, PARSEC implements thread migration and thread scheduling based upon the page access i n f o mtion. We also measure the peqormance of some applications with these thread scheduling methods. These measurements indicate that the thread scheduling methods greatly reduce page-thrashing and improve total system performance.
Summary. In this paper, we propose a new type of FCSPs called hybrid domain FCSPs that have a mixture of discrete and continuous domains. To solve this type of problems, we present an algorithm called Spread-Repair based on the framework of iterative improvement. Experimental results on some test problems show that the algorithm has an ability of finding local approximate solutions with high probability in a computation time much shorter than the traditional, discrete-domain FCSP.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.