The integration of process planning and machine loading in small batch part manufacturing

PART is a highly automated planning system in which both process and production planning functions are integrated. This paper discusses a method to improve machine tool selection in process planning by integration with loading. A method is presented to select the best process plan from a number of possible alternatives taking into account the limited availability of resources. Various aspects of the quality of a process plan are evaluated and expressed in the so-called evaluation time. To prevent redundant work, partly worked out process plans are considered as alternatives. The consequences of the different alternatives have to be estimated which includes the estimation of machining times. The loading problem is modelled as the minimization of the total evaluation time for a given order set, subjected to capacity constraints

Dynamic load balancing algorithm complexity

This paper presents a theoretical analysis of the asymptotic complexity inherent in a load balancing algorithm in a loosely-coupled network, where processor communication is achieved by message passing. The load balancing complexity depends on the network topology and the overhead of processor communication for each polling strategy. The best, worst, and average case analysis of the load balancing algorithms for the various polling topologies are presented. The polling strategies considered are local, global, and random polling. The complexity is presented as a function of the number of processors in the network

A Survey on Load Balancing Algorithms for VM Placement in Cloud Computing

The emergence of cloud computing based on virtualization technologies brings huge opportunities to host virtual resource at low cost without the need of owning any infrastructure. Virtualization technologies enable users to acquire, configure and be charged on pay-per-use basis. However, Cloud data centers mostly comprise heterogeneous commodity servers hosting multiple virtual machines (VMs) with potential various specifications and fluctuating resource usages, which may cause imbalanced resource utilization within servers that may lead to performance degradation and service level agreements (SLAs) violations. To achieve efficient scheduling, these challenges should be addressed and solved by using load balancing strategies, which have been proved to be NP-hard problem. From multiple perspectives, this work identifies the challenges and analyzes existing algorithms for allocating VMs to PMs in infrastructure Clouds, especially focuses on load balancing. A detailed classification targeting load balancing algorithms for VM placement in cloud data centers is investigated and the surveyed algorithms are classified according to the classification. The goal of this paper is to provide a comprehensive and comparative understanding of existing literature and aid researchers by providing an insight for potential future enhancements.Comment: 22 Pages, 4 Figures, 4 Tables, in pres

Dynamic resource allocation scheme for distributed heterogeneous computer systems

This invention relates to a resource allocation in computer systems, and more particularly, to a method and associated apparatus for shortening response time and improving efficiency of a heterogeneous distributed networked computer system by reallocating the jobs queued up for busy nodes to idle, or less-busy nodes. In accordance with the algorithm (SIDA for short), the load-sharing is initiated by the server device in a manner such that extra overhead in not imposed on the system during heavily-loaded conditions. The algorithm employed in the present invention uses a dual-mode, server-initiated approach. Jobs are transferred from heavily burdened nodes (i.e., over a high threshold limit) to low burdened nodes at the initiation of the receiving node when: (1) a job finishes at a node which is burdened below a pre-established threshold level, or (2) a node is idle for a period of time as established by a wakeup timer at the node. The invention uses a combination of the local queue length and the local service rate ratio at each node as the workload indicator

A case study of campus‐based flexible learning using the World Wide Web and computer conferencing

This paper explores the use of the World Wide Web (WWW) integrated with computer conferencing as a teaching and learning tool. The aim of the study described was to evaluate the effectiveness of the use of online materials designed in a flexible learning format and integrated with a computer conference. It was hoped that this would create additional opportunity for group discourse between campus‐based students. The paper is divided in the following way: a discussion of the context to new developments in teaching and learning is followed by an introduction to the case study. Finally the findings of the case study are discussed with reference to research from the field of collaborative systems (Orlikowski, 1992; Grudin, 1994) as a framework for reflection. Some tentative conclusions are made for future work