An execution program is considered that supervises the cooperating tasks between independently running microcomputers. The supervisor consists of three main parts: the management of tasks, communication, and storage.
An execution program is considered that supervises the cooperating tasks between independently running microcomputers. The supervisor consists of three main parts: the management of tasks, communication, and storage.
This article reports on the design and use of a computer system to aid bibliographic database searchers in the post-search, analysis phase of their work. The major task addressed is the determination of relevance of d...
详细信息
This article reports on the design and use of a computer system to aid bibliographic database searchers in the post-search, analysis phase of their work. The major task addressed is the determination of relevance of downloaded abstracts. Aids for the individual review of abstracts and for the automatic determination of relevance are described. The system, called SORT-AID, runs on a personal computer and is in use at several NASA technology transfer installations.
A notion of type assignment on Curryfied Term Rewriting systems is introduced that uses Intersection Types of Rank 2, and in which all function symbols are assumed to have a type. Type assignment will consist of speci...
详细信息
A notion of type assignment on Curryfied Term Rewriting systems is introduced that uses Intersection Types of Rank 2, and in which all function symbols are assumed to have a type. Type assignment will consist of specifying derivation rules that describe how types can be assigned to terms, using the types of function symbols. Using a modified unification procedure, for each term the principal pair (of basis and type) will be defined in the following sense: from these all admissible pairs can be generated by chains of operations on pairs, consisting of the operations substitution, copying, and weakening. In general, given an arbitrary typeable qqTRS, the subject reduction property does not hold. Using the principal type for the left-hand side of a rewrite rule, a sufficient and decidable condition will be formulated that typeable rewrite rules should satisfy in order to obtain this property.
A programming notation is introduced to describe the behavior of groups of parallel processes, communicating with each other over a network of named channels. An assertion is a predicate with free channel names, each ...
详细信息
A programming notation is introduced to describe the behavior of groups of parallel processes, communicating with each other over a network of named channels. An assertion is a predicate with free channel names, each of which stands for the sequence of values which have been communicated along that channel up to some moment in time. A process invariantly satisfies an assertion if that assertion is true before and after each communication by that process. A system of inference rules is presented for proving that processes satisfy assertions, and their use is illustrated. The validity of the inference rules is established by constructing a model of the programming notation, and by proving each inference rule as a theorem about the model. Limitations of the model and proof system are discussed.
The plan matching problem is to determine whether a program plan is present in a program. This problem has been shown to be NP-hard, which makes it an open question whether plan matching algorithms can be developed th...
详细信息
The plan matching problem is to determine whether a program plan is present in a program. This problem has been shown to be NP-hard, which makes it an open question whether plan matching algorithms can be developed that scale sufficiently well to be useful in practice. This paper discusses experiments in the scalability of a series of constraint-based program plan matching algorithms we have developed. These empirical studies have led to significant improvements in the scalability of our plan matching algorithm, and they suggest that this algorithm can be successfully applied to large, real-world programs. (C) 2000 Elsevier Science B.V. All rights reserved.
作者：
FREDERIC.DHIBM CORP
THOMAS J WATSON RES CTRRES DIVYORKTOWN HEIGHTSNY 10598
Programmers are quite accustomed to describing data they use: where to find it, what devices are involved, the layout of the data, what to do with it after the job is complete, processing techniques employed, and ofte...
详细信息
Programmers are quite accustomed to describing data they use: where to find it, what devices are involved, the layout of the data, what to do with it after the job is complete, processing techniques employed, and often a great deal more. The reason data is so described is that, nowadays, programs call upon a great many other programs for assistance. All sorts of common-place functions that the programmer takes for granted are provided by other, already-written programs, that are invoked explicitly or implicitly by what the programmer himself writes. Thus programmers must describe things about their data to be able to use the functions provided.
Software for controlling hardware dedicated to applications in commercial transaction processing is described. Application programs written initially in a mnemonic language are translated to tables. The system operate...
详细信息
Software for controlling hardware dedicated to applications in commercial transaction processing is described. Application programs written initially in a mnemonic language are translated to tables. The system operates by tasks referring to these application tables being processing by a software processor which either interprets the instructions in the tables directly or issues tasks to other software processors which then perform the required *** software has been implemented on a Raytheon PTS100 mini-computer. A substantial suite of programs has been written for a sales order processing application which involves a network of these machines connected to each other and to a large ICL 1904A computer by telephone links.
We present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n integers of size polynomial in n in time O(log n) using O(n log log nlog n) processors. It is closer to optimality than any pre...
详细信息
We present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n integers of size polynomial in n in time O(log n) using O(n log log nlog n) processors. It is closer to optimality than any previously known deterministic algorithm that solves the stated restricted sorting problem in polylog time.
Recent publications suggest that use of decision tables in analysing conventional computer programs. In this paper, it is argued that the classical decision table format is not well suited to represent flow-chart-like...
详细信息
Recent publications suggest that use of decision tables in analysing conventional computer programs. In this paper, it is argued that the classical decision table format is not well suited to represent flow-chart-like *** alternative decision table conventions are investigated. Finally, a basic distinction is made between the use of decision tables in the problem statement phase and in programming.
In this paper, the design issues on a scaleable popularity independent video on demand (VOD) server which has been designed and implemented in Ajou University are discussed. The server with parallel architecture aims ...
详细信息
In this paper, the design issues on a scaleable popularity independent video on demand (VOD) server which has been designed and implemented in Ajou University are discussed. The server with parallel architecture aims to resolve a basic performance bottleneck, which has been encountered in the design steps of many other VOD servers. The performance degradation caused by the skew in video popularity becomes minimized through the realization of server-level striping. The server-level striping increases the scalability of server: the increase in performance follows closely the increase in number of video pumps. The communication and processing power overhead introduced by the parallel server architecture is relieved by a specially designed meshed pipeline type interconnection network. The design issues on the interconnection network and data placement policy are also addressed with empirical data. In the last part of this paper, the real-time operating system and the schedulers for video pump are described.
暂无评论