A newin situ external sorting algorithm, to be calledExtquick, is developed and its time and space performance are analysed. It is shown that Extquick performs more efficiently than similarin situ sorting algorithms b...
详细信息
A newin situ external sorting algorithm, to be calledExtquick, is developed and its time and space performance are analysed. It is shown that Extquick performs more efficiently than similarin situ sorting algorithms based on Quicksort that appear in the literature. Since the computational tree of Quicksort-like sorting algorithms is equivalent to a search tree, techniques that model the time complexity of such a structure are then used for the analysis of Extquick.
This paper presents a dependent-chance goal programming (DCGP) and gives a successive factoring method to solve DCGP. We also discuss the application of DCGP in Qinhuangdao region for water supply and allocation.
This paper presents a dependent-chance goal programming (DCGP) and gives a successive factoring method to solve DCGP. We also discuss the application of DCGP in Qinhuangdao region for water supply and allocation.
File update programs, such as the UNIX make command are invaluable, but enigmatic. They are difficult to write because the repercussions of an algorithmic variation can be elusive. Even experienced users often specify...
详细信息
File update programs, such as the UNIX make command are invaluable, but enigmatic. They are difficult to write because the repercussions of an algorithmic variation can be elusive. Even experienced users often specify file relationships incorrectly, and are occasionally surprised by the tool's behavior. This paper develops a rigorous conceptual model and employs it to answer some of the questions facing writers and users of file update tools. Coupled with empirical data about makefiles, these results motivate a conceptually simple update program.
We present a mechanism of modified Petri nets, the resource Petri nets, which are the basis of the control algorithm for the operating system of multiprocessor servers. This mechanism allows us to efficiently perform ...
详细信息
We present a mechanism of modified Petri nets, the resource Petri nets, which are the basis of the control algorithm for the operating system of multiprocessor servers. This mechanism allows us to efficiently perform task monitoring.
In this paper a recent result of Baskett, Chandy, Muntz, and Palacios is generalized to the case in which customer transitions are characterized by more than one closed Markov chain. Generating functions are used to d...
详细信息
In this paper a recent result of Baskett, Chandy, Muntz, and Palacios is generalized to the case in which customer transitions are characterized by more than one closed Markov chain. Generating functions are used to derive closed-form solutions to stability, normalization constant, and marginal distributions. For such a system with N servers and L chains the solutions are considerably more complicated than those for systems with one subchain only. It is shown how open and closed subchains interact with each other in such systems. Efficient algorithms are then derived from our generating function representation.
We consider a particular type of sorting where objects having the same weight go to the same destination. We call it regular fusion-sorting. We show that if in a sorting network built with sorting cells, we replace th...
详细信息
We consider a particular type of sorting where objects having the same weight go to the same destination. We call it regular fusion-sorting. We show that if in a sorting network built with sorting cells, we replace these cells by regular fusion-sorting cells, then the network becomes a regular fusion-sorting network. We give some applications, as the extraction of sets from multisets, occurrence counting in lists of objects, multiconnection networks.
Nowadays, many kinds of computer network data management systems have been built widely in China. People have realized widely that management information system (MIS) has brought a revolution to the management mechani...
详细信息
Nowadays, many kinds of computer network data management systems have been built widely in China. People have realized widely that management information system (MIS) has brought a revolution to the management mechanism. Moreover, the managers of company need wide-range and comprehensive decision information more and more urgently which is the character of information explosion era. The needs of users become harsher and harsher in the design of MIS, and these needs have brought new problems to the general designers of MIS. Furthermore, the current method of traditional database development can't solve so big and complex problems of wide-range and comprehensive information processing. This paper proposes the adoption of parallel processing mode, the built of new decision support system (DSS) is to discuss and analyze the problems of information collection, processing and the acquirement of full-merit information with cross-domain and cross-VLDB (very-large database).
In this paper the concept for a software environment for developing engineering application systems for multiprocessor hardware (MIMD) is presented. The philosophy employed is to solve the largest problems possible in...
详细信息
In this paper the concept for a software environment for developing engineering application systems for multiprocessor hardware (MIMD) is presented. The philosophy employed is to solve the largest problems possible in a reasonable amount of time, rather than solve existing problems faster. In the proposed environment most of the problems concerning parallel computation and handling of large distributed data spaces are hidden from the application program developer, thereby facilitating the development of large-scale software applications. Applications developed under the environment can be executed on a variety of MIMD hardware; it protects the application software from the effects of a rapidly changing MIMD hardware technology.
This paper addresses the following question: What is the complexity of sorting n numbers x 1 ,…, x n (by comparisons), if it is known in advance that x 1 ,…, x n are all sums of up to d out m numbers (n= Σ 0⩽s⩽d m ...
详细信息
This paper addresses the following question: What is the complexity of sorting n numbers x 1 ,…, x n (by comparisons), if it is known in advance that x 1 ,…, x n are all sums of up to d out m numbers (n= Σ 0⩽s⩽d m s ) ? A lower bound due to Fredman concerning “Sorting X + Y ” is extended to the following result: Let d ⩾ 2 be fixed, n , m as above. Then every comparison tree for n inputs that sorts all inputs of the form ( Σ rϵS w r ∣ S ⊆ {1,…, m }, ∣ S ∣ ⩽ d ), for w ϵ R m , has depth Ω(m d ) = ϵ(n) . This lower bound is optimal. Furthermore, the case of sorting all subset sums of a vector is considered ( d = m ): Let n = 2 m . Then every comparison tree for n inputs that sorts all inputs of the form (Σ rϵS w r ∣S ⊆ {1,…,m}), w ϵ R m , has depth ⩾ 2 ⌞ m 3 ⌟ = Ω(n 1 3 . This lower bound is exponentially larger than those previously known for this problem.
Introductory principles of program performance in virtual storage have been presented to give a perspective of the virtual environment for systems designers and programmers. It is recognized that the list of guideline...
详细信息
Introductory principles of program performance in virtual storage have been presented to give a perspective of the virtual environment for systems designers and programmers. It is recognized that the list of guidelines presented is not comprehensive as many more useful techniques will be developed as experience is gained with virtual storage systems. It is hoped that these program design considerations and the programming guidelines will assist these users in their future virtual storage program development.
暂无评论