The authors investigate how adequate tools for concurrent programming may improve the development of real-time applications. First, any such application can be decomposed as a set of cooperating processes. Second, if ...
详细信息
ISBN:
(纸本)0818619562
The authors investigate how adequate tools for concurrent programming may improve the development of real-time applications. First, any such application can be decomposed as a set of cooperating processes. Second, if adequate architectural support is available, further parallelism of execution can be achieved on critical parts of the program. The model of concurrency, and the granularity of decomposition, which are best suited for meeting either objective, are shown to be different. Then, the problem of automatically decomposing critical sequential parts into parallel tasks is examined. An example is given, to illustrate the advantages of the proposed methodology, and an implementation strategy for its run-time support is outlined.
In a manner similar to T. T. Hopfield and D. W. Tank's implementation of the traveling salesman problem on a Hopfield net (Bio. Cybern. vol. 52, pp. 141-152, 1985), a Hopfield net is programmed to sort a list of a...
详细信息
In a manner similar to T. T. Hopfield and D. W. Tank's implementation of the traveling salesman problem on a Hopfield net (Bio. Cybern. vol. 52, pp. 141-152, 1985), a Hopfield net is programmed to sort a list of arbitrary positive numbers. A detailed derivation of the mathematical constraints is presented, from the general four-axis energy equation to the numerical simulations. Excellent results were obtained from the simulations for sorts on lists containing 4 to 10 evenly spaced integers. It was found that increasing the list size n or the spacing f caused the network to become increasingly sensitive to the two parameters C and D, but near-optimal values for these were found. Sorting is probably a considerably more practical use of neural nets than solving the traveling salesman problem since sorts are used extensively throughout many applications.
This paper describes the design and production of a comparatively brief, readily modifiable VAX/VMS reference guide used by faculty, student and staff on the University of Oregon's academic VAX Cluster.
ISBN:
(纸本)0897913302
This paper describes the design and production of a comparatively brief, readily modifiable VAX/VMS reference guide used by faculty, student and staff on the University of Oregon's academic VAX Cluster.
Address calculation sorting method is discussed by Kronmal & Tartar. Generally collision resolution is done by chaining, where the records are inserted in ordered linked lists with heads defined as array of pointe...
详细信息
ISBN:
(纸本)0897912993
Address calculation sorting method is discussed by Kronmal & Tartar. Generally collision resolution is done by chaining, where the records are inserted in ordered linked lists with heads defined as array of pointers. Then the linked lists are merged in the original array. For uniformly distributed lists and careful choice of a hash function the algorithm works quite efficiently and is faster than other sorting methods. Our comparisons show that the algorithms works more than twice as fast as Quick Sort. The disadvantage with this method is that it needs extra space for 2N records. Also it is not an in place sort. The algorithm discussed in this paper improves on both these counts. It uses less than N extra spaces on average. For uniformly distributed keys extra space is less than N/4. There are less than 2N record movement with this algorithm.
This paper describes the System Architects' Workbench, a personal computer-based teaching environment for courses in computer organization and systemsprogramming. This tool set provides an integrated learning and...
详细信息
This paper describes the System Architects' Workbench, a personal computer-based teaching environment for courses in computer organization and systemsprogramming. This tool set provides an integrated learning and teaching environment for computersystems concepts defined in ACM IS Curriculum '81 IS1. The central tool is a computer simulator based on a pedagogical model of computer system resources which allows students to study principles without becoming too involved in the implementation idiosyncrasies usually associated with machine-level programming. Programs may be written directly in machine language or in a Pascal-like language, TP, which includes features that allow complete access to and control of host-level resources. The TP compiler supports separate compilation, IPL load module generation, and detailed translation output used for machine language modification and debugging. The simulator supports interactive execution, tracing, modification, and debugging.
This conference proceedings contains 61 papers. The main subjects are programming language issues, actor-based systems, distributed programming, transactions, models and specification, program visualization, models fo...
详细信息
This conference proceedings contains 61 papers. The main subjects are programming language issues, actor-based systems, distributed programming, transactions, models and specification, program visualization, models for parallel programming, concurrency, process-oriented programming, concurrent data structures, distributed programming architecture, specification and design of complex systems, specifying concurrent objects, object-oriented operating systems, and object-based real-time programming.
A periodic sorting network consists of a sequence of identical blocks. In this paper, the periodic balanced sorting network, which consists of log n blocks, is introduced. Each block, called a balanced merging block, ...
详细信息
A periodic sorting network consists of a sequence of identical blocks. In this paper, the periodic balanced sorting network, which consists of log n blocks, is introduced. Each block, called a balanced merging block, merges elements on the even input lines with those on the odd input *** periodic balanced sorting network sorts n items in O([log n]2) time using (n/2)(log n)2 comparators. Although these bounds are comparable to many existing sorting networks, the periodic structure enables a hardware implementation consisting of only one block with the output of the block recycled back as input until the output is sorted. An implementation of our network on the shuffle exchange interconnection model in which the direction of the comparators are all identical and fixed is also presented.
A method for handprinted alphabetic data entry with a numeric keypad is proposed, where a letter is written with a finger on the touch-sensitive keypad serving as writing area. Such a device needs no additional space ...
详细信息
A method for handprinted alphabetic data entry with a numeric keypad is proposed, where a letter is written with a finger on the touch-sensitive keypad serving as writing area. Such a device needs no additional space and facilitates pattern recognition considerably. A nearest-neighbour classificator is chosen for pattern recognition and the number of prototypes is reduced by nonlinear matching of pattern and prototype vectors by means of dynamic programming. First experimental results show that only a short learning time is needed and that error rates of the user and the pattern recognition system are very low.
In 1979, G. K. Manacher showed that the Ford-Johnson sorting algorithm [FJA], acting on t real numbers, can be beaten for an infinite set of values t. These values form a partial cover of constant density not close to...
详细信息
In 1979, G. K. Manacher showed that the Ford-Johnson sorting algorithm [FJA], acting on t real numbers, can be beaten for an infinite set of values t. These values form a partial cover of constant density not close to 1 over an initial sequence of each band running from uk = ⌊(4/3)2k⌋ to uk+l - 1. This early result depended on showing that the Hwang-Lin merging algorithm [HLA], merging m elements with n, m ≠ n, could be surpassed by cm comparisons, where c is an arbitrary small positive *** this paper, it is shown that the FJA can be beaten for a set of integers of asymptotic density 1 under the greatly weakened assumption that the HLA can be surpassed by only (1/2 + ϵ)log m comparisons, with ϵ a small positive constant. The even weaker assumption that no improvement in the HLA exists, but that an isolated value to exists for which the FJA can be surpassed by only (1 + ϵ)log to comparisons yields the same result. Only for a set of “refractory” integers of size about t1/2 in the neighborhood of each uk does the FJA fail to be *** these results depend on a new technique for obtaining optimum sort-merge sequences for best-possible sorting given a merging method. The technique turns out to be amenable to precise asymptotic analysis. When the technique is applied using the most powerful known merging algorithm [Christen's], the density mentioned above is still 1, but islands of refractory points still remain, this time forming sets provably of size Θ(log2t) in the neighborhood of each *** is shown that if “information theoretic” merging were achievable, the FJA could be beaten for all t > u10 = 1365. From these results and a few others, we adduce evidence in support of our main conjecture: that even optimum combinations of optimum merging and Ford-Johnson sorting will not beat the FJA when t = uk, but will instead produce refractory regions of size Θ(log2t) in the neighborhood of each λ.
The paper includes generalization of the Quine-Mc Cluskey minimization algorithm of two-valued and multiple-valued logical functions to the case of multiple-valued logical functions taking into account various multiva...
详细信息
The paper includes generalization of the Quine-Mc Cluskey minimization algorithm of two-valued and multiple-valued logical functions to the case of multiple-valued logical functions taking into account various multivalency of variables, and to the case of complex logical expressions of the type 'product sum of product sums ... product sums' up to exhaustion of variables.
暂无评论