Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Goldman, Alfredo - Departamento de Ciência da Computação, Universidade de São Paulo
Strasbourg, 9 juin 12 juin 1998 1 Un exemple d'ordonnancement sous le mod#le BSP
An Ecient Parallel Algorithm for Solving the Knapsack Problem on Hypercubes
Sistemas de localiza c~ao din^amica de servi cos em ambientes de computa c~ao m ovel
Mico -University Schedule Planner Alexandre Freire , Alfredo Goldman ,
An efficient parallel algorithm for solving the knapsack problem on the hypercube \Lambda
Bus based parallel computers: A viable way for massive parallelism
Novas estruturas de interconex~ao `a base de barramentos e algoritmos de comunicac~ao
1-optimality of static BSP computations: scheduling independent chains as a case study.
Introduction PPAM'97 Parallel execution of irregular meshes into a systolic
Pol ticas de Hand-o com Balanceamento de Carga para Computa c~ao A. Santiago, A. Goldman
Broadcasting in bus interconnection networks A. Ferreira ? A. Goldman vel Lejbman ?? S. W. Song ???
Scalable Algorithms for Complete Exchange on MultiCluster Networks Alfredo Goldman
A Parallel Algorithm for Enumerating Combinations Martha Torres Alfredo Goldman
A Model for Parallel Job Scheduling on Dynamic Computer Grids Alfredo Goldman Carlos Queiroz
Eliminac ao Paralela de Termos Dominantes no Problema da Mochila
InteGrade: Rumo a um Sistema de Computac~ao em Grade para Aproveitamento de
Near optimal algorithms for scheduling independent chains in BSP \Lambda Alfredo GOLDMAN y , Gregory MOUNI
Modelos para a computa c~ao paralela Alfredo Goldman 1 (DCC-IME-USP, gold@ime.usp.br)
Scheduling with Duplication on m Processors with Small Communication Delays
