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

scheduling and Control of Flexible Manufacturing Systems: a Holonic Approach

REVISTA IBEROAMERICANA DE AUTOMATICA E INFORMATICA INDUSTRIAL 2015年第1期12卷 58-68页

作者： Arauzo, J. A. del-Olmo-Martinez, R. Lavios, J. J. de-Benito-Martin, J. J. Univ Valladolid Dept Org Empresas & CIM Escuela Ingn Ind E-47011 Valladolid Spain Univ Burgos Dept Ingn Civil Escuela Politecn Super E-09001 Burgos Spain

Ho Ionic Manufacturing Systems are a new manufacturing paradigm. They are included into distributed methodologies and propose new manufacturing management schemes that combine self-organization, dynamic hierarchies and horizontal relationships. This approach is closer to manufacturing system nature than centralized or strictly traditional hierarchical approaches. It allows modeling manufacturing systems in a more realistic way. So, it make easier to implement more flexible, scalable, responsiveness, reconfigurable, and robust production management systems. In this paper we propose a holonic system for scheduling and control of flexible manufacturing systems. The system is based on a new architecture that integrates two decision levels: a level of auction-based scheduling, where each holon performs its own local schedule, and another level of dispatching and control that coordinate holons activities. Unlike other studies in which local schedules are integrated into a global schedule that centralizes the system, the proposed system is not so. The dispatching and control mechanism is responsible to integrate the local programs. In addition, the developed prototype can operate with different degrees of decentralization, which allows evaluating the advantages that our approach provides by means of simulation.

关键词： Production control production systems scheduling algorithms flexible manufacturing systems intelligent manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

A novel near-optimum distributed scheduling algorithm for mmWave mesh networks

A novel near-optimum distributed scheduling algorithm for mm...

引用

International Conference on Computer Engineering and Systems

作者： Muhammad K. Ibrahim Mahmoud H. Ismail M. Watheq El-Kharashi Computer and Systems Engineering Department Ain Shams University Cairo Egypt Department of Electrical Engineering American University of Sharjah Sharjah UAE Department of Electronics and Communications Engineering Cairo University Giza Egypt

ISBN: (纸本)9781509032686

A distributed scheduling algorithm for millimeter wave (mmW) mesh networks is studied in this paper. The suggested algorithm starts initially with a random feasible schedule determined in a cooperative way between the nodes then tries to reach better feasible schedules via parallel and successive local search for better schedules in a defined range for each node without violating the feasibility constraints. The algorithm takes into consideration parameters like air utilization via maximizing the total number of reserved slots for all nodes as well as fairness. Simulation results show a throughput enhancement of about 6% over the well-known memory-guided directional MAC (MDMAC) for most network sizes. This improvement comes with negligible overhead and computation power.

关键词： Schedules Throughput Mesh networks scheduling algorithms Simulation Receivers Directional antennas

来源：评论

学校读者我要写书评

暂无评论

Enhanced job scheduling algorithm with budget constraints in computational grids

Enhanced job scheduling algorithm with budget constraints in...

引用

International Conference on Computational Techniques in Information and Communication Technologies (ICCTICT)

作者： Shalini Chawla Krishan Saluja Department of CSE SBS State Technical Campus Ferozepur India Department of CSE Punjab Technical University Ferozepur India

ISBN: (纸本)9781509000838

In present era, technical problems are complex enough to be resolved by a single computer. Grid Computing is a promising field that deals with exploiting the idle CPU cycles of resources connected in a network. Job scheduling is a most demanding subject in computing grids. An effective scheduling strategy is required to utilize the resources in grid and to balance the overall load on them. This paper presents an enhanced job scheduling algorithm with budget constraint which extends existing algorithm to include economy factor into account. The main contribution of our work is dual: Firstly it tries to balance load of overall grid system and secondly it assigns tasks to resources with best computing capability which lies within the budget specified by each user. The performance of proposed algorithm is assessed by conducting simulations using GridSim. Observations prove that this algorithm achieves reduced average cost of execution for jobs to great extent so that it lies in the user's stated budget.

关键词： Load management Clustering algorithms Portals scheduling algorithms Grid computing Load modeling

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of Resource scheduling Mechanisms Based on Software Defined Security

Research and Implementation of Resource Scheduling Mechanism...

引用

International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC

作者： Zelang Wang Guochu Shou Yihong Hu Zhigang Guo Beijing Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781509051557

Compared with the traditional stiff and decentralized security mechanisms, software-defined security SDS provides a flexible and centralized solution through extract security strategy from the hardware to the software. A variety of software-defined security architecture has been proposed, basically like SDN three layer, let the control layer separate from the data layer. Now, however, these software-defined security architectures proposed and implemented in the SDS ignored resource scheduling mechanism which can schedule security resources effectively and flexibility. This paper presents a resource scheduling mechanism in software-defined security, and a scheduling algorithm to achieve load balancing. Experiments show that the applied resource scheduling mechanism in our SDS architecture can work well in scheduling scanners in Physical Layer, and achieve the target of load balancing of scanners, can provide users with more flexible security services.

关键词： Security Computer architecture Physical layer scheduling algorithms Job shop scheduling Software

来源：评论

学校读者我要写书评

暂无评论

scheduling Algorithm Design for Virtualized Hardware Accelerator in C-RAN

Scheduling Algorithm Design for Virtualized Hardware Acceler...

引用

International Conference on Cloud Computing Research and Innovation (ICCCRI)

作者： Hui Zhu Zhifeng Zhang Jun Wu Dong Guo Shaoxian Tang College of Electronics and Information Engineering Tongji University Shanghai China

In order to improve energy efficiency of computation-intensive workloads in Cloud Radio Access Network (C-RAN), virtualized hardware accelerators (HA) are proposed in this paper. In C-RAN architecture, the base stations (BS) are running in the virtual machines. Virtualization mechanism of HA makes each BS feel like owning a HA exclusively, but actually BSs sharing the HAs. To tackle the problem of efficiently sharing HA by multiple BSs in the cloud platform, a scheduling algorithm with pipelined first-come-first-service (FCFS) was proposed in this paper, named PL-FCFS. PL-FCFS sets up two queues for tasks aiming to fully utilize HA with pipelining model. With this design, multiple virtual BSs can access the HA simultaneously and efficiently. To evaluate the performance of PL-FCFS, we use HA to accelerate turbo decoding of LTE physical layer(LTE PHY), and implement this scheduling algorithm for virtuaized HA in Xen paravirtualization environment. Experimental results indicate that four virtual BSs running LTE PHY with 5M bandwidth can be supported well by the PL-FCFS based evaluation system, and the performance is improved by 25% compared with FCFS scheduling algorithm.

关键词： Decoding Hardware Servers scheduling algorithms Virtualization Long Term Evolution scheduling

来源：评论

学校读者我要写书评

暂无评论

scheduling in mobile grid for telemedicine application using improved ABC algorithm

Scheduling in mobile grid for telemedicine application using...

引用

International Conference on Emerging Trends in Engineering, Technology and Science (ICETETS)

作者： T. Vigneswari M. A. Maluk Mohamed Dept.of CSE M.A.M College of Engineering Tiruchirappalli India Research Guide M.A.M College of Engineering Tiruchirappalli India

ISBN: (纸本)9781467367264

The massive growth in the field of mobile computing and communications paved way to another perception of grid computing called as mobile grid computing. Resource management is one of the key concerns in the effective utilization of mobile grid concept. In this work, a hybrid Artificial Bee Colony (ABC) using modified Heterogeneous Earliest Finish Time (HEFT) based clustering along with min-min algorithm to create the initial population is proposed. We have adapted Cluster Heterogeneous Earliest First Min-Min Artificial Bee Colony (CHMM-ABC) scheduling algorithm which will efficiently schedule the data to computational resource to congregate the scope of the middleware successfully. Simulations are conducted with wide-range of jobs and resource clusters.

关键词： Mobile communication Mobile handsets scheduling algorithms scheduling Clustering algorithms Resource management Sociology

来源：评论

学校读者我要写书评

暂无评论

A Budget Constrained scheduling Algorithm for Hybrid Cloud Computing Systems Under Data Privacy

A Budget Constrained Scheduling Algorithm for Hybrid Cloud C...

引用

IEEE International Conference on Cloud Engineering (IC2E)

作者： Amin Rezaeian Hamid Abrishami Saeid Abrishami Mahmoud Naghibzadeh Dept of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran

In hybrid cloud model, organizations can keep their sensitive information and critical applications in the private cloud and move other data and applications to a public cloud, if necessary. To maintain data privacy in workflow applications, we present a budget constrained hybrid cloud scheduler (BCHCS) which is a static heuristic scheduling algorithm. It is able to make decisions about scheduling sensitive tasks on private cloud and uses public cloud's resources for non-sensitive tasks, such that the makespan is minimized, while the budget limitation imposed by the user is satisfied. Experimental results show that the proposed method guarantees the execution of sensitive tasks on private cloud while achieving at least 7 percent lower makespan and higher success rate in comparison to similar existing techniques.

关键词： Cloud computing Schedules scheduling algorithms scheduling Data privacy Workflow management software Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

An adaptive energy-efficient task scheduling under execution time variation based on statistical analysis

An adaptive energy-efficient task scheduling under execution...

引用

IFIP International Conference on Very Large Scale Integration (VLSI-SoC)

作者： Takashi Nakada Tomoki Hatanaka Hiroshi Nakamura Hiroshi Ueki Masanori Hayashikoshi Toru Shimizu The University of Tokyo Renesas Electronics Corporation Keio University

ISBN: (纸本)9781509035625

Near real-time data processing tasks, such as multimedia streaming applications, exhibit a common fact that their deadline periods are longer than their input intervals due to buffering. Therefore, it is possible to minimize their energy consumption without deadline violations. In this work, we propose an energy efficient slack-based task scheduling algorithm for such tasks by adapting to task size variations and applying DVFS with the help of statistical analysis. We confirmed that our proposal can further reduce the energy consumption when compared to oracle frame-based scheduling.

关键词： Energy consumption Real-time systems Optimal scheduling Statistical analysis scheduling algorithms Heuristic algorithms Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Task scheduling Algorithm in Cloud Computing Environment Based on Cloud Pricing Models

Task Scheduling Algorithm in Cloud Computing Environment Bas...

引用

World Symposium on Computer Applications & Research

作者： Elhossiny Ibrahim Nirmeen A. El-Bahnasawy Fatma A. Omara Computer Science & Eng. Dept. Faculty of Electronic Eng. Menouf Egypt Faculty of Computers & information Cairo University Egypt

ISBN: (纸本)9781509041152

The Cloud Computing is a most widely spreading platform for executing tasks using virtual machines (VMs) as processing elements. Therefore, implementing HPC using Cloud Computing is considered a powerful approach by isolating tasks, reducing execution time, as well as, price, and satisfying load balance. In this paper, an enhancement task scheduling algorithm on the Cloud Computing environment has been introduced to reduce the make-span, as well as, decrease the price of executing the independent tasks on the cloud resources. The principles of the algorithm is based on calculating the total processing power of the available resources (i.e., VMs) and the total requested processing power by the users' tasks, then allocating a group of users' tasks to each VM based on the ratio of its needed power relative to the total processing power of all VMs. The power of VMs has been defined based on Amazon EC2 and Google pricing models. To evaluate the performance of the enhancement algorithm, a comparative study has been done among this enhancement algorithm, the default FCFS algorithm, and the existed GA, and PSO algorithms. The experimental results show that the enhancement algorithm outperforms other algorithms by reducing make-span and the price of the running tasks.

关键词： Cloud computing Genetic algorithms Pricing Google Mathematical model scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid Bat Inspired Algorithm for Multiprocessor Real-time scheduling Preparation

Hybrid Bat Inspired Algorithm for Multiprocessor Real-time S...

引用

International Conference on Communication and Signal Processing

作者： N. B. Arunekumar Anurudh Kumar K. Suresh Joseph Department of Computer Science Pondicherry University

ISBN: (纸本)9781467385497

Real Time Processor scheduling with no preemption of tasks is a class NP-hard problem. We have attempted to get the best task allocation schedule for sporadic tasks, such that all the tasks are being scheduled without missing its deadline. Bat algorithm was proposed from the motivation behind the bat's echolocation behaviour. Bat Searches for the prey in the given search location once found it tries to catch it by converging towards the direction of the prey. The existing system comprises of multiprocessor scheduling using bat algorithm which has been proved to be very efficient. Based on it we have proposed a modernistic algorithm to solve the Multi-objective multiprocessor scheduling algorithm of a soft real time scheduling system for both periodic and sporadic tasks that is completely scalable in nature. We have considered two objectives which are the maximum processor utilisation and minimised deadline miss. We have conducted experiments with several instances and found out that we are able to schedule the tasks by balancing both the objectives with the probability of 100% in arriving to the optimised schedule of the given tasks.

关键词： Bat-inspired algorithm scheduling algorithms Sporadic tasks Real-Time scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：