Filters








36 Hits in 5.6 sec

Visualization of program performance on concurrent computers [chapter]

Diane T. Rover, G. M. Prabhu, Charles T. Wright
1991 Lecture Notes in Computer Science  
An architecture perspective highlights the logical structure and interaction of the components in the computer system (e.g., processors and channels).  ...  The five systems we use for comparison are: uniprocessor, bus multiprocessor (shared memory), small multicomputer, medium multicomputer, and large multicomputer.  ... 
doi:10.1007/bfb0038487 fatcat:rquessvwgzfk5lelje5jnjsv64

Design and Evaluation of Mechanisms for a Multicomputer Object Store [article]

Lex Weaver
2000 arXiv   pre-print
There are many applications for which this compute intensive approach is only a partial solution.  ...  CAD, virtual reality, simulation, document management and analysis all require timely access to large amounts of data.  ...  Thank you also to my parents for financing me through a seemingly interminable degree, to my flatmate Rachel for tolerating the vagaries of a computing honours student, and to the Canberra Workers' Club  ... 
arXiv:cs/0004010v1 fatcat:nnjr3q3fbzehvecl4kmicgxsam

Architecture of a Quantum Multicomputer Optimized for Shor's Factoring Algorithm [article]

Rodney Doyle Van Meter III
2006 arXiv   pre-print
The quantum multicomputer consists of a large number of small nodes and a qubus interconnect for creating entangled state between the nodes.  ...  The primary metric chosen is the performance of such a system on Shor's algorithm for factoring large numbers: specifically, the quantum modular exponentiation step that is the computational bottleneck  ...  the behavior of a quantum multicomputer based on an overall structure I propose.  ... 
arXiv:quant-ph/0607065v1 fatcat:ulsuyg7am5dpnpe4xe35x6mt7y

The Vesta Parallel File System [chapter]

2009 High Performance Mass Storage and Parallel I/O  
The system is fully implemented and forms the basis for the AIX Parallel I/O File System on the IBM SP2. The implementation does not compromise scalability or parallelism.  ...  The Vesta parallel file system is designed to provide parallel file access to application programs running on multicomputers with parallel I/O subsystems.  ...  ACKNOWLEDGMENTS The authors would like to acknowledge the contributions of Jean-Pierre Prost, Sandra Johnson Baylor, Yarsun Hsu, Marc Snir, Tony Bolmarcich, and Julian Satran to the total effort related  ... 
doi:10.1109/9780470544839.ch20 fatcat:eepeqszzgrhfnp5gvbbmifqzmi

The Vesta parallel file system

Peter F. Corbett, Dror G. Feitelson
1996 ACM Transactions on Computer Systems  
The system is fully implemented and forms the basis for the AIX Parallel I/O File System on the IBM SP2. The implementation does not compromise scalability or parallelism.  ...  The Vesta parallel file system is designed to provide parallel file access to application programs running on multicomputers with parallel I/O subsystems.  ...  ACKNOWLEDGMENTS The authors would like to acknowledge the contributions of Jean-Pierre Prost, Sandra Johnson Baylor, Yarsun Hsu, Marc Snir, Tony Bolmarcich, and Julian Satran to the total effort related  ... 
doi:10.1145/233557.233558 fatcat:gctsk35cavayhau5fqpzs2kuc4

Join processing in relational databases

Priti Mishra, Margaret H. Eich
1992 ACM Computing Surveys  
A relational model of data for large shared data banks Commun. ACM 13, 6 (June), 377-387. CODD, E. F. 1972. Relational completeness of data base sublanguages.  ...  A T-tree is a binary tree with several elements per node. It can be described as a combination of the AVL-tree and the B-tree data structures.  ... 
doi:10.1145/128762.128764 fatcat:u2fdsytzmbauxnyqkwozxxk3bi

Query evaluation techniques for large databases

Goetz Graefe
1993 ACM Computing Surveys  
Database management systems will continue to manage large data volumes.  ...  On the contrary, modern data models exacerbate the problem: In order to manipulate large sets of complex objects as efficiently as today's database systems manipulate simple records, query processing algorithms  ...  For example, Tandem's Non- Stop SQL system uses B-trees for actual data as well as for redundant index structures.  ... 
doi:10.1145/152610.152611 fatcat:auqfirimvjbsfo36s6guwgqc3a

Reflections on standard ML [chapter]

David B. MacQueen
1993 Lecture Notes in Computer Science  
Standard ML is one of a number of new programming languages developed in the 1980s that are seen as suitable vehicles for serious systems and applications programming.  ...  Because of its type and module system, Standard ML manages to combine safety, security, a n d robustness with much of the exibility of dynamically typed languages like Lisp.  ...  It provides safety, security, a n d g o o d structuring tools for large-scale programming.  ... 
doi:10.1007/3-540-56883-2_2 fatcat:lu6gh4a72baf7du6t4xohl6ire

Data Semantics [chapter]

2017 Encyclopedia of GIS  
Cross-References Data Infrastructure, Spatial Geography Markup Language (GML) Metadata and Interoperability, Geospatial National Spatial Data Infrastructure (NSDI) OGC's Open Standards for Geospatial Interoperability  ...  Web Mapping and Web Cartography Web Services, Geospatial Cross-References Internet-Based Spatial Information Retrieval Internet GIS  ...  An example of a good data structure fit would be using a tree-type data structure for use with a database. Of course there may be many data structures that can be used for a specific problem.  ... 
doi:10.1007/978-3-319-17885-1_100256 fatcat:npcac6ns2zdjfokmwpmzb2s6km

Hardware-modulated parallelism in chip multiprocessors

Julia Chen, Philo Juang, Kevin Ko, Gilberto Contreras, David Penry, Ram Rangan, Adam Stoler, Li-Shiuan Peh, Margaret Martonosi
2005 SIGARCH Computer Architecture News  
In particular, our simulations motivated the need for hardware support, showing that the large thread management overheads of current run-time software systems can lead to up to 6.5X slowdown.  ...  Dynamic modulation of parallelism provides the ability to respond to run-time variability that arises from dataset changes, memory system effects and power spikes and lulls, to name a few.  ...  We also wish to thank Niraj Jha, Fei Sun and Anish Muttreja of Princeton for their pointers towards the MCP static scheduling algorithm as a comparison yardstick for NDP and performance macromodels.  ... 
doi:10.1145/1105734.1105742 fatcat:d5iferqj5fghrmndyw6b4ill6y

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  If we use a decomposition approach in order to solve a minimization problem we often get an objective function in such a w a y that its domain dom 6 = n is not given explicitely to us.  ...  We propose a new method for constructing decision trees in which each decision is a SVM. The logical structure of the tree is xed.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

A review of literature on parallel constraint solving

IAN P. GENT, IAN MIGUEL, PETER NIGHTINGALE, CIARAN MCCREESH, PATRICK PROSSER, NEIL C. A. MOORE, CHRIS UNSWORTH
2018 Theory and Practice of Logic Programming  
We review the literature, and see that we can sometimes do quite well, some of the time, on some instances, but we are far from a general solution.  ...  ; whether to use static or dynamic decomposition; and how to best exploit portfolios and cooperating search.  ...  Acknowledgements We thank Christopher Jefferson for a number of useful discussions, and the reviewers of this journal for their suggestions, which greatly improved this paper.  ... 
doi:10.1017/s1471068418000340 fatcat:42hcmkwlgnayhkmn7w7ypzeh3m

Three-dimensional medical imaging: algorithms and computer systems

M. R. Stytz, G. Frieder, O. Frieder
1991 ACM Computing Surveys  
We also thank Gabor Herman and the referees for their suggestions and criticisms.  ...  ACKNOWLEDGMENTS The authors are indebted to the employees of Pixar and the researchers whose machines are mentioned for reviewing their particular portions of this survey.  ...  The octree is an eight-ary tree data structure formed by recursive octant-wise subdivision of the object space array.  ... 
doi:10.1145/125137.125155 fatcat:koj3dmvdpbgvdit2ne3tkywlye

Making an Impact: Artificial Intelligence at the Jet Propulsion Laboratory

Steve A. Chien, Dennis DeCoste, Richard J. Doyle, Paul E. Stolorz
1997 The AI Magazine  
The system then learns an appearance model for volcanoes and uses this space missions.  ...  a backtracking logical database.  ... 
doi:10.1609/aimag.v18i1.1278 dblp:journals/aim/ChienDDS97 fatcat:i25iqkyatnbdnim6jvqxkwjtpa

Predictive and Distributed Routing Balancing for High Speed Interconnection Networks

Carlos Nunez Castillo, Diego Lugones, Daniel Franco, Emilio Luque
2011 2011 IEEE International Conference on Cluster Computing  
This work presents a Predictive and Distributed Routing Balancing (PR-DRB) technique, a new method developed to gradually control network congestion, based on paths expansion, tra c distribution, applications  ...  Siempre me hab an dicho que a lo largo de una traves a de esta envergadura, uno logra conocer y hacerse de muy buenos amigos. Pues ten an raz on.  ...  Acknowledgments We would like to thank OPNET Technologies, Inc. for providing us the OPNET Modeler licenses to perform the experimental evaluation of this thesis and the previous work [5] , [9] , [6  ... 
doi:10.1109/cluster.2011.66 dblp:conf/cluster/CastilloLFL11 fatcat:l5mrjpu7irfodls7qmzxv6hqa4
« Previous Showing results 1 — 15 out of 36 results