![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Raffaele Perego Emilio Luque , José G. Castaños , Evangelos P. Markatos , Raffaele Perego: Topic 3: Scheduling and Load Balancing. Euro-Par 2004 : 220-221 T. Fagni , Raffaele Perego, Fabrizio Silvestri : A Highly Scalable Parallel Caching System for Web Search Engine Results. Euro-Par 2004 : 347-354 Fabrizio Silvestri , Salvatore Orlando , Raffaele Perego: WINGS: A Parallel Indexer for Web Contents. International Conference on Computational Science 2004 : 263-270 Paolo Palmerini , Salvatore Orlando , Raffaele Perego: Statistical properties of transactional databases. SAC 2004 : 515-519 Salvatore Orlando , Raffaele Perego, Claudio Silvestri : A new algorithm for gap constrained sequence mining. SAC 2004 : 540-547 Fabrizio Silvestri , Raffaele Perego, Salvatore Orlando : Assigning document identifiers to enhance compressibility of Web Search Engines indexes. SAC 2004 : 600-605 Salvatore Orlando , Raffaele Perego, Fabrizio Silvestri : Assigning Document Identifiers to Enhance Compressibility of Fulltext Indices. SEBD 2004 : 222-229 Fabrizio Silvestri , Salvatore Orlando , Raffaele Perego: Assigning identifiers to documents to enhance the clustering property of fulltext indexes. SIGIR 2004 : 305-312 Salvatore Orlando , Raffaele Perego, Fabrizio Silvestri : Design of a Parallel and Distributed Web Search Engine CoRR cs.IR/0407053 : (2004) Ranieri Baraglia , Marco Danelutto , Domenico Laforenza , Salvatore Orlando , Paolo Palmerini , Paolo Pesciullesi , Raffaele Perego, Marco Vanneschi : AssistConf: a Grid configuration tool for the ASSIST parallel programming environment. Euro PDP 2003 : 193-200 Salvatore Orlando , Claudio Lucchese , Paolo Palmerini , Raffaele Perego, Fabrizio Silvestri : kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets. FIMI 2003 José Ignacio Hidalgo , Francisco Fernández de Vega , Juan Lanchares , Juan Manuel Sánchez-Pérez , Román Hermida , Marco Tomassini , Ranieri Baraglia , Raffaele Perego, Oscar Garnica : Multi-FPGA Systems Synthesis by Means of Evolutionary Computation. GECCO 2003 : 2109-2120 Salvatore Orlando , Paolo Palmerini , Raffaele Perego, Fabrizio Silvestri : Scheduling High Performance Data Mining Tasks on a Data Grid Environment. Euro-Par 2002 : 375-384 Salvatore Orlando , Paolo Palmerini , Raffaele Perego, Fabrizio Silvestri : Adaptive and Resource-Aware Mining of Frequent Sets. ICDM 2002 : 338-345 Salvatore Orlando , Paolo Palmerini , Raffaele Perego, Fabrizio Silvestri : An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets. VECPAR 2002 : 421-435 Salvatore Orlando , Paolo Palmerini , Raffaele Perego: Enhancing the Apriori Algorithm for Frequent Set Counting. DaWaK 2001 : 71-82 Ranieri Baraglia , José Ignacio Hidalgo , Raffaele Perego: A Parallel Hybrid Heuristic for the TSP. EvoWorkshops 2001 : 193-202 Ranieri Baraglia , José Ignacio Hidalgo , Raffaele Perego: A hybrid heuristic for the traveling salesman problem. IEEE Trans. Evolutionary Computation 5 (6): 613-622 (2001) Ranieri Baraglia , Domenico Laforenza , Salvatore Orlando , Paolo Palmerini , Raffaele Perego: Implementation Issues in the Design of I/O Intensive Data Mining Applications on Clusters of Workstations. IPDPS Workshops 2000 : 350-357 S. Ciarpaglini , L. Folchi , Salvatore Orlando , Susanna Pelagatti , Raffaele Perego: Integrating task and data parallelism with taskHPF. PDPTA 2000 Salvatore Orlando , Paolo Palmerini , Raffaele Perego: Coordinating HPF Programs to Mix Task and Data Parallelism. SAC (1) 2000 : 240-247 Salvatore Orlando , Paolo Palmerini , Raffaele Perego: Mixed data and task parallelism with HPF and PVM. Cluster Computing 3 (3): 201-213 (2000) Salvatore Orlando , Raffaele Perego: COLTHPF, a run-time support for the high-level co-ordination of HPF tasks. Concurrency - Practice and Experience 11 (8): 407-434 (1999) Salvatore Orlando , Raffaele Perego: Scheduling Data-Parallel Computations on Heterogeneous and Time-Shared Environments. Euro-Par 1998 : 356-366 Salvatore Orlando , Raffaele Perego: A Coordination Layer for Exploiting Task Parallelism with HPF. LCR 1998 : 386-393 Salvatore Orlando , Raffaele Perego: An MPI-based Run-Time Support to Coordinate HPF Tasks. PVM/MPI 1998 : 289-296 Ranieri Baraglia , Raffaele Perego: Parallel Genetic Algorithms for Hypercube Machines. VECPAR 1998 : 691-703 Salvatore Orlando , Raffaele Perego: A Comparison of Implementation Strategies for Nonuniform Data-Parallel Computations. J. Parallel Distrib. Comput. 52 (2): 132-149 (1998) Ranieri Baraglia , M. Bucci , D. Circelli , Raffaele Perego: On Designing Genetic Algorithms for Hypercube Machines. HPCN Europe 1997 : 980-981 Salvatore Orlando , Raffaele Perego: A Support for Non-uniform Parallel Loops and Its Application to a Flame Simulation Code. IRREGULAR 1997 : 186-197 Salvatore Orlando , Raffaele Perego: A Load Balancing Strategy for Iterated Parallel Loop Scheduling. HPCN Europe 1996 : 978-979 Salvatore Orlando , Raffaele Perego: A Template for Non-Uniform Parallel Loops Based on Dynamic Scheduling and Prefetching Techniques. International Conference on Supercomputing 1996 : 117-124 Raffaele Perego, G. De Petris : Minimizing network contention for mapping tasks onto massively parallel computers. PDP 1995 : 210-218 Roberto Gagliardi , Raffaele Perego, R. Piepoli : Parallel Data Server Construction Experiences on a Cube-Connected Multicomputer. SEBD 1993 : 215-225 Paolo Cignoni , Claudio Montani , Raffaele Perego, Roberto Scopigno : Parallel 3D Delauney Triangulation. Comput. Graph. Forum 12 (3): 129-142 (1993) Claudio Montani , Raffaele Perego, Roberto Scopigno : Parallel Volume Visualization on a Hypercube Architecture. VVS 1992 : 9-16 1 [ 8 ] [ 10 ] [ 18 ] [ 19 ] [ 20 ] [ 25 ] [ 27 ] 2 [ 8 ] 3 [ 36 ] 4 [ 17 ] 5 [ 2 ] 6 [ 8 ] 7 [ 27 ] 8 [ 35 ] 9 [ 17 ] 10 [ 3 ] 11 [ 25 ] 12 [ 25 ] 13 [ 19 ] [ 20 ] [ 25 ] 14 [ 18 ] [ 27 ] 15 [ 25 ] 16 [ 26 ] 17 [ 36 ] 18 [ 36 ] 19 [ 1 ] [ 2 ] 20 [ 5 ] [ 6 ] [ 7 ] [ 9 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 33 ] [ 34 ] 21 [ 15 ] [ 16 ] [ 18 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 26 ] [ 27 ] [ 33 ] 22 [ 17 ] 23 [ 27 ] 24 [ 4 ] 25 [ 3 ] 26 [ 25 ] 27 [ 1 ] [ 2 ] 28 [ 32 ] 29 [ 22 ] [ 23 ] [ 24 ] [ 26 ] [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 34 ] [ 35 ] 30 [ 25 ] 31 [ 27 ] 32 [ 25 ] ![]() ©2005 Association for Computing Machinery |