PATENT ELIGIBILITY STANDARD FOR NETWORK ARCHITECTURE PATENTS UNDER THE FEDERAL CIRCUIT’S JURISPRUDENCE

PATENT ELIGIBILITY STANDARD FOR NETWORK ARCHITECTURE PATENTS UNDER THE FEDERAL CIRCUIT’S JURISPRUDENC

A scalable architecture for real-time monitoring of large information systems

Data centers supporting cloud-based services are characterized by a huge number of hardware and software resources often cooperating in complex and unpredictable ways. Understanding the state of these systems for reasons of management and service level agreement requires scalable monitoring architectures that should gather and evaluate continuosly large flows in almost real-time periods. We propose a novel monitoring architecture that, by combining a hierarchical approach with decentralized monitors, addresses these challenges. In this context, fully centralized systems do not scale to the required number of flows, while pure peer-to-peer architectures cannot provide a global view of the system state. We evaluate the monitoring architecture for computational units of gathering and evaluation in real contexts that demonstrate the scalability potential of the proposed system

Monitoring large cloud-based systems

Large scale cloud-based services are built upon a multitude of hardware and software resources, disseminated in one or multiple data centers. Controlling and managing these resources requires the integration of several pieces of software that may yield a representative view of the data center status. Today’s both closed and open-source monitoring solutions fail in different ways, including the lack of scalability, scarce representativity of global state conditions, inability in guaranteeing persistence in service delivery, and the impossibility of monitoring multi-tenant applications. In this paper, we present a novel monitoring architecture that addresses the aforementioned issues. It integrates a hierarchical scheme to monitor the resources in a cluster with a distributed hash table (DHT) to broadcast system state information among different monitors. This architecture strives to obtain high scalability, effectiveness and resilience, as well as the possibility of monitoring services spanning across different clusters or even different data centers of the cloud provider. We evaluate the scalability of the proposed architecture through a bottleneck analysis achieved by experimental results

Temporal Localization of Error Recovery in Operating Systems by Restricting Information Flow

This study focuses on how to confine error recovery to the immediate environment of a failed computation (process) by restricting information flow through the system. A module called a manager that restricts the access of operations (procedures) to shared data representation is proposed. The use of descriptors to represent address variables (pointers) and procedure parameters is also proposed to restrict the amount of information available to a procedure. A linguistic mechanism to define recoverable data and inverse procedures (procedures that reverse the actions of another procedure) to undo completed actions is presented. A system data structure that defines a recovery environment to support system implemented recovery is presented.Computing and Information Scienc

The application of message passing to concurrent programming

The development of concurrency in computer systems will be critically reviewed and an alternative strategy proposed. This is a programming language designed along semantic principles, and it is based upon the treatment of concurrent processes as values within that language's universe of discourse. An asynchronous polymorphic message system is provided to enable co-existent processes to communicate freely. This is presented as a fundamental language construct, and it is completely general purpose, as all values, however complex, can be passed as messages. Various operations are also built into the language so as to permit processes to discover and examine one another. These permit the development of robust systems, where localised failures can be detected, and action can be taken to recover. The orthogonality of the design is discussed and its implementation in terms of an incremental compiler and abstract machine interpreter is outlined in some detail. This thesis hopes to demonstrate that message-oriented communication in a highly parallel system of processes is not only a natural form of expression, but is eminently practical, so long as the entities performing the communication are values in the languag