{"title":"通过可靠的k过程进行系统的网格再分配","authors":"R. SivaSubramanian, K. Kalaiarasi","doi":"10.1109/ICATCCT.2015.7456888","DOIUrl":null,"url":null,"abstract":"Grid Computing is one of the emerging techniques in this real time environment. Network figuring is the gathering of PC assets from numerous areas to achieve a typical objective. The matrix can be considered as a disseminated framework with non-intuitive workloads that include countless. The reallocation of the grids is one of the challenging task through which merely the occupied grids are wasted with the reusability condition. The Existing researchers have proven that reallocation of grid will result in the efficient improvement of the grid usability through which the total grid advance into the second generation of Grid Reallocation Scheme. This paper describes the reallocation process with the λ process through which every grids stability and working conditions are verified and those grids are having the challenging results with the maximum occupancy is chosen and those grids are resynthesized and reformed to be a fresh grid through which the grid is reused for the conventional purposes. The referred technique follows with the X-Grid Algorithm though which this reallocation process is achieved.","PeriodicalId":276158,"journal":{"name":"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Systematic grid reallocation through reliable k process\",\"authors\":\"R. SivaSubramanian, K. Kalaiarasi\",\"doi\":\"10.1109/ICATCCT.2015.7456888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Grid Computing is one of the emerging techniques in this real time environment. Network figuring is the gathering of PC assets from numerous areas to achieve a typical objective. The matrix can be considered as a disseminated framework with non-intuitive workloads that include countless. The reallocation of the grids is one of the challenging task through which merely the occupied grids are wasted with the reusability condition. The Existing researchers have proven that reallocation of grid will result in the efficient improvement of the grid usability through which the total grid advance into the second generation of Grid Reallocation Scheme. This paper describes the reallocation process with the λ process through which every grids stability and working conditions are verified and those grids are having the challenging results with the maximum occupancy is chosen and those grids are resynthesized and reformed to be a fresh grid through which the grid is reused for the conventional purposes. The referred technique follows with the X-Grid Algorithm though which this reallocation process is achieved.\",\"PeriodicalId\":276158,\"journal\":{\"name\":\"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICATCCT.2015.7456888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICATCCT.2015.7456888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Systematic grid reallocation through reliable k process
Grid Computing is one of the emerging techniques in this real time environment. Network figuring is the gathering of PC assets from numerous areas to achieve a typical objective. The matrix can be considered as a disseminated framework with non-intuitive workloads that include countless. The reallocation of the grids is one of the challenging task through which merely the occupied grids are wasted with the reusability condition. The Existing researchers have proven that reallocation of grid will result in the efficient improvement of the grid usability through which the total grid advance into the second generation of Grid Reallocation Scheme. This paper describes the reallocation process with the λ process through which every grids stability and working conditions are verified and those grids are having the challenging results with the maximum occupancy is chosen and those grids are resynthesized and reformed to be a fresh grid through which the grid is reused for the conventional purposes. The referred technique follows with the X-Grid Algorithm though which this reallocation process is achieved.