{"id":12908,"date":"2021-11-23T20:18:02","date_gmt":"2021-11-24T01:18:02","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12908"},"modified":"2026-06-02T14:59:25","modified_gmt":"2026-06-02T18:59:25","slug":"tr-97-01-performance-comparison-of-processor-scheduling-strategies-in-a-distributed-memory-multicomputer-system","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-01-performance-comparison-of-processor-scheduling-strategies-in-a-distributed-memory-multicomputer-system\/","title":{"rendered":"TR-97-01: Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n TR-97-01: Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System\n <\/h1>\n \n \n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n

Carleton University
\nTechnical Report<\/a> TR-97-01
\nJanuary 1997<\/p>\n\n\n\n

Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System<\/h2>\n\n\n\n
\n
\n
\n
\n
\n
\n
\n
Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n

Processor scheduling policies on systems that run multiple applications simultaneously can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition the system processors and each partition is allocated exclusively to a job. In time-sharing policies, processors are temporally shared by jobs (e.g., in a round robin fashion). Space-sharing and time-sharing policies have their advantages and disadvantages. It has also been suggested that a hybrid policy that combines space-sharing and time-sharing is beneficial in improving the overall performance.Processor scheduling has received considerable attention in the context of shared-memory multiprocessor systems but has not received as much attention in distributed-memory multicomputer systems. Furthermore, most previous research in this area has either used a simulation model or an analytical model in evaluating the performance of various policies. Very often these models neglect several practical aspects of the system and workload.<\/p>\n\n\n\n

Our goal is to implement processor scheduling policies on a real system and evaluate their performance. We have used a Transputer-based system to implement two policies — one space-sharing policy and one time-sharing policy — in order to study the relative performance trade-offs involved. We have also implemented a hybrid space-sharing and time-sharing policy. We report the performance sensitivity of these policies to various system and workload parameters. These include three types of applications, four types of interconnection networks, two kinds of software architecture. An aspect, which is not present in most previous studies, is that our study reports the impact of such practical issues as the contention for communication links, network topology, contention for memory, memory size limitation, and software architecture on the performance of the scheduling policies.<\/p>\n\n\n\n

TR-97-01.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Carleton University Technical Report TR-97-01 January 1997 Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar Abstract Processor scheduling policies on systems that run multiple applications simultaneously can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition the system processors and each partition is […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":12157,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-12908","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12908","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12908"}],"version-history":[{"count":2,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12908\/revisions"}],"predecessor-version":[{"id":12928,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12908\/revisions\/12928"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12157"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12908"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12908"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}