{"title":"基于排队理论的MapReduce优先级调度","authors":"Cong Wan, Cuirong Wang, Shuo Jia","doi":"10.1109/IMCCC.2013.98","DOIUrl":null,"url":null,"abstract":"MapReduce is a programming model and an associated implementation for processing and generating large data sets. Providing MapReduce as a service is the development future trend. This paper present a queue theory based scheduling scheme for MapReduce framework. The scheme divides users into priority user and non-priority and users respectively corresponding to different queues. The scheme insures priority user has a pre-specified delay and the non-priority queue have a promised utilization ratio. At last, Experiments show the effectiveness of the scheme.","PeriodicalId":360796,"journal":{"name":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Priority Scheduling in MapReduce Based on Queuing Theory\",\"authors\":\"Cong Wan, Cuirong Wang, Shuo Jia\",\"doi\":\"10.1109/IMCCC.2013.98\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"MapReduce is a programming model and an associated implementation for processing and generating large data sets. Providing MapReduce as a service is the development future trend. This paper present a queue theory based scheduling scheme for MapReduce framework. The scheme divides users into priority user and non-priority and users respectively corresponding to different queues. The scheme insures priority user has a pre-specified delay and the non-priority queue have a promised utilization ratio. At last, Experiments show the effectiveness of the scheme.\",\"PeriodicalId\":360796,\"journal\":{\"name\":\"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCCC.2013.98\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCCC.2013.98","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Priority Scheduling in MapReduce Based on Queuing Theory
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Providing MapReduce as a service is the development future trend. This paper present a queue theory based scheduling scheme for MapReduce framework. The scheme divides users into priority user and non-priority and users respectively corresponding to different queues. The scheme insures priority user has a pre-specified delay and the non-priority queue have a promised utilization ratio. At last, Experiments show the effectiveness of the scheme.