Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1586

• mpiJava: An object-oriented Java interface to MPI
  Mark Baker, Bryan Carpenter, Geoffrey Fox, Sung Hoon Ko, Sang Lim
  Lecture Notes in Computer Science 1586, 1999, pp. 748-762
• An adaptive, fault-tolerant implementation of BSP for Java-based volunteer computing systems
  Luis F.G. Sarmenta
  Lecture Notes in Computer Science 1586, 1999, pp. 763-780
• High performance computing for the masses
  Mark Clement, Quinn Snell, Glenn Judd
  Lecture Notes in Computer Science 1586, 1999, pp. 781-796
• Process networks as a high-level notation for metacomputing
  Darren Webb, Andrew Wendelborn, Kevin Maciunas
  Lecture Notes in Computer Science 1586, 1999, pp. 797-812
• Developing parallel applications using the JavaPorts environment
  Demetris G. Galatopoullos, Elias S. Manolakos
  Lecture Notes in Computer Science 1586, 1999, pp. 813-828
• Permutation routing in all-optical product networks
  Weifa Liang, Xiaojun Shen
  Lecture Notes in Computer Science 1586, 1999, pp. 831-844
• NWCache: Optimizing disk accesses via an optical network/write cache hybrid
  Enrique V. Carrera, Ricardo Bianchini
  Lecture Notes in Computer Science 1586, 1999, pp. 845-858
• NetCache: A network/cache hybrid for multiprocessors
  Enrique V. Carrera, Ricardo Bianchini
  Lecture Notes in Computer Science 1586, 1999, pp. 859-872
• A multi-wavelength optical content-addressable parallel processor (MW-OCAPP) for high-speed parallel relational database processing: Architectural concepts and preliminary experimental system
  Peng Yin Choo, Abram Detofsky, Ahmed Louri
  Lecture Notes in Computer Science 1586, 1999, pp. 873-886
• Optimal scheduling algorithms in WDM optical passive star networks
  Hongiin Yeh, Kyubum Wee, Manpyo Hong
  Lecture Notes in Computer Science 1586, 1999, pp. 887-896
• OTIS-based multi-hop multi-OPS lightwave networks
  David Coudert, Afonso Ferreira, Xavier Muñoz
  Lecture Notes in Computer Science 1586, 1999, pp. 897-910
• Solving graph theory problems using reconfigurable pipelined optical buses
  Keqin Li, Yi Pan, Mounir Hamdi
  Lecture Notes in Computer Science 1586, 1999, pp. 911-923
• High speed, high capacity bused interconnects using optical slab waveguides
  Martin Feldman, Ramachandran Vaidyanathan, Ahmed El-Amawy
  Lecture Notes in Computer Science 1586, 1999, pp. 924-937
• A new architecture for multihop optical networks
  A. Jaekel, S. Bandyopadhyay, A. Sengutpa
  Lecture Notes in Computer Science 1586, 1999, pp. 938-949
• Pipelined versus non-pipelined traffic scheduling in unidirectional WDM rings
  Xijun Zhang, Chunming Qiao
  Lecture Notes in Computer Science 1586, 1999, pp. 950-963
• Self-avoiding walks over adaptive unstructured grids
  Gerd Heber, Rupak Biswas, Guang R. Gao
  Lecture Notes in Computer Science 1586, 1999, pp. 968-977
• A graph based method for generating the Fiedler vector of irregular problems
  Michael Holzrichter, Suely Oliveira
  Lecture Notes in Computer Science 1586, 1999, pp. 978-985
• Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matric ordering
  François Pellegrini, Jean Roman, Patrick Amestoy
  Lecture Notes in Computer Science 1586, 1999, pp. 986-995
• ParaPART: Parallel mesh partitioning tool for distributed systems
  Jian Chen, Valerie E. Taylor
  Lecture Notes in Computer Science 1586, 1999, pp. 996-1005
• Sparse computations with Pei
  Frédérique Voisin, Guy-Renée Perrin
  Lecture Notes in Computer Science 1586, 1999, pp. 1006-1014
• Optimizing irregular HPF applications using halos
  Siegfried Benkner
  Lecture Notes in Computer Science 1586, 1999, pp. 1015-1024
• From EARTH to HTMT: An evolution of a multiheaded architecture model
  Guang R. Gao
  Lecture Notes in Computer Science 1586, 1999, pp. 1025-1025
• Irregular parallel algorithms in Java
  Brian Blount, Siddhartha Chatterjee, Michael Philippsen
  Lecture Notes in Computer Science 1586, 1999, pp. 1026-1035
• A simple framework to calculate the reaching definition of array references and its use in subscript array analysis
  Yuan Lin, David Padua
  Lecture Notes in Computer Science 1586, 1999, pp. 1036-1045
• Dynamic process composition and communication patterns in irregularly structured applications
  C.T.H. Everaars, B. Koren, F. Arbab
  Lecture Notes in Computer Science 1586, 1999, pp. 1046-1054