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

Wind Effects of an Upstream Building on a Low-Rise Building

Materials Today: Proceedings 2019年 16卷 444-448页

作者： K.S. Suresh Kumar C. Elanchezhian B. Vijaya Ramnath Scholar-Faculty of Mechanical Engineering Anna University Chennai 25 India Department of Mechanical Engineering Sri Sairam Engineering College Chennai 44 India

The influence of an upstream building on the suction pressure on the roof top of a low rise building was earlier studied. This work computationally validates the original experimental results, and provides further insights on the effect of geometric modification for the tall building. The computational grid uses a boundary layer approach to capture exact conical vortex patterns. grid refinement on a structured grid provides more information on the near wall pressure. Several models are tested numerically to find a favorable design configuration that reduces the suction pressure. Results prove that a particular modification of the roof top yields to about 30 % reduction of the mean suction pressure.

关键词： computational grid Vortex patterns Mean suction pressure Configuration and Boundary layer

来源：评论

学校读者我要写书评

暂无评论

Threshold-based negotiation framework for grid resource allocation

引用

IET COMMUNICATIONS 2017年第14期11卷 2236-2243页

作者： Cavdar, Tugrul Kakiz, Muhammet Talha Karadeniz Tech Univ Dept Comp Engn Fac Engn Trabzon Turkey

computational grid provides virtual powerful computer for solving any large-scale scientific, commercial, and engineering problems by aggregating and sharing heterogeneous resources. However, designing an effective resource allocation method is a complicated task. To undertake the task, several economic-based resource management models have been studied. Bargaining (or negotiation) is one of the most used and effective models even though it has several main defects such as high communication demand and the risk of losing a deal. Instead of repeating negotiation for every generated grid job (GJ), the novel contribution of threshold-based negotiation framework is to determine whether a new negotiation is needed or not, according to the current market conditions which depend on supply of resource providers and demand of consumers. In the proposed framework, agents request for renewing negotiation, provided that the amount of change in market conditions exceeds pre-defined threshold. Therefore, communication overhead and the risk of losing the deal are minimised by avoiding unnecessary negotiations.

关键词： grid computing resource allocation socio-economic effects negotiation renewal agents request market conditions GJ grid job communication demand economic-based resource management models resource allocation method heterogeneous resources computational grid grid resource allocation threshold-based negotiation framework

来源：评论

学校读者我要写书评

暂无评论

Fault tolerance in computational grids: perspectives, challenges, and issues

引用

SPRINGERPLUS 2016年第1期5卷 1页

作者： Haider, Sajjad Nazir, Babar SZABIST Dept Comp Sci H-8 Islamabad Pakistan NUML Dept Comp Sci H-9 Islamabad Pakistan COMSATS Inst Informat Technol Dept Comp Sci Univ Rd Abbottabad 22060 Pakistan

computational grids are established with the intention of providing shared access to hardware and software based resources with special reference to increased computational capabilities. Fault tolerance is one of the most important issues faced by the computational grids. The main contribution of this survey is the creation of an extended classification of problems that incur in the computational grid environments. The proposed classification will help researchers, developers, and maintainers of grids to understand the types of issues to be anticipated. Moreover, different types of problems, such as omission, interaction, and timing related have been identified that need to be handled on various layers of the computational grid. In this survey, an analysis and examination is also performed pertaining to the fault tolerance and fault detection mechanisms. Our conclusion is that a dependable and reliable grid can only be established when more emphasis is on fault identification. Moreover, our survey reveals that adaptive and intelligent fault identification, and tolerance techniques can improve the dependability of grid working environments.

关键词： Fault identification Fault tolerance Fault classification computational grid Distributed computing

来源：评论

学校读者我要写书评

暂无评论

A Web Service-based grid Portal for Edgebreaker Compression

引用

Methods of Information in Medicine 2018年第2期44卷 233-238页

作者： G. Aloisio M. C. Barba E. Blasi M. Cafaro S. Fiore M. Mirto

Background: In health applications, and elsewhere, 3D data sets are increasingly accessed through the Internet. To reduce the transfer time while maintaining an unaltered 3D model, adequate compression and decompression techniques are needed. Recently, grid technologies have been integrated with Web Services technologies to provide a framework for interoperable application-to-application interaction. Objectives: The paper describes an implementation of the Edgebreaker compression technique exploiting web services technology and presents a novel approach for using such services in a grid Portal. The grid portal, developed at the CACT/ISUFI of the University of Lecce, allows the processing and delivery of biomedical images (CT – computerized tomography – and MRI – magnetic resonance images) in a distributed environment, using the power and security of computational grids. Methods: The Edgebreaker Compression Web Service has been deployed on a grid portal and allows compressing and decompressing 3D data sets using the Globus toolkit GSI (Globus Security Infrastructure) protocol. Moreover, the classical algorithm has been modified extending the compression to files containing more than one object. Results and Conclusions: An implementation of the Edgebreaker compression technique and related experimental results are presented. A novel approach for using the compression web service in a grid portal allowing storing and preprocessing of huge 3D data sets, and subsequent efficient transmission of results for remote visualization is also described.

关键词： Web Services Edgebreaker algorithm computational grid grid portal Globus toolkit

来源：评论

学校读者我要写书评

暂无评论

A Comparison Between Genetic Algorithm and Cuckoo Search Algorithm to Minimize the Makespan for grid Job Scheduling 1st

引用

1st International Conference on computational Intelligence (ICCI)

作者： Ghosh, Tarun Kumar Das, Sanjoy Barman, Subhabrata Goswami, Rajmohan Haldia Inst Technol Dept Comp Sci & Engn Haldia W Bengal India Kalyani Univ Dept Engn & Technol Studies Kalyani W Bengal India Pailan Coll Management & Technol Dept Comp Applicat Kolkata India

ISBN: (纸本)9789811025259;9789811025242

Major subjects like heterogeneity of resources, dynamic and autonomous character of grid resources are most important challenges for grid job scheduling. Additionally, there are issues of various strategies being maintained by the resource providers and followed by resource users for execution of their jobs. Thus optimal job scheduling is an NP-complete problem which can easily be solved by using heuristic approaches. This paper compares two heuristic methods: Genetic Algorithm (GA) and Cuckoo Search Algorithm (CSA) for job scheduling problem in order to efficiently allocating jobs to resources in a grid system so that the makespan is minimized. Our empirical results have proved that the CSA performs better than the GA.

关键词： computational grid Job scheduling Makespan GA and CSA

来源：评论

学校读者我要写书评

暂无评论

SCHEDULING WITH JOB CHECKPOINT IN computational grid ENVIRONMENT

引用

INTERNATIONAL JOURNAL OF MODELING SIMULATION AND SCIENTIFIC COMPUTING 2011年第3期2卷 299-316页

作者： Nandagopal, Malarvizhi Gajalakshmi, S. Uthariaraj, V. Rhymend Anna Univ Ramanujan Comp Ctr Madras Tamil Nadu India Anna Univ Madras Tamil Nadu India

computational grids have the potential for solving large-scale scientific applications using heterogeneous and geographically distributed resources. In addition to the challenges of managing and scheduling these applications, reliability challenges arise because of the unreliable nature of grid infrastructure. Two major problems that are critical to the effective utilization of computational resources are efficient scheduling of jobs and providing fault tolerance in a reliable manner. This paper addresses these problems by combining the checkpoint replication based fault tolerance mechanism with minimum total time to release (MTTR) job scheduling algorithm. TTR includes the service time of the job, waiting time in the queue, transfer of input and output data to and from the resource. The MTTR algorithm minimizes the response time by selecting a computational resource based on job requirements, job characteristics, and hardware features of the resources. The fault tolerance mechanism used here sets the job checkpoints based on the resource failure rate. If resource failure occurs, the job is restarted from its last successful state using a checkpoint file from another grid resource. Globus ToolKit is used as the grid middleware to set up a grid environment and evaluate the performance of the proposed approach. The monitoring tools Ganglia and Network Weather Service are used to gather hardware and network details, respectively. The experimental results demonstrate that, the proposed approach effectively schedule the grid jobs with fault-tolerant way thereby reduces TTR of the jobs submitted in the grid. Also, it increases the percentage of jobs completed within specified deadline and making the grid trustworthy.

关键词： grid computing job scheduling computational grid checkpointing fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A computational grid Scheduling Model to Maximize Reliability Using Modified GA

引用

INTERNATIONAL JOURNAL OF grid AND HIGH PERFORMANCE COMPUTING 2011年第1期3卷 1-20页

作者： Raza, Zahid Vidyarthi, Deo Prakash Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi India Banasthali Vidyapith Univ Vanasthali Rajasthan India Banaras Hindu Univ Dept Comp Sci Varanasi Uttar Pradesh India

This paper presents a grid scheduling model to schedule a job on the grid with the objective of ensuring maximum reliability to the job under the current grid state. The model schedules a modular job to those resources that suit the job requirements in terms of resources while offering the most reliable environment. The reliability estimates depict true grid picture and considers the contribution of the computational resources, network links and the application awaiting allocation. The scheduling executes the interactive jobs while considering the looping structure. As scheduling on the grid is an NP hard problem, soft computing tools are often applied. This paper applies Modified Genetic Algorithm (MGA), which is an elitist selection method based on the two threshold values, to improve the solution. The MGA works on the basis of partitioning the current population in three categories: the fittest chromosomes, average fit chromosomes and the ones with worst fitness. The worst are dropped, while the fittest chromosomes of the current generation are mated with the average fit chromosomes of the previous generation to produce off-spring. The simulation results are compared with other similar grid scheduling models to study the performance of the proposed model under various grid conditions.

关键词： computational grid Elitist Method Genetic Algorithm NP Hard Problems Reliability Scheduling

来源：评论

学校读者我要写书评

暂无评论

Homogeneous Clusters Allocation of computational Resources 12

Homogeneous Clusters Allocation of Computational Resources

引用

12th Iberian Conference on Information Systems and Technologies (CISTI)

作者： Senger, Wagner de Gois, Lourival Aparecido Univ Tecnol Fed Parana Ponta Grossa Parana Brazil

ISBN: (纸本)9781509050475

This paper aims to propose a new approach of computational resources clustering, where all of them could be placed in groups with enough conditions to supply some processing demand. This format allows the process result groups to have an equivalent computational power to each other. To allow this, each resource must be evaluated not only by one feature or component, but by a several process relevant elements. This computational power calculation use the concept applied in perceptron neural networks, who use a combination of processed values as a input of a neuron to compile the final value. In a second step, the resources are processed by a farthest hierarchical algorithm, who is in charge to group the elements and balance the total power at the end of the process.

关键词： computational grid cluster load balance hierarchical algorithm perceptron network

来源：评论

学校读者我要写书评

暂无评论

A clairvoyant site allocation policy based on service demands of jobs in a computational grid

引用

SIMULATION MODELLING PRACTICE AND THEORY 2011年第6期19卷 1465-1478页

作者： Zikos, Stylianos Karatza, Helen D. Aristotle Univ Thessaloniki Dept Informat Thessaloniki 54124 Greece

In the present paper we evaluate the performance of three different site allocation policies in a 2-level computational grid with heterogeneous sites. We examine the case where service demands of jobs show high variability, and we consider that schedulers are aware of the service times. A simulation model is used to evaluate performance in terms of the average response time and slowdown, under medium and high load. The impact of the various input parameters on performance is also taken into account. Simulation results show that one policy outperforms the other two that are examined, especially at high load. Furthermore, no performance degradation is observed when estimations are used instead of exact knowledge about job service times. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Clairvoyant scheduling Site allocation Bounded Pareto computational grid Simulation Estimated service times

来源：评论

学校读者我要写书评

暂无评论

Optimal Model for Scheduling of computational grid Entities

Optimal Model for Scheduling of Computational Grid Entities

引用

Annual IEEE India Conference - Engineering Sustainable Solutons

作者： Chaudhuri, Amritava Jana, Debasish Bhaumik, Bijan Bihari Tata Consultancy Serv Ltd Kolkata India TEOCO Software Pvt Ltd Kolkata India Jadavpur Univ Dept Comp Sci & Engn Kolkata India

ISBN: (纸本)9781457711091

In computational grid, effective scheduling of job and resource plays an essential role to optimize and enhance the quality of services provided to the service consumers by the service providers. In order to obtain this collaborative harmony, proper utilization and allocation of grid computing entities should be the imperative need of the hour. This paper primarily focuses on the optimal model for scheduling of grid entities among an assortment of conventional methods of job and resource scheduling and concurrent execution on multiple market based economic scheduling models. While highlighting the merits and demerits of some select scheduling models through illustrative simulations in an optimized arrangement, the paper aims to obtain collaborative stability amongst computational grid entities.

关键词： computational grid Job and Resource Scheduling Conventional Scheduling Models Economic Scheduling Models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：