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

A high performance finite capacitated MRP process using a computational grid

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2009年第8期47卷 2109-2123页

作者： Lee, Hyoung-Gon Park, Namkyu Park, Jinwoo Seoul Natl Univ Dept Ind Engn U Comp Innovat Ctr Seoul South Korea MIT Mfg & Prod Lab Cambridge MA 02139 USA Wayne State Univ Dept Ind & Mfg Engn Detroit MI USA

A material requirement planning (MRP) process generates a production plan which guarantees an exact quantity of the right materials available at the needed time. Providing an executable production plan at high speed has remained a goal for MRP since the process was first developed in the 1970s. However, due to the time consuming characteristic of the process with its intensive database interaction, real time processing remained unattainable. Moreover, this performance issue became worse, as the utilisation of production resources on the shop floor are expected to be maximised by the process due to a dynamic market environment. This paper presents a recent work by the authors on the concept of using a computational grid to achieve a breakthrough in its performance under conditions of finite capacity. The proposed system resolves capacity constraints by applying a simple heuristic called longest tail first rule, which is proved to minimise the total lead time, to each distributed cluster obviating the need for any rescheduling procedures. Implementation of this concept in a distributed database environment and its performance analysis are described. The experimental results suggest that the proposed finite capacitated MRP process has desirable characteristics in terms of processing time with a deep bill of material as in current supply chain practice.

关键词： material requirement planning computational grid capacity constraints longest tail first rule

来源：评论

学校读者我要写书评

暂无评论

Resource Management System for computational grid Building

Resource Management System for Computational Grid Building

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Martinovic, Goran Josip Juraj Strossmayer Univ Osijek Fac Elect Engn Osijek Croatia

ISBN: (纸本)9781424427932

The developed DnD grid system aims to improve building of distributed computer environments by dedicated and non-dedicated resources. The proposed approach supposes overdimensioned static performance and dynamic underloading of non-dedicated resources. Efficiency, availability and autonomy of such distributed heterogeneous environment depend on platform, application, mapping and resource owner/service user (human). The developed resource management system enables creation of a ranking list of owners/users and their resources, monitoring of parameters of the established virtual organization during application execution, as well as improvement of system performance by careful mapping resources and owners/users. The obtained experimental results show that the proposed approach and the corresponding mapping algorithm can significantly improve system performance.

关键词： computational grid cooperation non-dedicated resources virtual enterprise

来源：评论

学校读者我要写书评

暂无评论

A high performance finite capacitated MRP process using a computational grid

A high performance finite capacitated MRP process using a co...

引用

19th International Conference on Production Research

关键词： material requirement planning computational grid capacity constraints longest tail first rule

来源：评论

学校读者我要写书评

暂无评论

Hierarchical genetic-based grid scheduling with energy optimization

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2013年第3期16卷 591-609页

作者： Kolodziej, Joanna Khan, Samee Ullah Wang, Lizhe Byrski, Aleksander Min-Allah, Nasro Madani, Sajjad Ahmad Cracow Univ Technol Inst Comp Sci Ul Warszawska 24 PL-31155 Krakow Poland N Dakota State Univ NDSU CIIT Green Comp & Commun Lab Fargo ND 58108 USA Chinese Acad Sci Earth Observat Ctr Beijing Peoples R China AGH Univ Sci & Technol Dept Comp Sci Krakow Poland COMSATS Inst Informat Technol Dept Comp Sci Islamabad Abbottabad Pakistan

An optimization of power and energy consumptions is the important concern for a design of modern-day and future computing and communication systems. Various techniques and high performance technologies have been investigated and developed for an efficient management of such systems. All these technologies should be able to provide good performance and to cope under an increased workload demand in the dynamic environments such as computational grids (CGs), clusters and clouds. In this paper we approach the independent batch scheduling in CG as a bi-objective minimization problem with makespan and energy consumption as the scheduling criteria. We use the Dynamic Voltage Scaling (DVS) methodology for scaling and possible reduction of cumulative power energy utilized by the system resources. We develop two implementations of Hierarchical Genetic Strategy-based grid scheduler (Green-HGS-Sched) with elitist and struggle replacement mechanisms. The proposed algorithms were empirically evaluated versus single-population Genetic Algorithms (GAs) and Island GA models for four CG size scenarios in static and dynamic modes. The simulation results show that proposed scheduling methodologies fairly reduce the energy usage and can be easily adapted to the dynamically changing grid states and various scheduling scenarios.

关键词： Genetic algorithm Hierarchical genetic strategy computational grid Scheduling Dynamic voltage Frequency scaling

来源：评论

学校读者我要写书评

暂无评论

A computational grid framework for immunological applications

引用

PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 2009年第1898期367卷 2705-2716页

作者： Halling-Brown, Mark D. Moss, David S. Sansom, Clare E. Shepherd, Adrian J. Birkbeck Coll Sch Crystallog Inst Struct & Mol Biol London WC1E 7HX England

We have developed a computational grid that enables us to exploit through a single interface a range of local, national and international resources. It insulates the user as far as possible from issues concerning administrative boundaries, passwords and different operating system features. This work has been undertaken as part of the European Union Immunogrid project whose aim is to develop simulations of the immune system at the molecular, cellular and organ levels. The Immunogrid consortium has members with computational resources on both sides of the Atlantic. By making extensive use of existing grid middleware, our grid has enabled us to exploit consortium and publicly available computers in a unified way, notwithstanding the diverse local software and administrative environments. We took 40 000 polypeptide sequences from 4000 avian and mammalian influenza strains and used a neural network for class I T-cell epitope prediction tools for 120 class I alleles and haplotypes to generate over 14 million high-quality protein-peptide binding predictions that we are mapping onto the three-dimensional structures of the proteins. By contrast, the grid is also being used for developing new methods for class T-cell epitope predictions, where we have running batches of 120 molecular dynamics free-energy calculations.

关键词： Immunogrid computational grid grid middleware T-cell epitope prediction

来源：评论

学校读者我要写书评

暂无评论

Market_based grid resource allocation using new negotiation model

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2013年第1期36卷 543-565页

作者： Adabi, Sepideh Movaghar, Ali Rahmani, Amir Masoud Beigy, Hamid Islamic Azad Univ Sci & Res Branch Dept Comp Engn Tehran Iran Sharif Univ Technol Tehran Iran

This paper presents a new negotiation model for designing Market- and Behavior-driven Negotiation Agents (MBDNAs) that address computational grid resource allocation problem. To determine the amount of concession for each trading cycle, the MBDNAs are guided by six factors: (1) number of negotiator's trading partners, (2) number of negotiator's competitors, (3) negotiator's time preference, (4) flexibility in negotiator's trading partner's proposal, (5) negotiator's proposal deviation from the average of its trading partners' proposals, and (6) previous concession behavior of negotiator's trading partner. In our experiments, we compare grid resource consumer (GRC) of type MBDNAs (respectively grid resource owner (GRO) of type MBDNAs) with MDAs (Market Driven Agents) in terms of the following metrics: total tasks complementation and average utility (respectively resource utilization level and average utility). The results show that by taking the proposed factors into account, MBDNAs of both types make a more efficient concession amount than MDAs and are, therefore, considered an appropriate mechanism for grid resource allocation in different grid workloads and market types. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： computational grid Resource management Resource allocation Pricing Market-like Multiagent systems

来源：评论

学校读者我要写书评

暂无评论

Effects of Turbulence Model and computational grid on the Calculation Accuracy of the Aerodynamic Performance of S814 Airfoil Based on RANS

Effects of Turbulence Model and Computational Grid on the Ca...

引用

International Conference on Energy and Environment Technology (ICEET 2009)

作者： Lu Congming Li Yuhong Tsinghua Univ Dept Thermal Engn Beijing 100084 Peoples R China

ISBN: (纸本)9780769538198

Turbulence model and computational grid are playing important roles in calculating the aerodynamic performance of wind turbine airfoils. In order to find a suitable turbulence model and computational grid, to calculate the aerodynamic performance data of wind turbine airfoil more accurately as well as to further understand the nature of flow over an airfoil, this article simulates the flow over the S814-airfoil with the angle of attack (alpha) at a range of 0 degrees to 30 degrees by trying different turbulence models based on RANS and a series of computational grids. An analysis and comparison of simulated results concludes that the RNGk-epsilon model and the two-equation transition model based on SST can accumulate more accurately at the angle of attack less than 10 degrees, and when the alpha is larger than 10 degrees, the SST model has better performance than the other models. In addition, appropriate optimization of the grids on airfoil's suction side and head part and moderate constraint of the total number of the computational grid are both helpful to improve the calculation accuracy.

关键词： turbulence models computational grid wind turbine airfoil aerodynamic performance Numerical Simulation

来源：评论

学校读者我要写书评

暂无评论

High Performance Natural Language Processing Services On The GARUDA grid

High Performance Natural Language Processing Services On The...

引用

National Conference on Parallel Computing Technologies (PARCOMPTECH)

作者： Tomar, Anuradha Bodhankar, Jahnavi Kurariya, Pavan Anarase, Pramod Jain, Priyanka Lele, Anuradha Darbari, Hemant Bhavsar, Virendrakumar C. Ctr Dev Adv Comp Pune Maharashtra India Univ New Brunswick Fac Comp Sci Fredericton NB Canada

ISBN: (纸本)9781479915897

The main objective of this paper is to introduce a high performance natural language processing (NLP) service to fulfill the needs of researchers and users in the area of natural language computing. We consider various NLP components developed at Applied Artificial Group of C-DAC Pune, and carry out parallelization on the GARUDA grid. We demonstrate that almost linear speedup is achieved with good efficiencies. With 32 processors, we have achieved a speedup of more than 19. This allows us to offer high performance scalable NLP Web services. Further, the GARUDA grid offers high availability.

关键词： natural language processing parallel processing computational complexity linguistic complexity NLP Framework machine translation MPJ Express computational grid high performance computing GARUDA

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of Game Theoretic Approaches in Distributed System

Comparative Study of Game Theoretic Approaches in Distribute...

引用

World Congress on Computer and Information Technologies (WCCIT)

作者： Kapade, Nikhil Deshmukh, Sudarshan Pimpri Chinchwad Coll Engn Dept Comp Engn Pune 44 Maharashtra India

ISBN: (纸本)9781479904624

In this paper, we present a game theoretic framework for different type of distributed system problem like load balancing, maximizing network throughput, and dynamic network selection. This type of problem give different result depends on environment of distributed systems. We analyze different game theory approaches with their advantage and disadvantage. Finally conclude chapter with comparing Game theory model according to their problem statement.

关键词： computational grid Game Theory Load Balancing Mesh Network VANET

来源：评论

学校读者我要写书评

暂无评论

An effective and robust two-phase resource allocation scheme for interdependent tasks in mobile ad hoc computational grids

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2012年第12期72卷 1664-1679页

作者： Shah, Sayed Chhattan Nizamani, Qurat-Ul-Ain Chauhdary, Sajjad Hussain Park, Myong-Soon Elect & Telecommun Res Inst IT Convergence Res Div Taejon 305606 South Korea Univ Sindh Inst Math & Comp Sci Jamshoro Pakistan Korea Univ Dept Comp Sci & Engn Seoul South Korea

This paper addresses the problem of resource allocation to interdependent tasks in mobile ad hoc computational grids. Dependencies between tasks imply that there can be heavy communication induced by data transfers between tasks executed on separate nodes. The communication in mobile ad hoc grids is always expensive and unreliable, and therefore plays a critical role in application performance. There are several factors that contribute to communication cost. Unreliable and short-term connectivity can increase communication cost due to frequent failure and activation of links, and ineffective resource allocation can increase communication cost due to multi hop communication between dependent tasks. To reduce communication cost, an effective and robust resource allocation scheme is required. However, the design of such a scheme for mobile ad hoc computational grids exhibits numerous difficulties due to the constrained communication environment, node mobility, and lack of pre-existing network infrastructure. In this paper, we propose a two-phase resource allocation scheme to reduce communication cost between dependent tasks. The scheme is divided into two phases. The first phase exploits the history of user mobility patterns to select nodes that provide long-term connectivity and the second phase takes into account the task and dependency types, and uses the distance information among the nodes selected in the first phase to reduce communication costs. The scheme is validated in a simulation environment using various workloads and parameters. (c) 2012 Elsevier Inc. All rights reserved.

关键词： computational grid Ad hoc networks Resource allocation Task dependencies Mobile grids

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：