205046494
Run-time support For parallel functional programming on shared-memory multiprocessors
Abstract The use of functional languages for parallel computing has been proposed for many years. Many functional languages were developed along with the design of new architectures such as data flow and reduction machines. In this article, we present a general model of a run-time system for a parallel functional language called SISAL, to be executed on shared-memory multiprocessors. The implementation of this run-time system is examined on two radically different architectures: a 32-way (symmetrical) VAX Research Multiprocessor M31 and a 4-way Cray X-MP system. To properly evaluate the effectiveness of SISAL on shared-memory multiprocessors, we suggest further research explore an interactive visual control mechanism that dynamically shows run-time behavior.
14420598
A component-based approach for JavaCard runtime system development
In recent years a lot of research efforts have been directed towards component-based approach in the development of embedded operating systems. This allows the system to easily adapt itself to different hardware chips and various embedded application subsystems. Most of the existing research on component-based embedded system development is directed towards adapting the system to different hardware chips. However, this approach is not sufficient to port the system from one embedded application to another. In this research we will address the importance of component-based design at the application domain and runtime environment level of embedded systems. Since JavaCard is gaining importance in SmartCard embedded systems, we will design a component-based Java Card Runtime Environment and Application Subsystem. Our approach will enable easy configuration of the system to support Java Card, EMV-compliant card and various other smartcard embedded applications. Our research will demonstrate that the component-based approach allows the embedded operating system to easily port itself to other resource-constrained devices such as cell phones and other embedded system application with relative ease.
3500682
Kernels in planar digraphs
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has an out-neighbor in S. We show that there exist O(n2^1^9^.^1^k+n^4)-time and O(k^3^6+2^1^9^.^1^kk^9+n^2)-time algorithms for checking whether a planar digraph D of order n has a kernel with at most k vertices. Moreover, if D has a kernel of size at most k, the algorithms find such a kernel of minimal size.
38028125
Lover's cups: drinking interfaces as new communication channels
This paper shows how computer interfaces can enhance common activities and use them as communication method between people. In this paper, the act of drinking is used as an input of remote communication with the support of computer interfaces. We present Lover's Cups which enable people to share the time of drinking with someone they care about in different places. Using a wireless connection, an otherwise ordinary pair of cups becomes a communication device, amplifying the social aspect of drinking behavior.
42435746
Efficiently supporting hard/soft deadline transactions in real-time database systems
As in other application areas, there is an increasing need for managing a large amount of data in the real-time area. This need gave birth to a system called a real-time database system (RTDBS) that provides database operations with timing constraints. One typical timing constraint in an RTDBS is temporal consistency that states that a transaction must read temporally valid data objects. This requires the data objects to be updated repeatedly. This paper proposes three novel schemes that aim to minimize the number of updates of data objects needed for guaranteeing the temporal consistency requirements of transactions with hard-deadlines. The three guarantee schemes differ from each other in the amount of updates and the implementation complexity. This paper also gives a framework for integrating transactions with soft-deadlines into the three guarantee schemes.
31179959
Improving location management for mobile users with frequently visited locations
Abstract In wireless computing environment, users’ mobility brings new challenges to traditional computing systems. The explosive growth of demand in communication bandwidth requires new schemes to effectively and efficiently locate users. The Basic HLR/VLR locating scheme does not exploit the fact that many mobile users’ (such as commuters’) moving patterns are likely to be known. In this paper, we propose one locating scheme, the frequently visited locations first (FVLF) scheme, to efficiently locate a mobile user. The FVLF scheme is proposed to prestore the RAs that a mobile user frequently visits according to the probabilities of the RAs that the mobile user may appear. When the system receives a call, these prestored RAs are examined first to locate the callee. This scheme can avoid the high cost of querying the callee’s HLR. The cost model of the proposed scheme is derived and the optimal number of prestored RAs is also found. Our evaluation shows that benefit does exist in various conditions by using this scheme.
40821829
Service class based online QoS management in surveillance radar systems
Many application level qualities are functions of available computation resources. Recent studies have handled the computation resource allocation problem to maximize the overall application quality. However such QoS problem is fundamentally a multi-dimensional optimization problem that requires extensive computation. Therefore, online usage of optimization procedures may significantly reduce the computation resource available for applications. This raises the question of how to best use the optimization procedures for dynamic real-time task sets. This paper proposes a method called service classes configuration to address the QoS problem with dynamic arrival and departure of tasks. A simplified radar application is used as an illustrative example.