The DoD-STD-2167 development process is addressed. Each requirement is discussed, and those areas that were automated and those areas in which automation was not applicable are identified. The discussion includes the ...
详细信息
ISBN:
(纸本)0879425768
The DoD-STD-2167 development process is addressed. Each requirement is discussed, and those areas that were automated and those areas in which automation was not applicable are identified. The discussion includes the general methodologies involved in the automation process. In each of these areas any tradeoffs driven by automating that particular task are identified.
The authors present a self-reconfigurable algorithm for a hierarchically redundant WSI (wafer scale integration) sorting network. This WSI sorting network consists of a mesh interconnection and a modified bitonic sort...
详细信息
ISBN:
(纸本)0818691263
The authors present a self-reconfigurable algorithm for a hierarchically redundant WSI (wafer scale integration) sorting network. This WSI sorting network consists of a mesh interconnection and a modified bitonic sorter with spare cells. The fault tolerance performance of the WSI sorting network using the self-reconfigurable algorithm is discussed. It is confirmed that the hierarchical redundancy of the WSI sorting network achieves a higher fault tolerance performance than a nonhierarchical network and is suitable for both clustered faults and random faults.
Interior-point methods for linear programming, developed in the context of sequential computation, are used to obtain a parallel algorithm for the bipartite matching problem. The algorithm runs in O*(√m) time. The re...
详细信息
ISBN:
(纸本)0818619821
Interior-point methods for linear programming, developed in the context of sequential computation, are used to obtain a parallel algorithm for the bipartite matching problem. The algorithm runs in O*(√m) time. The results extend to the weighted bipartite matching problem and to the zero-one minimum-cost flow problem, yielding O*(√m log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interior-point methods in parallel algorithm design.
We develop an abstract model of memory management in distributed systems. The model is low-level enough so that we can express communication, allocation and garbage collection, but otherwise hides many of the lower-le...
详细信息
ISBN:
(纸本)9780897919180
We develop an abstract model of memory management in distributed systems. The model is low-level enough so that we can express communication, allocation and garbage collection, but otherwise hides many of the lower-level details of an actual implementation. Recently, such formal models have been developed for memory management in a functional, sequential setting [10]. The models are rewriting systems whose terms are programs. Programs have both the ''code'' (control string) and the ''store'' syntactically apparent. Evaluation is expressed as conditional rewriting and includes store operations. Garbage collection becomes a rewriting relation that removes part of the store without affecting the behavior of the program. Distribution adds another dimension to an already complex problem. By using techniques developed for communicating and concurrent systems [9], we extend their work to a distributed environment. Sending and receiving messages is also made apparent at the syntactic level. A very general garbage collection rule based on reachability is introduced and proved correct. Now proving correct a specific collection strategy is reduced to showing that the relation between programs defined by the strategy is a sub-relation of the general relation. Any actual implementation which is capable of providing the transitions (including their atomicity constraints) specified by the strategy is therefore correct. This model allows us to specify and prove correct in a compact manner two garbage collectors;the first one does a simple garbage collection local to a node. The second garbage collector uses migration of data in order to be able to reclaim inter-node cyclic garbage.
A program to predict organic reactions, ROBIA, has been developed. It achieves reaction prediction on the basis of coded rules and molecular modeling calculations, generating possible transition states, intermediates,...
详细信息
A program to predict organic reactions, ROBIA, has been developed. It achieves reaction prediction on the basis of coded rules and molecular modeling calculations, generating possible transition states, intermediates, and products given the starting material and reaction conditions. The program generates all possible reaction pathways, on the basis of the selected transformations within its database, and evaluates them selecting the most feasible ones. The program has been successfully tested against several examples.
The author discusses issues of importance to documenters of open systems in the computer industry. These systems provide a common software environment for users and application programs, and are based on nonproprietar...
详细信息
The author discusses issues of importance to documenters of open systems in the computer industry. These systems provide a common software environment for users and application programs, and are based on nonproprietary technology and industry, national, and international standards. The experience of the Technical Documentation Group at the Open Software Foundation (OSF) is considered as an example. OSF is an international organization that solicits technology through an open process called the request for technology (RFT). OSF supplies to the developers of open systems-based products technologies acquired through the RFT process. The author focuses on such topics as audience definition, documentation set planning, document interchange and tools, internationalization, and writer training and motivation.
The paper presents an extension of task scheduling algorithms for dynamically look-ahead reconfigurable multi-processor systems to account for conditional branches in programs. The target architecture assumes preparin...
详细信息
ISBN:
(纸本)076952513X
The paper presents an extension of task scheduling algorithms for dynamically look-ahead reconfigurable multi-processor systems to account for conditional branches in programs. The target architecture assumes preparing link connections in advance in redundant connection switches in parallel with program execution. It provides time transparency of interprocessor connection setting at program run-time. Application programs are partitioned into sections, which execute using fixed look-ahead prepared connections. Programs are represented by a new graph representation - Branching Task Graph (BTG), which composed including macro-dataflow and control-flow paradigms. The BTG enables extending known up-to-now scheduling algorithms of program graphs with fully static control towards scheduling of graphs data dependent control. The new scheduling algorithm includes branch handling techniques based on detection of mutually-exclusive paths in the graphs and scheduling paths in branches according to their probabilities. The program partitioning into sections uses modified iterative clustering heuristics. An example shows advantages of the proposed method
This report covers the activities of the 3(rd) European Lisp Workshop. We introduce the motivation for a workshop focussing on languages in the Lisp family, and mention relevant organisational aspects. We summarize th...
详细信息
ISBN:
(纸本)9783540717720
This report covers the activities of the 3(rd) European Lisp Workshop. We introduce the motivation for a workshop focussing on languages in the Lisp family, and mention relevant organisational aspects. We summarize the presentations and discussions, including Nick Levine's keynote talk, and provide pointers to related work and events.
We provide a performance comparison of generated Infopipes that have been translate the Spi/XIP variant of Infopipe specification into executable code. Infopipes are an abstraction to support information flow applicat...
详细信息
ISBN:
(纸本)0769522424
We provide a performance comparison of generated Infopipes that have been translate the Spi/XIP variant of Infopipe specification into executable code. Infopipes are an abstraction to support information flow applications. These tools are evaluated through a realistic application: a continuous image streaming program. We implement the application in C and compare its performance to both a hand-written application and one that uses SunRPC.
It is pointed out that, when looking for new and faster parallel sorting algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on pa...
详细信息
ISBN:
(纸本)0818620560
It is pointed out that, when looking for new and faster parallel sorting algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel sorting in the field of theoretical computer science. It is shown how this kind of investigation can be done on a simple but versatile environment for programming and measuring of PRAM (parallel random access machine) algorithms. The practical value of Cole's parallel merge sort algorithm has been investigated by comparing it with Batcher's bitonic sorting. The O(log n) time consumption of Code's algorithm implies that it must be faster than bitonic sorting which is o(log2 n) time, if n is large enough. However, it has been found that bitonic sorting is faster as long as n is less than 1.2 × 1021. Consequently, it is concluded that Cole's logarithmic time algorithm is not fast in practice.
暂无评论