A ROOT/IO Based Software Framework for CMS

The implementation of persistency in the Compact Muon Solenoid (CMS) Software Framework uses the core I/O functionality of ROOT. We will discuss the current ROOT/IO implementation, its evolution from the prior Objectivity/DB implementation, and the plans and ongoing work for the conversion to "POOL", provided by the LHC Computing Grid (LCG) persistency project

Reynolds v. Tufenkjian, 136 Nev. Adv. Op. 19 (Apr. 9, 2020)

The Court considered whether a party who purchased a judgment debtor’s rights of action could motion the Court to substitute themselves in as the real party in interest and dismiss the appeal. The Court held that only “things in action” that are otherwise assignable may be subject to execution to satisfy a judgment. The Court concluded that tort claims for personal injury—including fraud/intentional misrepresentation and elder exploitation—are generally not assignable. The Court further concluded that tort claims for injury to property and contract-based claims, unless the claims are personal in nature, are generally assignable. Therefore, the Court granted the respondents’ motion in part and the appeal was dismissed in part

A distributed file service based on optimistic concurrency control

The design of a layered file service for the Amoeba Distributed System is discussed, on top of which various applications can easily be intplemented. The bottom layer is formed by the Amoeba Block Services, responsible for implementing stable storage and repficated, highly available disk blocks. The next layer is formed by the Amoeba File Service which provides version management and concurrency control for tree-structured files. On top of this layer, the appficafions, ranging from databases to source code control systems, determine the structure of the file trees and provide an interface to the users

An overview of the Amoeba distributed operating system

As hardware prices continue to drop rapidly, building large computer systems by interconnecting substantial numbers of microcomputers becomes increasingly attractive. Many techniques for interconnecting the hardware, such as Ethernet [Metcalfe and Boggs, 1976], ring nets [Farber and Larson, 1972], packet switching, and shared memory are well understood, but the corresponding software techniques are poorly understood. The design of general purpose distributed operating systems is one of the key research issues for the 1980s

A Tutorial on Algol 68

This paper is an introduction to the main features of ALGOL 68, emphasizing the novel features not found in many other programming languages. The topics, data types (modes), type conversion (coercion), generalized expressions (units), procedures, operators, the standard prelude, and input/output, form the basis of the paper. Th

Multi-brand hospitality operations branding strategies

The purpose of this professional paper is to identify the optimal brand architecture for MGM MIRAGE’s Project CityCenter through synthesis of a review of branding strategies throughout the hospitality industry and a review of Project CityCenter’s goals. As Project CityCenter represents such a massive undertaking from both a financial and marketing perspective, a review of strategies external to MGM MIRAGE is critical; this paper endeavors to highlight branding strategies for potential adoption at Project CityCenter. The project’s significance is affirmed by Terri Lanni, Chairman and CEO of MGM MIRAGE, “Project CityCenter confirms a cultural and lifestyle revival of city living, reaffirms the growing sophistication and maturity of Las Vegas and sets a benchmark for new growth and exciting new experiences as the city moves into the next 100 years” (World Class Architects, 2005)

Distributed Programming with Shared Data

Until recently, at least one thing was clear about parallel programming: tightly coupled (shared memory) machines were programmed in a language based on shared variables and loosely coupled (distributed) systems were programmed using message passing. The explosive growth of research on distributed systems and their languages, however, has led to several new methodologies that blur this simple distinction. Operating system primitives (e.g., problem-oriented shared memory, Shared Virtual Memory, the Agora shared memory) and languages (e.g., Concurrent Prolog, Linda, Emerald) for programming distributed systems have been proposed that support the shared variable paradigm without the presence of physical shared memory. In this paper we will look at the reasons for this evolution, the resemblances and differences among these new proposals, and the key issues in their design and implementation. It turns out that many implementations are based on replication of data. We take this idea one step further, and discuss how automatic replication (initiated by the run time system) can be used as a basis for a new model, called the shared data-object model, whose semantics are similar to the shared variable model. Finally, we discuss the design of a new language for distributed programming, Orca, based on the shared data-object model. 1