Results 251 to 260 of about 192,480 (283)
Some of the next articles are maybe not open access.

Advanced function extended with tightly-coupled multiprocessing

IBM Systems Journal, 1974
Multiprocessing hardware as implemented on System/370 is presented. With emphasis on tightly-coupled systems configurations, topics include instructions and facilities, and a comparison with prior IBM multiprocessors.
openaire   +1 more source

SPAN: Tightly coupled thermal and electrical simulation

Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference, 2002
A method is presented to combine solvers for ordinary and partial differential equations, like SPICE and ANSYS, for thermal-electrical analysis of integrated circuits or systems. A sketch of a first prototype program (SPAN) is given together with the theoretical background, which makes use of convergence principles from waveform relaxation.
Bernhard Klaassen, Karl L. Paap
openaire   +1 more source

Tightly Coupled Agents in Live Performance Metacreations

Proceedings of the 2015 ACM SIGCHI Conference on Creativity and Cognition, 2015
We consider how the application of AI in digital musical instruments might maximally support exploration of sound in performance. Live performance applications of AI and machine learning have tended to focus on score following and the development of machine collaborators. In our work we are interested in exploring the development of systems whereby the
William Marley, Nicholas Ward
openaire   +1 more source

On Input/Output Speedup in Tightly Coupled Multiprocessors

IEEE Transactions on Computers, 1986
Previous models of program speedup on parallel architectures tend to ignore I/O activity and other important issues. In this paper we derive analytic speedup models including I/O activities. We show that ignoring I/O yields conservative speedup results. We explore the effectiveness of using hardware format conversion units in multiprocessors [33].
Walid A. Abu-Sufah   +2 more
openaire   +1 more source

A Parallel sorting algorithm for tightly coupled multiprocessors

Concurrency: Practice and Experience, 1990
AbstractIn this paper we present a new parallel sorting algorithm suitable for implementation on a tightly coupled multiprocessor. The algorithm utilizes P processors to sort a set of N data items subdivided into M subsets. The performance of the algorithm is investigated, and the results of experiments carried out on the Balance 8000 multiprocessor ...
openaire   +1 more source

Tightly coupled operating systems on personal microcomputers

Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers - SIGSMALL '83, 1983
This paper examines a type of hardware/software architecture that is emerging as a result of present availability of microcomputer systems and their software. We point out how these systems can be merged in a tightly coupled configuration, and how we can obtain a strong synergistic effect by pooling the resources of each system.
Rafiul Ahad, Georg Raeder
openaire   +1 more source

An architecture for tightly coupled multi-robot cooperation

Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2002
Proposes an architecture for tightly coupled multi-robot coordination that is well suited to cooperative manipulation tasks. At all times, a robot is identified as a leader, while the others are designated as followers. The assignment of roles and the coordination between the robots is guaranteed by communication protocols and control algorithms.
Luiz Chaimowicz   +3 more
openaire   +1 more source

A Tightly Coupled Accelerator Infrastructure for Exact Arithmetics

2010
Processor speed and available computing power constantly increases, enabling computation of more and more complex problems such as numerical simulations of physical processes. In this domain, however, the problem of accuracy arises due to rounding of intermediate results. One solution is to avoid intermediate rounding by using exact arithmetic. The use
Nowak, F., Buchty, R.
openaire   +1 more source

Performance of tightly-coupled systems with shared cache

Microprocessing and Microprogramming, 1991
Abstract Shared cache under an effective management policy can yield a hit ratio higher than that for private cache, because of the fact that shared space in the cache could be divided among the processors according to their needs, and also, only single copies of shared blocks are stored in the cache.
Ghulam M. Chaudhry, J. S. Bedi
openaire   +1 more source

Parallel sorting algorithms for tightly coupled multiprocessors

Parallel Computing, 1988
Abstract We present three parallel sorting algorithms suitable for implementation on tightly coupled multiprocessors and compare their performance on the Denelcor HEP. Two of the algorithms implemented—parallel Shellsort and quickmerge—are new. Shellsort is amenable to parallelization; however, since Shellsort has higher complexity than quicksort ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy