检索结果-内蒙古大学图书馆

A model for resource management in computational grid for real-time jobs using game theory

INTERNATIONAL JOURNAL OF grid AND UTILITY COMPUTING 2015年第3-4期6卷 232-248页

作者： Kaushik, Achal Vidyarthi, Deo Prakash Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi India

In a computational grid system, resources lie under the purview of different administrative domains with varying policies for their usages. Resource management, thus, is an important and core issue for making such a grid system viable. The resource provider may set different resource usage policies depending on the current system load and resource availability at that point of time, whereas the resource consumer may also insist upon the quality of service for its job. For real-time jobs, resource consumer may seek guaranteed response within strict time frames. The proposed work first identifies the grid clusters based on different users' parameters viz. cost, execution time and reliability before the resource consumer and provider start playing a non-cooperative game in which players act independently to choose their actions in a sealed bid auction. Thus, based on the outcome of the game, the highest bidder in the game is chosen and accordingly resource allocation is done.

关键词： computational grid real-time job non-cooperative game auction quality of service utility computing resource management

来源：评论

学校读者我要写书评

暂无评论

A GA Based Job Scheduling Strategy for computational grid 2

A GA Based Job Scheduling Strategy for Computational Grid

引用

International Conference on Advances in Computer Engineering and Applications (ICACEA)

作者： Singh, Krishan Veer Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi India

ISBN: (纸本)9781467369114

To meet the ever increasing demand of computing capacity and to cater towards collaborative engineering grid systems have emerged as the effective solution. Scheduling on such systems play a very critical role to ensure that the available resources are assigned and used optimally. Scheduling on grid has been proven to be an NP hard problem owing to the heterogeneity of the participating resources, huge search space and dynamicity of the grid system. GA has gained popularity among the researchers for scheduling problems on the grid systems, being a part of the evolutionary computing based on Darwin's theory of survival of the fittest. The proposed work presents a design and eventual analysis of a scheduling strategy using GA that schedules the job with the objective of minimizing the turnaround time of the job. This is done ensuring the resource assignment as per the job's requirement while considering the precedence and communication cost constraints. The work explores the use of Roulette wheel and Rank selection method as the selection methods while varying other parameters to study the model under various conditions.

关键词： computational grid Genetic Algorithm (GA) DAG Job Scheduling Turnaround Time (TAT)

来源：评论

学校读者我要写书评

暂无评论

Level-based batch scheduling strategies for computational grid

引用

INTERNATIONAL JOURNAL OF grid AND UTILITY COMPUTING 2014年第2期5卷 135-148页

作者： Shahid, Mohammad Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

grid computing is a high performance computing environment that allows sharing of geographically distributed resources across multiple administrative domains serving the ever growing demand for computational power. Scheduling m jobs to n resources to optimise the QoS for the given objective parameters has been proven to be NP-complete. This work presents two centralised level based batch scheduling strategies for a computational grid with the objective of minimising the turnaround time. The scheduler evaluates various computational nodes to schedule the batch of jobs consisting of a number of sub-jobs/modules having precedence and dependence constraints along with inter module communication requirements. Minimum Completion Time (MCT) and Minimum Execution Time (MET) heuristics have been used to decide the most suitable node for the given sub-job in terms of the turnaround time offered. A comparative analysis of the strategies with a model with similar objective has been performed to evaluate their place in the middleware.

关键词： batch scheduling computational grid DAG level-based scheduler NP hard problems turnaround time utilisation

来源：评论

学校读者我要写书评

暂无评论

Automatic Checkpointing based Fault Tolerance in computational grid

Automatic Checkpointing based Fault Tolerance in Computation...

引用

IEEE International Conference on Computing, Management and Telecommunications (ComManTel)

作者： Babu, Ch. Ramesh Rao, Ch. D. V. Subba JNTU Kakinada Dept CSE Kakinada AP India SV Univ Dept CSE Tirupati Andhra Pradesh India

ISBN: (纸本)9781479929030

Although technology changes quick still more sophisticated computational techniques are needed to preserve them. The majority of the computational grids work-load-logs show that node or job failure is the major challenging task to deal with. Since very robust scheduling algorithms are used to handle varied resource allocation in computational grids. However there is a need in previous studies to remedy the failures and delay of executing jobs with respect to resource availability, which can handle both scheduling and efficient failure handling in any large scale high performance computational applications. Consequently the major issues concerned here is fault-tolerance to tolerate failures with regard to job scheduling and efficient failure handling mechanism. So synchronization is needed to embed both techniques. Recurrently using techniques for fault tolerance in the widely held computational applications are periodic job checkpointing and replication. Hence most of the job checkpointing techniques are not merely based on scheduling algorithm. This work presents an automated checkpointing strategy in computational grid based on different scheduling algorithms. Experimental results have shown that the proposed automated checkpointing of jobs based on fault tolerant scheduling strategy has got considerable improvement over conventional adaptive checkpointing algorithms.

关键词： Automatic checkpointing computational grid job scheduling node failure replication

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Static Level Based Batch Scheduling Strategy (SLBBS) for computational grid 3

Performance Evaluation of Static Level Based Batch Schedulin...

引用

International Conference Parallel Distributed grid Computing

作者： Shahid, Mohammad Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi India

ISBN: (纸本)9781479976836

computational grid is a parallel and distributed infrastructure involving heterogeneous resources providing dependable, pervasive and consistent access of compute intensive resources from multiple organizations that are not subject to centralization at the administrative level delivering optimized QoS parameters. Job scheduling (i.e. mapping) is the core issue in computational grid. The problem of mapping jobs onto heterogeneous computational resources to optimize one or more QoS parameters has been proven to be NP-Complete. This work discusses the Static Level based Batch Scheduling Strategy (SLBSS) and other state of art batch scheduling algorithms viz. Min Min, Max Min, Sufferage and LJFR-SJFR along with their design motivation and limitations. A performance evaluation and analysis of SLBSS with its peers is done to evaluate its significance in the middleware.

关键词： Batch Scheduling computational grid DAG Constraints Level Based Scheduler Turnaround Time Utilization

来源：评论

学校读者我要写书评

暂无评论

Network Aware and Power-based Resource Allocation in Mobile Ad hoc computational grid 16

Network Aware and Power-based Resource Allocation in Mobile ...

引用

16th IEEE International Conference on High Performance Computing and Communications HPCC 2014\11th IEEE International Conference on Embedded Software and Systems ICESS 2014\6th International Symposium on Cyberspace Safety and Security CSS 2014

作者： Chhattan, Sayed Chauhdary, Sajjad Hussain Bilal, Muhammad Park, Myong-Soon Hankuk Univ Foreign Studies Dept Informat Commun Engn Seoul South Korea LSIS Co Ltd Anyang Gyeonggi Do South Korea Elect & Telecommun Res Inst Korea Daejeon South Korea Korea Univ Dept Comp Sci & Engn Seoul South Korea

ISBN: (纸本)9781479961238

Three resource allocation schemes are described for allocation of data-intensive dependent tasks on mobile ad hoc computational grid. The first resource scheme exploits transmission power control mechanism in order to improve energy efficiency and network capacity while the second resource allocation scheme takes into account the connection quality and network traffic in order to reduce data transfer time. To balance the trade-off between first two schemes a network-aware and power-based resource allocation scheme is proposed which takes into account transmission power and network characteristics in order to make allocation decisions. The relationship between data transfer time and transmission energy consumption has also been investigated in detail. The schemes are validated in a simulated environment using various workloads and parameters.

关键词： computational grid Mobile grid Ad hoc Network Resource Allocation Job Scheduling

来源：评论

学校读者我要写书评

暂无评论

A Precedence Based Distributed Job Scheduling for computational grid

A Precedence Based Distributed Job Scheduling for Computatio...

引用

4th IEEE International Advance Computing Conference (IACC)

作者： Shahid, Mohammad Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

ISBN: (纸本)9781479925711

Scheduling on a computational grid is an NP Hard problem encouraging a number of scheduling strategies using various parameters and objectives. A computational grid provides the user a platform to execute the compute intensive jobs which otherwise cannot be executed at the user's end. A grid system can be used to its full potential if the scheduling strategy provides the efficient mapping between the software parallelisms available in the application on the hardware parallelism offered by the grid. This work proposes a scheduling strategy that schedules the job on the suitable grid resources as per the job's requirements while considering the communication requirements and preserving the precedence constraints within the job. Simulation study reveals the effectiveness of the model under various conditions.

关键词： computational grid Scheduling Turnaround Time Precedence Constraints

来源：评论

学校读者我要写书评

暂无评论

A Precedence Based Load Balancing Strategy for Batch of DAGs for computational grid

A Precedence Based Load Balancing Strategy for Batch of DAGs...

引用

proc 2014 inter conf contemporary comp informatics (ic3i)

作者： Shahid, Mohammad Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi India

ISBN: (纸本)9781479966295

Load balancing on computational resources in a computational grid environment is an NP Hard problem. Therefore, a number of schemes can be proposed for the same under different constraints. Accordingly, a variety of techniques have been proposed in the literature but none of them can be treated as the best for all conditions and QoS parameters. A computational grid enables the users to execute their compute intensive jobs on the resources in which investing is either not wise or beyond their limit to invest. grid resources can be used to meet the user's requirements in terms of QoS parameters if the scheduling strategy provides the efficient mapping between the software parallelisms available in the application on the hardware parallelism offered by the grid. This work presents a centralized precedence based load balancing strategy for a batch of jobs represented as Direct Acyclic Graph (DAG) having communication requirements. Performance evaluation is carried out by comparing the proposed strategy with other load balancing schemes viz. LRR and OLB. Experimental study reveals that load distribution on nodes is better than LRR and OLB. The strategy can be used for the jobs which are more interactive as it results in a lower response time for the jobs of the batch.

关键词： computational grid Load Balancing DAG Precedence Constraints Utilization Load Balancing Level

来源：评论

学校读者我要写书评

暂无评论

Study on the solution algorithm of Reynolds equation of self-acting gas journal bearings based on a finite difference method

引用

LUBRICATION SCIENCE 2024年第3期36卷 231-237页

作者： Zhang, Haijun Yang, Qin Zhao, Wei Jiang, Feilong Jiaxing Univ Coll Informat Sci & Engn Jiaxing Peoples R China Jiaxing Univ Coll Data Sci Jiaxing Peoples R China

It is very crucial to solve the Reynolds equation quickly and accurately using the numerical methods in the research field of fluid lubrication. For the static Reynolds equation of self-acting gas journal bearings, the typical solution algorithm of the finite difference method is put forward and a new solution algorithm of the finite difference method is proposed. Secondly, the Reynolds equation is solved numerically with the same parameters and the pressure distribution of gas bearings is obtained. Finally, the numerical solution from the new solution algorithm can be obtained with less number of iterations and the less computing time under the different computational grids and bearing numbers. Therefore, the new solution algorithm of the finite difference method is superior to the typical solution algorithm of the finite difference method.

关键词： bearing number computational grid finite difference method self-acting journal bearings static Reynolds equation

来源：评论

学校读者我要写书评

暂无评论

A spectral analysis approach for the a priori generation of computational grids in the 2-D hydrodynamic-based runoff simulations at a basin scale

引用

JOURNAL OF HYDROLOGY 2020年第0期582卷 124508-000页

作者： Ferraro, Domenico Costabile, Pierfranco Costanzo, Carmelina Petaccia, Gabriella Macchione, Francesco Univ Pavia Dipartimento Ingn Civile & Architettura Pavia Italy Univ Calabria Lab Modellist Numer Protez Idraul Terr LAMPIT Calabria Italy

The increasing availability of high-resolution terrain data fostered the development of two-dimensional hydrodynamic-based surface runoff models at basin scale, for flood hazard assessment and mapping purposes. The generation of the computational domain is one of the most important preliminary steps for practical applications of this kind of modeling. Several studies can be found in the technical literature showing the influence exerted by the computational grid type used on the results in terms of water depth, flow velocity and discharge. Several approaches were proposed for the mesh generation even though, in practice, it is subject to the modeller choice and experience. In any case, the reason why a specific mesh is used is rarely discussed and its impact on the model results in terms of outflow hydrographs, runoff volumes and flooded areas extent is seldom analysed. In this work a rigorous approach for an a priori design of a computational grid is proposed. The a priori term suggests that the proposed procedure aims at generating a computational mesh, close to the optimal one, in a time-saving process which is not based on trial meshes and trial simulations. Namely, the process is based on the application of the two-dimensional Fourier analysis to a high-resolution digital elevation model in order to compute the power spectrum and finally to identify the significant waves lengths and the characteristic scales. The latter ones are located in the catchment and used for the generation of a computational grid characterized by different elements size. The simulations of surface runoff at a basin scale have shown that the application of the proposed method for the a priori construction of the grid leads to the generation of a computational mesh which reduces the calculation time by approximately 87%, if compared to a fine grid taken as reference, with negligible errors on outflow hydrographs and flooded areas extent.

关键词： Hydrodynamic-based rainfall runoff modelling computational grid Spectral analysis Spatial scales Overland flow model Direct rainfall method

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：