Virtual Shared Memory for Distributed ArchitecturesContents: How to approach the virtual shared memory paradigm; A case for virtual distributed objects; MAGNET: A virtual shared Tuplespace memory system; The CARPET programming environment for solving scientific problems on parallel computers; Delayed frame transmission schemes for MPEG videos in a real-time network; Parallel simulation of traffic in Geneva using cellular automata. |
Was andere dazu sagen - Rezension schreiben
Es wurden keine Rezensionen gefunden.
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
abstraction addition algorithms allows application approach architecture bandwidth behavior Bits cache CARPET cars cells cellular automata client communication component Computer consistency coordination data segments database debris define Delayed Transmission Scheme demand described distributed object Distributed Shared Memory DSM systems dynamic efficient environment example execution flexibility frame function given global hardware identify IEEE implementation improvement issues language logical machines Magnet maximum method monitoring MPEG offers operating system parallel passing patterns performance possible problem processors protocol provides reduce remote represent request result road running Science segment sequence server shows simulation single solution specific standard station structure synchronization token tool trace traffic transmitting tuple tuplespace update utilization vehicle video streams Virtual write Xunify
Beliebte Passagen
Seite 52 - Each cell in the regular spatial lattice can have any one of a finite number of states. The states of the cells in the lattice are updated according to a local rule called transition function. That is, the state of a cell at a given time depends only on its own state in the previous time step and the states of its nearby neighbors at the previous time step.
Seite 54 - A CARPET program is composed of a declaration part that appears only once in the program and must precede any statement...
Seite 10 - J. Carter, J. Bennett, and W. Zwaenepoel. Implementation and performance of Munin.
Seite 68 - When will a genetic algorithm outperform hill climbing," in Advances in Neural Information Processing Systems, J. Cowan, G. Tesauro, and J. Alspector, eds., 6, pp. 51-58, Morgan Kaufmann Publishers, Inc., 1994. 6. M. Mitchell and S. Forrest, "Fitness landscapes: royal road functions," in Handbook of Evolutionary Computation, T.
Seite 87 - Reininger, D. Raychaudhuri, B. Melamed, B. Sengupta, and J. Hill, "Statistical Multiplexing of VBR MPEG Compressed Video on ATM Networks,
Seite 69 - Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong email: kwchiu@ieee.org, kamal@iiit.net, csqli@cityu.edu.
Seite 74 - MPEG-I compression is also suitable for transmitting video frames over a computer network. The basic idea of this compression scheme is to predict motion from frame to frame in the temporal direction, and then to use discrete cosine transforms (DCT) to organize the redundancy in the spatial directions. In MPEG-I standard, there are three types of frames. The "I" frames or intra-frames are simply a frame coded as a still image, not using any past history. Then there are "P" frames or predicted-frame...