PARLE '94 Parallel Architectures and Languages Europe: 6th International PARLE Conference, Athens, Greece, July 4 - 8, 1994. Proceedings: Lecture Notes in Computer Science, cartea 817
Editat de Costas Halatsis, Dimitrios Maritsas, George Philokyprou, Sergios Theodoridisen Limba Engleză Paperback – 8 iun 1994
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 659.55 lei
Preț vechi: 824.44 lei
-20% Nou
Puncte Express: 989
Preț estimativ în valută:
126.22€ • 131.11$ • 104.85£
126.22€ • 131.11$ • 104.85£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540581840
ISBN-10: 3540581847
Pagini: 860
Ilustrații: DCCCLX, 843 p.
Dimensiuni: 155 x 235 x 45 mm
Greutate: 1.18 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540581847
Pagini: 860
Ilustrații: DCCCLX, 843 p.
Dimensiuni: 155 x 235 x 45 mm
Greutate: 1.18 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Improved probabilistic routing on generalized hypercubes.- Efficient data communication in Incomplete Hypercube.- Efficient communication in the folded Petersen interconnection networks.- Compiling rewriting onto SIMD and MIMD/SIMD machines.- A compilation technique for varying communication cost NUMA architectures.- A data partitioning algorithm for distributed memory compilation.- Towards a high precision massively parallel computer.- On the testability of purely recursive digital filters.- Voting on synchronous communications.- Protocol validation: A parallel technique to reduce the reachability tree.- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks.- Time-optimal nearest-neighbor computations on enhanced meshes.- Simulation of PRAM models on meshes.- On the multisearching problem for hypercubes.- Code Liberation — A tool for refitting code to a parallel environment.- High-level visualisation of parallel logic program execution.- Next-generation parallel performance visualization: A prototyping environment for visualization development.- A formal approach to modeling expected behavior in parallel program visualizations.- An improvement in the size-depth tradeoff for strictly non-blocking generalized-concentration networks.- Bypass strategy in hypercube multiprocessors by adding bus connections.- Optimul: A hybrid multiprocessor for distributed and shared memory multiprocessing with WDM optical fiber interconnections.- ILIAS, a sequential language for parallel matrix computations.- Static communications in parallel scientific programs.- Load balancing for extrapolation methods on distributed memory multiprocessors.- On the definition of speedup.- Petri net performance models of parallel systems — Methodologyand case study.- Run-time optimization of sparse matrix-vector multiplication on SIMD machines.- A new approach to array redistribution: Strip mining redistribution.- Analytic model of a Cache Only Memory Architecture.- Memory assignment for multiprocessor caches through grey coloring.- An adaptive update-based cache coherence protocol for reduction of miss rate and traffic.- Eliminating invalidation in coherent-cache parallel graph reduction.- Enhancing parallelism by removing cyclic data dependencies.- An interaction-based language and its typing system.- On the parallelism of data.- Predicative polymorphism in ?-calculus.- Improving the execution of the dependent and-parallel Prolog DDAS.- OR-parallel Prolog on distributed memory systems.- Efficient distributed memory implementation of a data parallel functional language.- Modelling photochemical pollution using parallel and distributed computing platforms.- Parallel algorithms and interval selection strategies for globally adaptive quadrature.- Systolic designs for evaluating linear combinations of Chebyshev polynomials.- The impact of the KSR1 allcache architecture on the behaviour of the DBS3 parallel DBMS.- Sparse Generalized HyperGrids for performance scalability.- A distributed garbage collector for active objects.- Bus based parallel computers: A viable way for massive parallelism.- Implementation of GTS.- A hierarchical activation management technique for fine-grain multithreaded execution.- Scheduling task graphs onto distributed memory multiprocessors under realistic constraints.- A dynamic algorithm for online scheduling of parallel processes.- CoReA: A synchronous calculus of parallel communicating reactive automata.- Deriving histories of nets with priority relation.- What do you get from a ?-calculussemantics?.- Rewriting: An effective model of concurrency.- Mercury: Object-affinity scheduling and continuation passing on multiprocessors.- Dynamic allocation of communication bandwidth in multicomputers.- Load balanced priority queues on distributed memory machines.- Parallel computations with algebraic numbers a case study: Jordan normal form of matrices.- Batch dynamic algorithms for two graph problems.- A general method for maximizing the error-detecting ability of distributed algorithms.- MAGE: A Massively Agent Execution System for logic programming.- Checking the serial correctness of control-parallel programs.- NXLib — A parallel programming environment for workstation clusters.- Applying human factors techniques to the design of a tool for parallel program performance analysis and tuning.- An Actor based programming system for heterogeneous processing.- Introducing fairness in CSP systems specified with state variables.- A dataflow-based massively parallel programming language and its implementation.- Using subpages for coherency control in parallel database systems.- A new multi-dimensional interconnection network for SIMD architectures.- A scalable bit-sequential SIMD architecture for pattern recognition.- An iterative array processor architecture for matrix computation.- Datarol-II: A fine-grain massively parallel architecture.- From BSP to a virtual von Neumann machine.- Data parallel relational database processing on the connection machine CM-2 with DataVault.- Staggered scheme: A loop allocation policy.- Using parallel simulated annealing in the mapping problem.- A new parallel MIMD Connected Component Labeling algorithm.- Using reference counters in update based coherent memory.- Compositional reasoning about real-time distributed systems withlimited resources.- Dynamic load balancing on a virtually-shared memory parallel computer system.- Analysing the load balancing scheme of a parallel system on multiprocessors — A modeling approach —.- Performance of interconnection network in multithreaded architectures.- Scheduling algorithms performance with the pSystem parallel programming environment.- A new routing scheme for concatenating two omega networks.