The tool described here is the first part of a tool set called GROOVE (GRaphbased Object-Oriented VErification) for software model checking of objectoriented systems. The special feature of GROOVE, which sets it apart from other model checking approaches, is that it is based on graph transformations. It uses graphs to represent state snapshots; transitions arise from the application of graph pr...

Analyzing systems communicating asynchronously via reliable FIFO buffers is an undecidable problem. A typical approach is to check whether the system is bounded, and if not, the corresponding state space can be made finite by limiting the presence of communication cycles in behavioral models or by fixing the buffer size. In this paper, our focus is on systems that are likely to be unbounded and...

In this paper, we present an accurate and fast algorithm for maximizing profits through buffer size optimization for production lines. We consider both buffer space cost and average inventory cost with distinct cost coefficients for different buffers, and we include a nonlinear production rate constraint. To solve the problem, a corresponding unconstrained problem is introduced and a nonlinear ...

This article first reviews the architecture of a typical ATM switch and considers the problem of handling both continuous bit oriented and bursty traffic with low loss and delay requirements. We examine a buffer architecture that is capable of handling both delay sensitive and loss sensitive traffic, and present a scheme to allocate network resources, i.e. bandwidth and buffer space, to individ...

A mechanism for message delivery is at the core of any implementation of Message-Passing Interface (MPI) [1]. In a distributed memory computer, shared or not, it is most feasible to synchronize messages in the local memory of the destination process. Accordingly, the initial step in message delivery is for the source process to transmit a message envelope a small packet containing synchronizati...

This paper presents a broad, pathfinding design space exploration of memory management units (MMUs) for heterogeneous systems. We consider a variety of designs, ranging from accelerators tightly coupled with CPUs (and using their MMUs) to fully independent accelerators that have their own MMUs. We find that regardless of the CPUaccelerator communication, accelerators should not rely on the CPU ...

This paper considers the question of how effective caches are in processing network I/O. Our analysis shows that operating system structure plays a key role in the caches behavior, with BSD Unix (a monolithic OS) making more effective use of the cache than Mach (a microkernel OS). Moreover, closer inspection shows that several factors contribute to this result, including how TLBs are managed, h...

Application virtual address space is divided into pages, each requiring a virtual-to-physical translation in the page table and the TLB. Large working sets, common among modern applications, necessitate a lot of translations, which increases memory consumption and leads to high TLB and page fault rates. To address this problem, recent hardware introduced support for large pages. Large pages req...

We searched for a method for obtaining a sintered bulk sample of single-phase Sr2MoO4, which has recently increased its importance for similarities to superconducting Sr2RuO4. We discovered that with the aid of Ti2O3 as a p(O2) buffer, high-purity Sr2MoO4 is successfully synthesized in a sealed tube. We confirmed the space group and determined the exact elemental composition of the compound and...

This paper describes a real-time shadow generation algorithm for polygonal environments illuminated by movable point light sources. The main goal is to quickly reduce the number of hidden shadow volumes, by using a technique of volumetric shadow rendering using stencil buffers with a modified BSP tree, i.e. a simplified version of a SVBSP (Shadow Volume BSP) tree. It also provides new easy-to-i...