39305576
Adaptive real-time resource management supporting composition of independently authored time-critical services
This paper describes ongoing investigations at Microsoft Research into algorithms for adaptive real-time scheduling and resource management. We are implementing a system which will allow sets of independently authored real-time applications to be scheduled, providing both initial resource negotiation and dynamic feedback to applications about their resource consumption. Instead of relying on human beings to pre-compute scheduling and resource requirements, applications will be able to dynamically adapt their run-time behavior to the resources available. Under overload conditions, user preferences and policies will be applied in order to bring the total resource requirements within available resources. This will permit chosen applications to continue executing perfectly even while others execute with dynamically renegotiated resource grants or are gracefully shut down, as per user preferences. We believe that this approach will lead to real-time scheduling and resource management algorithms which are appropriate for workstation and home multi-media environments.<<ETX>>
15786317
Bringing the C Libraries With Us into a Multi-Threaded Future
Textile materials such as fiber and cloth can be dyed more satisfactorily with sulfur dyes or sulfurized vat dyes by allowing an organic mercapto compound and/or an organic sulfur compound capable of generating mercapto groups under dyeing conditions to be present in dye baths. Still more improved dyeing results may be obtained by allowing a sulfite salt compound to be further present in such dye baths.
9095312
Overlook: scalable name service on an overlay network
This paper indicates that a scalable fault-tolerant name service can be provided utilizing an overlay network and that such a name service can scale along a number of dimensions: it can be sized to support a large number of clients, it can allow large numbers of concurrent lookups on the same name or sets of names, and it can provide name lookup latencies measured in seconds. Furthermore, it can enable updates to be made pervasively visible in times typically measured in seconds for update rates of up to hundreds per second. We explain how many of these scaling properties for the name service are obtained by reusing some of the same mechanisms that allowed the underlying overlay network to scale. Finally, we observe that the overlay network is sensitive to bandwidth and CPU limitations.
6816342
SkipNet: A Scalable Overlay Network with Practical Locality Properties
Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry have recently emerged as flexible infrastructure for building large peer-to-peer systems. In practice, such systems have two disadvantages: They provide no control over where data is stored and no guarantee that routing paths remain within an administrative domain whenever possible. SkipNet is a scalable overlay network that provides controlled data placement and guaranteed routing locality by organizing data primarily by string names. SkipNet allows for both fine-grained and coarse-grained control over data placement: Content can be placed either on a pre-determined node or distributed uniformly across the nodes of a hierarchical naming sub-tree. An additional useful consequence of SkipNet's locality properties is that partition failures, in which an entire organization disconnects from the rest of the system, can result in two disjoint, but well-connected overlay networks.
9636203
Two case studies in predictable application scheduling using Rialto/NT
This paper analyzes the results of two case studies in applying the Rialto/NT scheduler to real Windows 2000 applications. The first study is of a soft modem-a modem whose signal processing work is performed on the host CPU, rather than on a dedicated signal processing chip. The second is of an audio player application. Both of these are frequently used real-time applications-ones running on systems that were not designed to support predictable real-time execution. To function correctly, both applications require that ongoing computations be performed in a timely manner. In both cases, we first measured an original version designed to run on Windows 2000, and then modified the application to take advantage of ongoing CPU reservations provided by the Rialto/NT scheduler. We report on the benefits and problems observed when using reservations in these real-world scenarios. In both cases, we found that a real-time scheduler can provide the needed predictability for the application in the presence of competing applications, while also providing other benefits, such as minimizing the soft modem's impact on the scheduling predictability of other computations in the system. We also describe the methodologies we used to analyze the real-time behavior of the operating system and applications during these studies, including the use of instrumented kernels to produce execution traces.
17732369
Predictability requirements of a soft modem
Soft Modems use the main processor to execute modem functions traditionally performed by hardware on the modem card. To function correctly, soft modems require that ongoing signal processing computations be performed on the host CPU in a timely manner. Thus, signal processing is a commonly occurring background real-time application---one running on systems that were not designed to support predictable real-time execution. This paper presents a detailed study of the performance characteristics and resource requirements of a popular soft modem. Understanding these requirements should inform the efforts of those designing and building operating systems needing to support soft modems. Furthermore, we believe that the conclusions of this study also apply to other existing and upcoming soft devices, such as soft Digital Subscriber Line (DSL) cards. We conclude that (1) signal processing in an interrupt handler is not only unnecessary but also detrimental to the predictability of other computations in the system and (2) a real-time scheduler can provide predictability for the soft modem while minimizing its impact on other computations in the system.
38777515
Mobile interaction design tutorial
The tutorial explores interesting and empowering mobile design philosophies, principles and methods as well as giving specific guidance on key emerging consumer application areas such as image browsing and information access.
153985
Facial Reconstruction Using Volumetric Data
In this paper we demonstrate computer aided techniques in the area of the reconstruction of facial features from skeletal remains. We outline the desired features of a system for skull identification, and demonstrate our progress in the area which builds upon our previous work on distance fields for volumetric data. In addition to the application we demonstrate an accurate 3D closing operator in practise on large data sets, cross correlation for automatic feature detection, and the current output from the technique which uses a 2D warp of the 3D distance field.
1777796
A System for the Non-Linear Modelling of Deformable Procedural Shapes
This paper describes a fully interactive modelling system, which we have called ClayWorks, for defining the implicit geometry of 3D objects using parametric base primitives and deformations. The goal of this system is to provide a means for describing object data and its creation history by using a series of parametric steps that can be modified post-creation in a non-linearmanner. The advantages of this approach are that unlike other modelling approaches, it enables compact object descriptions, an intuitive modelling process, a simple approach to multiresolution objects, real-time feedback during the modelling process and a render independent object representation.
6934253
Shape representation using space filled sub-voxel distance fields
Voxelisation is the process of converting a source object of any data type into a three-dimensional grid of voxel values. This voxel grid should represent the original object as closely as possible, although some inaccuracies will occur due to the discrete nature of the voxel grid representation. In this paper we report our ongoing research into methods for representing objects as voxelised distance fields, in particular we report fast methods for accurate distance field production. A review of current alternative voxelisation methods is also given.
43107545
A Theory of Qualified Types
Abstract This paper describes a general theory of overloading based on a system of qualified types. The central idea is the use of predicates in the type of a term, restricting the scope of universal quantification. A corresponding semantic notion of evidence is introduced and provides a uniform framework for implementing applications of this system, including Haskell style type classes, extensible records and subtyping. Working with qualified types in a simple, implicitly typed, functional language, we extend the Damas-Milner approach to type inference. As a result, we show that the set of all possible typings for a given term can be characterized by a principal type scheme, calculated by a type inference algorithm.