Por favor, use este identificador para citar o enlazar este ítem:
https://hdl.handle.net/20.500.12008/3489
Cómo citar
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Cancela, Héctor | es |
dc.contributor.author | Sabiguero Yawelak, Ariel | es |
dc.date.accessioned | 2014-12-02T16:06:53Z | - |
dc.date.available | 2014-12-02T16:06:53Z | - |
dc.date.issued | 2003 | es |
dc.date.submitted | 20141202 | es |
dc.identifier.citation | CANCELA BOSI, H., SABIGUERO YAWELAK, A. "Predicting the performance of a parallel heuristic solution for the Steiner Tree Problem". Reportes Técnicos 03-01. UR. FI – INCO, 2003. | es |
dc.identifier.issn | 0797-6410 | es |
dc.identifier.uri | http://hdl.handle.net/20.500.12008/3489 | - |
dc.description.abstract | Nowadays, there is an increasing number of computer intensive applications, which exceed the capacity of a standard stand-alone computer. An alternative is to parallelize the application and run it in a cluster; there has been much work in this sense, specially in platforms and tools to build a cluster from commodity components, and to develop parallel applications. One of the problems that subsist is the one faced by the analyst when designing a new application in this environment. He must solve the trade-off between the cost of building the cluster, and the application's running time; if he under-dimensions the cluster, the running time might be too long; if he over-dimensions it, the cost might not be acceptable. This work presents an example of how analytical performance models can be applied in this context. In particular, we develop a parallel implementation of a combinatorial optimization heuristic for solving the Steiner Tree Problem, and a Petri net model which can be used to predict the running time of the application on a cluster of PCs, on the basis of measurements on stand-alone equipment. The model is validated experimentally, showing that it adequately predicts optimistic and pessimistic bounds for the measured running time. | es |
dc.format.extent | 11 p. | es |
dc.format.mimetype | application/pdf | es |
dc.language | in | es |
dc.publisher | UR. FI – INCO. | es |
dc.relation.ispartof | Reportes Técnicos 03-01 | es |
dc.rights | Las obras depositadas en el Repositorio se rigen por la Ordenanza de los Derechos de la Propiedad Intelectual de la Universidad De La República. (Res. Nº 91 de C.D.C. de 8/III/1994 – D.O. 7/IV/1994) y por la Ordenanza del Repositorio Abierto de la Universidad de la República (Res. Nº 16 de C.D.C. de 07/10/2014) | es |
dc.subject | PERFORMANCE ESTIMATION | es |
dc.subject | PARALLEL | es |
dc.subject | PETRI NET MODELS | es |
dc.subject | STEINER TREE | es |
dc.subject | COMBINATORIAL OPTIMIZATION | es |
dc.title | Predicting the performance of a parallel heuristic solution for the Steiner Tree Problem | es |
dc.type | Reporte técnico | es |
dc.rights.licence | Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) | es |
Aparece en las colecciones: | Reportes Técnicos - Instituto de Computación |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | ||
---|---|---|---|---|---|
TR0301.pdf | 214,78 kB | Adobe PDF | Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons