{"id":12953,"date":"2021-11-30T19:29:21","date_gmt":"2021-12-01T00:29:21","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12953"},"modified":"2021-11-30T19:29:21","modified_gmt":"2021-12-01T00:29:21","slug":"tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/","title":{"rendered":"TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer"},"content":{"rendered":"

Carleton University
\nTechnical Report<\/a> TR-97-15
\nJuly 1997<\/p>\n

TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer<\/h2>\n
\n
\n
\n
\n
\n
\n
\n
Sivarama P. Dandamudi & Thanalapati K. Thyagaraj<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

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

Processor scheduling policies for distributed-memory systems can be divided into space-sharing or time-sharing policies. In space sharing, the set of processors in the system is partitioned and each partition is assigned for the exclusive use of a job. In time sharing policies, on the other hand, none of the processors is given exclusively to jobs; instead, several jobs share the processors (for example, in a round robin fashion). There are advantages and disadvantages associated with each type of policies. Typically, space-sharing polices are good at low to moderate system loads and when jobs parallelism do not vary much. However, at high system loads and widely varying job parallelism, time sharing policies provide a better performance. In this paper we propose a new policy that is based on a hierarchical organization that incorporates the merits of these two types of policies. The new policy is a hybrid policy that uses both space-sharing as well as time-sharing to achieve better performance. We demonstrate that, at most system loads of interest, the proposed policy outperforms both space-sharing and time-sharing policies by a wide margin.<\/p>\n

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

Carleton University Technical Report TR-97-15 July 1997 TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer Sivarama P. Dandamudi & Thanalapati K. Thyagaraj Abstract Processor scheduling policies for distributed-memory systems can be divided into space-sharing or time-sharing policies. In space sharing, the set of processors in the system is partitioned and each partition is assigned […]<\/p>\n","protected":false},"author":49,"featured_media":0,"parent":12157,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":"","_links_to":"","_links_to_target":""},"yoast_head":"\nTR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Carleton University Technical Report TR-97-15 July 1997 TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer Sivarama\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/\",\"name\":\"TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-12-01T00:29:21+00:00\",\"dateModified\":\"2021-12-01T00:29:21+00:00\",\"description\":\"Carleton University Technical Report TR-97-15 July 1997 TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer Sivarama\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/carleton.ca\/scs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Research\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"SCS Technical Reports\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Technical Reports 1997\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/\"},{\"@type\":\"ListItem\",\"position\":5,\"name\":\"TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/carleton.ca\/scs\/#website\",\"url\":\"https:\/\/carleton.ca\/scs\/\",\"name\":\"School of Computer Science\",\"description\":\"Carleton University\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/carleton.ca\/scs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer - School of Computer Science","description":"Carleton University Technical Report TR-97-15 July 1997 TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer Sivarama","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/","name":"TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-12-01T00:29:21+00:00","dateModified":"2021-12-01T00:29:21+00:00","description":"Carleton University Technical Report TR-97-15 July 1997 TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer Sivarama","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-15-a-hierarchical-processor-scheduling-policy-for-distributed-memory-multicomputer\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/carleton.ca\/scs\/"},{"@type":"ListItem","position":2,"name":"Research","item":"https:\/\/carleton.ca\/scs\/research\/"},{"@type":"ListItem","position":3,"name":"SCS Technical Reports","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/"},{"@type":"ListItem","position":4,"name":"Technical Reports 1997","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/"},{"@type":"ListItem","position":5,"name":"TR-97-15: A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer"}]},{"@type":"WebSite","@id":"https:\/\/carleton.ca\/scs\/#website","url":"https:\/\/carleton.ca\/scs\/","name":"School of Computer Science","description":"Carleton University","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/carleton.ca\/scs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"acf":{"banner_image_type":"none","banner_button":"no"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12953"}],"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\/49"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12953"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12953\/revisions"}],"predecessor-version":[{"id":12954,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12953\/revisions\/12954"}],"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=12953"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}