19,481 research outputs found

    Control theory for principled heap sizing

    Get PDF
    We propose a new, principled approach to adaptive heap sizing based on control theory. We review current state-of-the-art heap sizing mechanisms, as deployed in Jikes RVM and HotSpot. We then formulate heap sizing as a control problem, apply and tune a standard controller algorithm, and evaluate its performance on a set of well-known benchmarks. We find our controller adapts the heap size more responsively than existing mechanisms. This responsiveness allows tighter virtual machine memory footprints while preserving target application throughput, which is ideal for both embedded and utility computing domains. In short, we argue that formal, systematic approaches to memory management should be replacing ad-hoc heuristics as the discipline matures. Control-theoretic heap sizing is one such systematic approach

    ROUTINE AS DEVIATION

    Get PDF
    We draw on evidence scattered across thick descriptions of organizations to outline an alternative model of routine. Instead of defining routine as a process of compliance with prescribed rules and procedures we define it as a process of deviation from the prescribed elements of organizations, resulting from the mutual constitution of repetitive work and improvisation. This view of routine underscores its adaptive nature and suggests that flexibility can be achieved not only by nimble and openly innovative organizations but also by large and organizations engaging in ‘closet’ innovation.

    An optimal-control based integrated model of supply chain

    Get PDF
    Problems of supply chain scheduling are challenged by high complexity, combination of continuous and discrete processes, integrated production and transportation operations as well as dynamics and resulting requirements for adaptability and stability analysis. A possibility to address the above-named issues opens modern control theory and optimal program control in particular. Based on a combination of fundamental results of modern optimal program control theory and operations research, an original approach to supply chain scheduling is developed in order to answer the challenges of complexity, dynamics, uncertainty, and adaptivity. Supply chain schedule generation is represented as an optimal program control problem in combination with mathematical programming and interpreted as a dynamic process of operations control within an adaptive framework. The calculation procedure is based on applying Pontryagin’s maximum principle and the resulting essential reduction of problem dimensionality that is under solution at each instant of time. With the developed model, important categories of supply chain analysis such as stability and adaptability can be taken into consideration. Besides, the dimensionality of operations research-based problems can be relieved with the help of distributing model elements between an operations research (static aspects) and a control (dynamic aspects) model. In addition, operations control and flow control models are integrated and applicable for both discrete and continuous processes.supply chain, model of supply chain scheduling, optimal program control theory, Pontryagin’s maximum principle, operations research model,

    Dynamic Organizations: Achieving Marketplace and Organizational Agility with People

    Get PDF
    Driven by dynamic competitive conditions, an increasing number of firms are experimenting with new, and what they hope will be, more dynamic organizational forms. This development has opened up exciting theoretical and empirical venues for students of leadership, business strategy, organizational theory, and the like. One domain that has yet to catch the wave, however, is strategic human resource management (SHRM). In an effort to catch up, we here draw on the dynamic organization (DO) and human resource strategy (HRS) literatures to delineate both a process for uncovering and the key features of a carefully crafted HRS for DOs. The logic is as follows. DOs compete through marketplace agility. Marketplace agility requires that employees at all levels engage in proactive, adaptive, and generative behaviors, bolstered by a supportive mindset. Under the right conditions, the essential mindset and behaviors, although highly dynamic, are fostered by a HRS centered on a relatively small number of dialectical, yet paradoxically stable, guiding principles and anchored in a supportive organizational infrastructure. This line of reasoning, however, rests on a rather modest empirical base and, thus, is offered less as a definitive statement than as a spur for much needed additional research

    An autonomous satellite architecture integrating deliberative reasoning and behavioural intelligence

    Get PDF
    This paper describes a method for the design of autonomous spacecraft, based upon behavioral approaches to intelligent robotics. First, a number of previous spacecraft automation projects are reviewed. A methodology for the design of autonomous spacecraft is then presented, drawing upon both the European Space Agency technological center (ESTEC) automation and robotics methodology and the subsumption architecture for autonomous robots. A layered competency model for autonomous orbital spacecraft is proposed. A simple example of low level competencies and their interaction is presented in order to illustrate the methodology. Finally, the general principles adopted for the control hardware design of the AUSTRALIS-1 spacecraft are described. This system will provide an orbital experimental platform for spacecraft autonomy studies, supporting the exploration of different logical control models, different computational metaphors within the behavioral control framework, and different mappings from the logical control model to its physical implementation

    Understanding Behavioral Sources of Process Variation Following Enterprise System Deployment

    Get PDF
    This paper extends the current understanding of the time-sensitivity of intent and usage following large-scale IT implementation. Our study focuses on perceived system misfit with organizational processes in tandem with the availability of system circumvention opportunities. Case study comparisons and controlled experiments are used to support the theoretical unpacking of organizational and technical contingencies and their relationship to shifts in user intentions and variation in work-processing tactics over time. Findings suggest that managers and users may retain strong intentions to circumvent systems in the presence of perceived task-technology misfit. The perceived ease with which this circumvention is attainable factors significantly into the timeframe within which it is attempted, and subsequently impacts the onset of deviation from prescribed practice and anticipated dynamics

    Trustworthy autonomic architecture (TAArch): Implementation and empirical investigation

    Get PDF
    This paper presents a new architecture for trustworthy autonomic systems. This trustworthy autonomic architecture is different from the traditional autonomic computing architecture and includes mechanisms and instrumentation to explicitly support run-time self-validation and trustworthiness. The state of practice does not lend itself robustly enough to support trustworthiness and system dependability. For example, despite validating system's decisions within a logical boundary set for the system, there’s the possibility of overall erratic behaviour or inconsistency in the system emerging for example, at a different logical level or on a different time scale. So a more thorough and holistic approach, with a higher level of check, is required to convincingly address the dependability and trustworthy concerns. Validation alone does not always guarantee trustworthiness as each individual decision could be correct (validated) but overall system may not be consistent and thus not dependable. A robust approach requires that validation and trustworthiness are designed in and integral at the architectural level, and not treated as add-ons as they cannot be reliably retro-fitted to systems. This paper analyses the current state of practice in autonomic architecture, presents a different architectural approach for trustworthy autonomic systems, and uses a datacentre scenario as the basis for empirical analysis of behaviour and performance. Results show that the proposed trustworthy autonomic architecture has significant performance improvement over existing architectures and can be relied upon to operate (or manage) almost all level of datacentre scale and complexity

    DEPAS: A Decentralized Probabilistic Algorithm for Auto-Scaling

    Full text link
    The dynamic provisioning of virtualized resources offered by cloud computing infrastructures allows applications deployed in a cloud environment to automatically increase and decrease the amount of used resources. This capability is called auto-scaling and its main purpose is to automatically adjust the scale of the system that is running the application to satisfy the varying workload with minimum resource utilization. The need for auto-scaling is particularly important during workload peaks, in which applications may need to scale up to extremely large-scale systems. Both the research community and the main cloud providers have already developed auto-scaling solutions. However, most research solutions are centralized and not suitable for managing large-scale systems, moreover cloud providers' solutions are bound to the limitations of a specific provider in terms of resource prices, availability, reliability, and connectivity. In this paper we propose DEPAS, a decentralized probabilistic auto-scaling algorithm integrated into a P2P architecture that is cloud provider independent, thus allowing the auto-scaling of services over multiple cloud infrastructures at the same time. Our simulations, which are based on real service traces, show that our approach is capable of: (i) keeping the overall utilization of all the instantiated cloud resources in a target range, (ii) maintaining service response times close to the ones obtained using optimal centralized auto-scaling approaches.Comment: Submitted to Springer Computin
    corecore