Log in

Relevant bibliographies by topics / IBM RS/6000 Workstation / Journal articles

To see the other types of publications on this topic, follow the link: IBM RS/6000 Workstation.

Journal articles on the topic 'IBM RS/6000 Workstation'

Author: Grafiati

Published: 4 June 2021

Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 16 journal articles for your research on the topic 'IBM RS/6000 Workstation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

P.L, Jansma, M. A. Landis, L. C. Hansen, N. C. Merchant, N. J. Vickers, and L. P. Tolbert. "The Use of Data Explorer as a 3-D Reconstruction Tool for Microscopy Data Sets." Microscopy and Microanalysis 3, S2 (August 1997): 1131–32. http://dx.doi.org/10.1017/s143192760001254x.

Full text

Abstract:

We are using Data Explorer (DX), a general-purpose, interactive visualization program developed by IBM, to perform three-dimensional reconstructions of neural structures from microscopic or optical sections. We use the program on a Silicon Graphics workstation; it also can run on Sun, IBM RS/6000, and Hewlett Packard workstations. DX comprises modular building blocks that the user assembles into data-flow networks for specific uses. Many modules come with the program, but others, written by users (including ourselves), are continually being added and are available at the DX ftp site, http://www.tc.cornell.edu/DXhttp://www.nice.org.uk/page.aspx?o=43210.Initally, our efforts were aimed at developing methods for isosurface- and volume-rendering of structures visible in three-dimensional stacks of optical sections of insect brains gathered on our Bio-Rad MRC-600 laser scanning confocal microscope. We also wanted to be able to merge two 3-D data sets (collected on two different photomultiplier channels) and to display them at various angles of view.

APA, Harvard, Vancouver, ISO, and other styles

2

Lee, Yu-Min, Charlie Chung-Ping Chen, Yao-Wen Chang, and D. F. Wong. "Simultaneous Buffer-sizing and Wire-sizing for Clock Trees Based on Lagrangian Relaxation." VLSI Design 15, no. 3 (January 1, 2002): 587–94. http://dx.doi.org/10.1080/1065514021000012200.

Full text

Abstract:

Delay, power, skew, area and sensitivity are the most important concerns in current clock-tree design. We present in this paper an algorithm for simultaneously optimizing the above objectives by sizing wires and buffers in clock trees. Our algorithm, based on Lagrangian relaxation method, can optimally minimize delay, power and area simultaneously with very low skew and sensitivity. With linear storage overall and linear runtime per iteration, our algorithm is extremely economical, fast and accurate; for example, our algorithm can solve a 6201-wire-segment clock-tree problem using about 1-minute runtime and 1.3-MB memory and still achieve pico-second precision on an IBM RS/6000 workstation.

APA, Harvard, Vancouver, ISO, and other styles

3

CHAITIN, G. J. "RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS." International Journal of Bifurcation and Chaos 04, no. 01 (February 1994): 3–15. http://dx.doi.org/10.1142/s0218127494000022.

Full text

Abstract:

One normally thinks that everything that is true is true for a reason. I’ve found mathematical truths that are true for no reason at all. These mathematical truths are beyond the power of mathematical reasoning because they are accidental and random. Using software written in Mathematica that runs on an IBM RS/6000 workstation, I constructed a perverse 200-page algebraic equation with a parameter N and 17,000 unknowns: [Formula: see text] For each whole-number value of the parameter N, we ask whether this equation has a finite or an infinite number of whole number solutions. The answers escape the power of mathematical reason because they are completely random and accidental. This work is an extension of the famous results of Gödel and Turing using ideas from a new field called algorithmic information theory.

APA, Harvard, Vancouver, ISO, and other styles

4

Sayed-Ahmed, Ezzeldin Y., and Nigel G. Shrive. "Numerical analysis of face-shell bedded hollow masonry walls subject to concentrated loads." Canadian Journal of Civil Engineering 22, no. 4 (August 1, 1995): 802–18. http://dx.doi.org/10.1139/l95-090.

Full text

Abstract:

A nonlinear elastoplastic finite element model has been developed for face-shell bedded hollow masonry walls subject to in-plane concentrated loads. The model takes into account geometric and material nonlinearities as well as damage due to progressive cracking. Behaviour of the masonry components subject to compressive states of stress is modelled using the theory of plasticity, and cracking is modelled using both discrete and smeared cracking approaches. The model is generated on a SUN SPARC 10/31 workstation using the preprocessor of the finite element program ANSYS; the finite element solution is obtained using the ABAQUS program on the Fujitsu VPX 240/10 and IBM RS/6000 workstation. A brief summary of the numerical modelling and the iterative procedures is discussed. Results from simulated tests of seven-course high wallettes subject to concentrated loads are used to verify the behaviour of the numerical analyses. The methodology, when combined with substructuring, allows analysis of substantially larger walls than would more typical 3-D analyses. The model can be used to check existing design rules and develop more rational design methods for hollow masonry subject to concentrated load. Key words: masonry, hollow concrete masonry, finite element modelling, cracking, failure, strength enhancement factor, concentrated loads.

APA, Harvard, Vancouver, ISO, and other styles

5

Le Bret, M., J. Gabarro-Arpa, JC Gilbert, and C. Lemarechal. "MORCAD, an object-oriented molecular modelling package running on IBM RS/6000 and SGI 4Dxxx workstations." Journal de Chimie Physique 88 (1991): 2489–96. http://dx.doi.org/10.1051/jcp/1991882489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

RYAN, STEPHEN W., and ARVIND K. BANSAL. "A SCALABLE DISTRIBUTED MULTIMEDIA KNOWLEDGE RETRIEVAL SYSTEM ON A CLUSTER OF HETEROGENEOUS HIGH PERFORMANCE ARCHITECTURES." International Journal on Artificial Intelligence Tools 09, no. 03 (September 2000): 343–67. http://dx.doi.org/10.1142/s0218213000000227.

Full text

Abstract:

This paper describes a system to distribute and retrieve multimedia knowledge on a cluster of heterogeneous high performance architectures distributed over the Internet. The knowledge is represented using facts and rules in an associative logic-programming model. Associative computation facilitates distribution of facts and rules, and exploits coarse grain data parallel computation. Associative logic programming uses a flat data model that can be easily mapped onto heterogeneous architectures. The paper describes an abstract instruction set for the distributed version of the associative logic programming and the corresponding implementation. The implementation uses a message-passing library for architecture independence within a cluster, uses object oriented programming for modularity and portability, and uses Java as a front-end interface to provide a graphical user interface and multimedia capability and remote access via the Internet. The performance results on a cluster of IBM RS 6000 workstations are presented. The results show that distribution of data improves the performance almost linearly for small number of processors in a cluster.

APA, Harvard, Vancouver, ISO, and other styles

7

Wasserman, Harvey J. "Benchmark Tests on the New IBM RISC System/6000 590 Workstation." Scientific Programming 4, no. 1 (1995): 23–34. http://dx.doi.org/10.1155/1995/269236.

Full text

Abstract:

The results of benchmark tests on the superscalar IBM RISC System/6000 Model 590 are presented. A set of well-characterized Fortran benchmarks spanning a range of computational characteristics was used for the study. The data from the 590 system are compared with those from a single-processor CRAY C90 system as well as with other microprocessor-based systems, such as the Digital Equipment Corporation AXP 3000/500X and the Hewlett-Packard HP/735.

APA, Harvard, Vancouver, ISO, and other styles

8

Nanayakkara, Asiri, David Moncrieff, and Stephen Wilson. "Performance of IBM RISC System/6000 workstation clusters in a quantum chemical application." Parallel Computing 19, no. 9 (September 1993): 1053–62. http://dx.doi.org/10.1016/0167-8191(93)90097-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Banikazemi, M., R. K. Govihdaraju, R. Blackmore, and D. K. Panda. "MPI-LAPI: an efficient implementation of MPI for IBM RS/6000 SP systems." IEEE Transactions on Parallel and Distributed Systems 12, no. 10 (2001): 1081–93. http://dx.doi.org/10.1109/71.963419.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mangione-Smith, W., S. G. Abraham, and E. S. Davidson. "A performance comparison of the IBM RS/6000 and the Astronautics ZS-1." Computer 24, no. 1 (January 1991): 39–46. http://dx.doi.org/10.1109/2.67192.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Falsaperla, P., S. Motta, and S. Succi. "Parallel efficiency of the C.R.F. method on an IBM RS/6000 cluster platform." Journal of Scientific Computing 9, no. 3 (September 1994): 293–309. http://dx.doi.org/10.1007/bf01575034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

KAPLOW, WESLEY K., and BOLESLAW K. SZYMANSKI. "PROGRAM OPTIMIZATION BASED ON COMPILE-TIME CACHE PERFORMANCE PREDICTION." Parallel Processing Letters 06, no. 01 (March 1996): 173–84. http://dx.doi.org/10.1142/s0129626496000170.

Full text

Abstract:

We present a novel, compile-time method for determining the cache performance of the loop nests in a program. The cache hit-rates are produced by applying the reference string, determined during compilation, to an architecturally parameterized cache simulator. We also describe a heuristic that uses this method for compile-time optimization of loop ranges in iteration-space blocking. The results of the loop program optimizations are presented for different parallel program benchmarks and various processor architectures, such as IBM SP1 RS/6000, the SuperSPARC, and the Intel 1860.

APA, Harvard, Vancouver, ISO, and other styles

13

HUANG, ZU-LAN, RICHARD M. M. CHEN, and YAO-LIN JIANG. "A PARALLEL DECOUPLING TECHNIQUE TO ACCELERATE CONVERGENCE OF RELAXATION SOLUTION OF INTEGRAL-DIFFERENTIAL-ALGEBRAIC EQUATIONS." Journal of Interconnection Networks 02, no. 03 (September 2001): 295–304. http://dx.doi.org/10.1142/s0219265901000397.

Full text

Abstract:

In this paper, we first study the covergence performance of relaxatio-based algorithms for linear integral differential-algebraic equations (IDAEs), then a parallel decoupling technique to speed up the convergence of the relaxation-based algorithms is derived. This novel technique is suitable for implementation of parallel processing for complicated systems of IDAEs. Factors taking effect on the performance of parallel processing are discussed in detail. Large numerical examples running on a network of IBM RS/6000 SP2 system are given to illustrate how judicious partitionings of matrices can help improve convergence in parallel processing.

APA, Harvard, Vancouver, ISO, and other styles

14

Lu, C., J. W. Cooley, and R. Tolimieri. "FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000." IEEE Transactions on Signal Processing 41, no. 2 (1993): 638–48. http://dx.doi.org/10.1109/78.193205.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Thomas, Nathan, Steven Saunders, Tim Smith, Gabriel Tanase, and Lawrence Rauchwerger. "ARMI: A High Level Communication Library for STAPL." Parallel Processing Letters 16, no. 02 (June 2006): 261–80. http://dx.doi.org/10.1142/s0129626406002617.

Full text

Abstract:

ARMI is a communication library that provides a framework for expressing fine-grain parallelism and mapping it to a particular machine using shared-memory and message passing library calls. The library is an advanced implementation of the RMI protocol and handles low-level details such as scheduling incoming communication and aggregating outgoing communication to coarsen parallelism. These details can be tuned for different platforms to allow user codes to achieve the highest performance possible without manual modification. ARMI is used by STAPL, our generic parallel library, to provide a portable, user transparent communication layer. We present the basic design as well as the mechanisms used in the current Pthreads/OpenMP, MPI implementations and/or a combination thereof. Performance comparisons between ARMI and explicit use of Pthreads or MPI are given on a variety of machines, including an HP-V2200, Origin 3800, IBM Regatta and IBM RS/6000 SP cluster.

APA, Harvard, Vancouver, ISO, and other styles

16

Fernando, Achela K., and A. W. Jayawardena. "Use of a supercomputer to advance parameter optimisation using genetic algorithms." Journal of Hydroinformatics 9, no. 4 (October 1, 2007): 319–29. http://dx.doi.org/10.2166/hydro.2007.006.

Full text

Abstract:

Parameter optimisation is a significant but time-consuming process that is inherent in conceptual hydrological models representing rainfall–runoff processes. This study presents two modifications to achieve optimised results for a Tank Model in less computational time. Firstly, a modified genetic algorithm (GA) is developed to enhance the fitness of the population consisting of possible solutions in each generation. Then the parallel processing capabilities of an IBM 9076 SP2 computer are used to expedite implementation of the GA. A comparison of processing time between a serial IBM RS/6000 390 computer and an IBM 9076 SP2 supercomputer reveals that the latter can be up to 8 times faster. The effectiveness of the modified GA is tested with two Tank Models for a hypothetical catchment and a real catchment. The former showed that the parallel GA reaches a lower overall error in reduced time. The overall RMSE, expressed as a percentage of actual mean flow rate, improves from 31.8% in a serial processing computer to 29.5% on the SP2 supercomputer. The case of the real catchment – Shek-Pi-Tau Catchment in Hong Kong – reveals that the supercomputer enhances the swiftness of the GA and achieves its objective within a couple of hours.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!