Paolo Romano
Paolo Romano
INESC-ID/Instituto Superior Técnico, University of Lisbon
Bestätigte E-Mail-Adresse bei gsd.inesc-id.pt - Startseite
Titel
Zitiert von
Zitiert von
Jahr
D2STM: Dependable distributed software transactional memory
M Couceiro, P Romano, N Carvalho, L Rodrigues
2009 15th IEEE Pacific Rim International Symposium on Dependable Computing …, 2009
2152009
GMU: Genuine Multiversion Update-Serializable Partial Data Replication
S Peluso, P Ruivo, P Romano, F Quaglia, L Rodrigues
IEEE Transactions on Parallel and Distributed Systems 27 (10), 2911-2925, 2016
128*2016
Score: A scalable one-copy serializable partial replication protocol
S Peluso, P Romano, F Quaglia
Proceedings of the 13th International Middleware Conference, 456-475, 2012
942012
Transactional auto scaler: elastic scaling of in-memory transactional data grids
D Didona, P Romano, S Peluso, F Quaglia
Proceedings of the 9th international conference on Autonomic computing, 125-134, 2012
94*2012
Self-tuning Intel Restricted Transactional Memory
N Diegues, P Romano
Parallel Computing 50, 25-52, 2015
88*2015
Identifying the optimal level of parallelism in transactional memory applications
D Didona, P Felber, D Harmanci, P Romano, J Schenker
Computing 97 (9), 939-959, 2015
862015
Virtues and limitations of commodity hardware transactional memory
N Diegues, P Romano, L Rodrigues
Proceedings of the 23rd international conference on Parallel architectures …, 2014
832014
Cloud-TM: harnessing the cloud with distributed transactional memories
P Romano, L Rodrigues, N Carvalho, J Cachopo
ACM SIGOPS Operating Systems Review 44 (2), 1-6, 2010
802010
Auto Placer: Scalable Self-Tuning Data Placement in Distributed Key-Value Stores
J Paiva, P Ruivo, P Romano, L Rodrigues
ACM Transactions on Autonomous and Adaptive Systems (TAAS) 9 (4), 19, 2015
752015
Towards distributed software transactional memory systems
P Romano, N Carvalho, L Rodrigues
Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and …, 2008
752008
Enhancing performance prediction robustness by combining analytical modeling and machine learning
D Didona, F Quaglia, P Romano, E Torre
Proceedings of the 6th ACM/SPEC International Conference on Performance …, 2015
692015
Asynchronous lease-based replication of software transactional memory
N Carvalho, P Romano, L Rodrigues
Proceedings of the ACM/IFIP/USENIX 11th International Conference on …, 2010
632010
Aggro: Boosting stm replication via aggressively optimistic transaction processing
R Palmieri, F Quaglia, P Romano
2010 Ninth IEEE International Symposium on Network Computing and …, 2010
612010
Osare: Opportunistic speculation in actively replicated transactional systems
R Palmieri, F Quaglia, P Romano
2011 IEEE 30th International Symposium on Reliable Distributed Systems, 59-64, 2011
572011
On the analytical modeling of concurrency control algorithms for software transactional memories: The case of commit-time-locking
P Di Sanzo, B Ciciani, R Palmieri, F Quaglia, P Romano
Performance Evaluation 69 (5), 187-205, 2012
512012
On speculative replication of transactional systems
P Romano, R Palmieri, F Quaglia, N Carvalho, L Rodrigues
Journal of Computer and System Sciences 80 (1), 257-276, 2014
50*2014
Polycert: Polymorphic self-optimizing replication for in-memory transactional grids
M Couceiro, P Romano, L Rodrigues
Proceedings of the 12th International Middleware Conference, 300-319, 2011
432011
ProteusTM: Abstraction Meets Performance in Transactional Memory
D Didona, N Diegues, AM Kermarrec, R Guerraoui, R Neves, P Romano
Proceedings of the Twenty-First International Conference on Architectural …, 2016
402016
A generic framework for replicated software transactional memories
N Carvalho, P Romano, L Rodrigues
Network Computing and Applications (NCA), 2011 10th IEEE International …, 2011
402011
A machine learning approach to performance prediction of total order broadcast protocols
M Couceiro, P Romano, L Rodrigues
2010 Fourth IEEE International Conference on Self-Adaptive and Self …, 2010
392010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20