This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource u...This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization,reduce job response time and simplify programming.展开更多
Global property is the necessary condition which must be satisfied by the provable formulas. It can help to find out some unprovable formula that does not satisfy some global property before proving it using formal au...Global property is the necessary condition which must be satisfied by the provable formulas. It can help to find out some unprovable formula that does not satisfy some global property before proving it using formal automated rea-soning systems, thus the efficiency of the whole system is improved. This paper presents some global properties of valid formulas in modal logic K. Such prop-erties are structure characters of formulas, so they are simple and easy to check.At the same time, some global properties of K unsatisfiable formula set are also given.展开更多
A key issue of dynamic load balancing in a loosely coupled distributed systemis selecting appropriate jobs to transfer. In this paper, a job selection policybased on on-line predicting behaviors of jobs is proposed. T...A key issue of dynamic load balancing in a loosely coupled distributed systemis selecting appropriate jobs to transfer. In this paper, a job selection policybased on on-line predicting behaviors of jobs is proposed. Thacing is used atthe beginning of execution of a job to predict the approkimate execution timeand resource requirements of the job so as to make a correct decision aboutwhether transferring the job is worthwhile. A dynamic load balancer using thejob selection policy has been implemelited. Experimelital measurement resultsshow that the policy proposed is able to improve mean response time of jobsand resource utilization of systems substantially.展开更多
A consistent checkpointing algorithm with short freezing time (SFT) is presented in this paper. It supports fault-tolerance in distributed systems. The algorithm has shorter freezing time, lower overhead, and simplici...A consistent checkpointing algorithm with short freezing time (SFT) is presented in this paper. It supports fault-tolerance in distributed systems. The algorithm has shorter freezing time, lower overhead, and simplicity of recovery. To make checkpoint time shorter, a special control message (Munblock) is used to ensure that a process can respond the checkpoint event quickly at any given time. Moreover, main memory algorithm is used to improve the concurrency of checkpointing. By using SFT, the freezing time resulted by checkpointing is less than 0.03s. Furthermore, the control message number of SFT is only O(n).展开更多
The management of memory coherence is an important problem in distributed shared memory (DSM) system. In a cache-based coherence DSM system using linked list structure, the key to maintaining the coherence and improvi...The management of memory coherence is an important problem in distributed shared memory (DSM) system. In a cache-based coherence DSM system using linked list structure, the key to maintaining the coherence and improving system performance is how to manage the owner in the linked list. This paper presents the design of a new management protocol-NONH (New-OwnerNew-Head) and its performance evaluation. The analysis results show that thisprotocol can improve the scalability and performence of a coherent DSM system using linked list. It is also suitable for managing the cache coherency in tree-like hierarchical architecture.展开更多
The relation between generalized resolution and NC-resolution is discussed. The proof of the completeness of NC linear resolution is then given. The incompleteness of NC lock resolution is also presented, thus the con...The relation between generalized resolution and NC-resolution is discussed. The proof of the completeness of NC linear resolution is then given. The incompleteness of NC lock resolution is also presented, thus the conclusion in [3] of' a simple completeness- preserving restriction' is shown to be wrong.展开更多
Based on the previous work, some necessary conditions of the two-level Uncertainty Reasoning Model (URM) are proposed and an improvement on the twcalevel Uan is made that can describe and process the deviation. In add...Based on the previous work, some necessary conditions of the two-level Uncertainty Reasoning Model (URM) are proposed and an improvement on the twcalevel Uan is made that can describe and process the deviation. In addition, the paper presents two theorems for specifying the correctness about the improvement. Finally, the application of the twrvlevel URM is discussed.展开更多
In this paper we consider the problem of sequential processing and present a sequen-tial model based on the back-propagation algorithm. This model is intended to deal with intrinsically sequential problems, such as wo...In this paper we consider the problem of sequential processing and present a sequen-tial model based on the back-propagation algorithm. This model is intended to deal with intrinsically sequential problems, such as word recognition, speech recognition,natural language understanding. This model can be used to train a network to learn the sequence of input patterns, in a fixed order or a random order. Besides, this mod-el is open- and partial-associative, characterized as 'recognizing while accumulating',which, as we argue, is mental cognition process oriented.展开更多
A kind of classification on temporal relations of propositions is presented.By introducing temporal approaching relation, a new temporal logic based ontime-point and time-interval is proposed, which can describe uncer...A kind of classification on temporal relations of propositions is presented.By introducing temporal approaching relation, a new temporal logic based ontime-point and time-interval is proposed, which can describe uncertain temporalrelations. Finally some properties of temporal proposition under.uncertainrelations are proposed.展开更多
摘要This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization,reduce job response time and simplify programming.
摘要Global property is the necessary condition which must be satisfied by the provable formulas. It can help to find out some unprovable formula that does not satisfy some global property before proving it using formal automated rea-soning systems, thus the efficiency of the whole system is improved. This paper presents some global properties of valid formulas in modal logic K. Such prop-erties are structure characters of formulas, so they are simple and easy to check.At the same time, some global properties of K unsatisfiable formula set are also given.
摘要A key issue of dynamic load balancing in a loosely coupled distributed systemis selecting appropriate jobs to transfer. In this paper, a job selection policybased on on-line predicting behaviors of jobs is proposed. Thacing is used atthe beginning of execution of a job to predict the approkimate execution timeand resource requirements of the job so as to make a correct decision aboutwhether transferring the job is worthwhile. A dynamic load balancer using thejob selection policy has been implemelited. Experimelital measurement resultsshow that the policy proposed is able to improve mean response time of jobsand resource utilization of systems substantially.
基金the National Natural Science Foundation of China !69673012
摘要A consistent checkpointing algorithm with short freezing time (SFT) is presented in this paper. It supports fault-tolerance in distributed systems. The algorithm has shorter freezing time, lower overhead, and simplicity of recovery. To make checkpoint time shorter, a special control message (Munblock) is used to ensure that a process can respond the checkpoint event quickly at any given time. Moreover, main memory algorithm is used to improve the concurrency of checkpointing. By using SFT, the freezing time resulted by checkpointing is less than 0.03s. Furthermore, the control message number of SFT is only O(n).
摘要The management of memory coherence is an important problem in distributed shared memory (DSM) system. In a cache-based coherence DSM system using linked list structure, the key to maintaining the coherence and improving system performance is how to manage the owner in the linked list. This paper presents the design of a new management protocol-NONH (New-OwnerNew-Head) and its performance evaluation. The analysis results show that thisprotocol can improve the scalability and performence of a coherent DSM system using linked list. It is also suitable for managing the cache coherency in tree-like hierarchical architecture.
摘要The relation between generalized resolution and NC-resolution is discussed. The proof of the completeness of NC linear resolution is then given. The incompleteness of NC lock resolution is also presented, thus the conclusion in [3] of' a simple completeness- preserving restriction' is shown to be wrong.
摘要Based on the previous work, some necessary conditions of the two-level Uncertainty Reasoning Model (URM) are proposed and an improvement on the twcalevel Uan is made that can describe and process the deviation. In addition, the paper presents two theorems for specifying the correctness about the improvement. Finally, the application of the twrvlevel URM is discussed.
摘要In this paper we consider the problem of sequential processing and present a sequen-tial model based on the back-propagation algorithm. This model is intended to deal with intrinsically sequential problems, such as word recognition, speech recognition,natural language understanding. This model can be used to train a network to learn the sequence of input patterns, in a fixed order or a random order. Besides, this mod-el is open- and partial-associative, characterized as 'recognizing while accumulating',which, as we argue, is mental cognition process oriented.
摘要A kind of classification on temporal relations of propositions is presented.By introducing temporal approaching relation, a new temporal logic based ontime-point and time-interval is proposed, which can describe uncertain temporalrelations. Finally some properties of temporal proposition under.uncertainrelations are proposed.