1,291 research outputs found

    Cloud computing resource scheduling and a survey of its evolutionary approaches

    Get PDF
    A disruptive technology fundamentally transforming the way that computing services are delivered, cloud computing offers information and communication technology users a new dimension of convenience of resources, as services via the Internet. Because cloud provides a finite pool of virtualized on-demand resources, optimally scheduling them has become an essential and rewarding topic, where a trend of using Evolutionary Computation (EC) algorithms is emerging rapidly. Through analyzing the cloud computing architecture, this survey first presents taxonomy at two levels of scheduling cloud resources. It then paints a landscape of the scheduling problem and solutions. According to the taxonomy, a comprehensive survey of state-of-the-art approaches is presented systematically. Looking forward, challenges and potential future research directions are investigated and invited, including real-time scheduling, adaptive dynamic scheduling, large-scale scheduling, multiobjective scheduling, and distributed and parallel scheduling. At the dawn of Industry 4.0, cloud computing scheduling for cyber-physical integration with the presence of big data is also discussed. Research in this area is only in its infancy, but with the rapid fusion of information and data technology, more exciting and agenda-setting topics are likely to emerge on the horizon

    ETEA: A euclidean minimum spanning tree-Based evolutionary algorithm for multiobjective optimization

    Get PDF
    © the Massachusetts Institute of TechnologyAbstract The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in the space, where the edge weight between each pair of points is their Euclidean distance. Since the generation of an EMST is entirely determined by the Euclidean distance between solutions (points), the properties of EMSTs have a close relation with the distribution and position information of solutions. This paper explores the properties of EMSTs and proposes an EMST-based Evolutionary Algorithm (ETEA) to solve multiobjective optimization problems (MOPs). Unlike most EMO algorithms that focus on the Pareto dominance relation, the proposed algorithm mainly considers distance-based measures to evaluate and compare individuals during the evolutionary search. Specifically in ETEA, four strategies are introduced: 1) An EMST-based crowding distance (ETCD) is presented to estimate the density of individuals in the population; 2) A distance comparison approach incorporating ETCD is used to assign the fitness value for individuals; 3) A fitness adjustment technique is designed to avoid the partial overcrowding in environmental selection; 4) Three diversity indicators-the minimum edge, degree, and ETCD-with regard to EMSTs are applied to determine the survival of individuals in archive truncation. From a series of extensive experiments on 32 test instances with different characteristics, ETEA is found to be competitive against five state-of-the-art algorithms and its predecessor in providing a good balance among convergence, uniformity, and spread.Engineering and Physical Sciences Research Council (EPSRC) of the United Kingdom under Grant EP/K001310/1, and the National Natural Science Foundation of China under Grant 61070088

    The Nash-Equilibrium Requires Strong Cooperation

    Get PDF
    Contrary to the customary view that the celebrated Nash-equilibrium theorem in Game Theory is paradigmatic for non-cooperative games, it is shown that, in fact, it is essentially based on a particularly strong cooperation assumption. Furthermore, in practice, this cooperation assumption is simply unrealistic

    Assessing partnership alternatives in an IT network employing analytical methods

    Get PDF
    One of the main critical success factors for the companies is their ability to build and maintain an effective collaborative network. This is more critical in the IT industry where the development of sustainable competitive advantage requires an integration of various resources, platforms, and capabilities provided by various actors. Employing such a collaborative network will dramatically change the operations management and promote flexibility and agility. Despite its importance, there is a lack of an analytical tool on collaborative network building process. In this paper, we propose an optimization model employing AHP and multiobjective programming for collaborative network building process based on two interorganizational relationships’ theories, namely, (i) transaction cost theory and (ii) resource-based view, which are representative of short-term and long-term considerations. The five different methods were employed to solve the formulation and their performances were compared. The model is implemented in an IT company who was in process of developing a large-scale enterprise resource planning (ERP) system. The results show that the collaborative network formed through this selection process was more efficient in terms of cost, time, and development speed. The framework offers novel theoretical underpinning and analytical solutions and can be used as an effective tool in selecting network alternatives

    The Nash Equilibrium requires strong cooperation

    Get PDF
    Contrary to the customary view that the celebrated Nash-equilibrium theorem in Game Theory is paradigmatic for non-cooperative games, it is shown that, in fact, it is essentially based on a particularly strong cooperation assumption. Furthermore, in practice, this cooperation assumption is simply unrealistic.non-cooperation, strong cooperation, mixup in the Nash equilibrium

    New Advances in Decision Support Systems Corporate Systematic Thinking and its Implementation: One of the Traditional Japanese Management Concepts

    Get PDF
    Research in the field of Methodology of Decision Analysis and Decision Support Systems is one of the topics investigated during several years within the System and Decision Sciences Program. Beside theoretical and methodological research, applications are considered as a very important component of this research. Developing methodologies and computer systems requires practical verification of these concepts as well as the learning of decision making styles and practices from organizations implementing up-to-date management techniques. Application and experimentation is the only possible approach for the validation of new concepts developed by researchers and feedback from practice is one possible way for generation of new ideas. Recognizing the importance of the above mentioned feedback, the System and Decision Sciences Program organized joint Seminar Days with the Japan Institute for Systems Research with participation of managers from leading companies of Japan industry. During this seminar they presented experience on implementing new management and decision making technologies in their organizations. The given paper presents several aspects of management in the context of introducing innovative technologies as well as organization of the research and development process at Matsushita Corporation

    A novel composite web service selection based on quality of service

    Get PDF
    Using the internet, as a dynamic environment thanks to its distributed characteristic, for web service deployment has become a crucial issue in QoS-driven service composition. An accurate adaption should be undertaken to provide a reliable service composition which enables the composited services are being executed appropriately. That is, the critical aspect of service composition is the proper execution of combination of web services while the appropriate service adaption performed with respect to predetermined functional and non-functional characteristics. In this paper, we attempts to deliberate the optimization approaches to devise the appropriate scheme for QoS-based composite web service selection
    corecore