João Cachopo

João Cachopo

Auto-generated profile, based on publicly available information

João Cachopo

Technical University of Lisbon, Lisbon, Portugal

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2006 in Science of Computer Programming
Verified
Journal Article
Closed access
JCJoão Cachopo
João Cachopo
ASAntonio Silva
Antonio Silva

12 February 2011
Verified
Conference Paper
Open access
SFSérgio Miguel Fernandes
Sérgio Miguel Fernandes
JCJoão Cachopo
João Cachopo

14 April 2010 in ACM SIGOPS Operating Systems Review
Verified
Journal Article
Open access
PRPaolo Romano
Paolo Romano
LRLuis Rodrigues
Luis Rodrigues
NCNuno Carvalho
Nuno Carvalho
JCJoäo Cachopo
Joäo Cachopo
One of the main challenges to harness the potential of Cloud computing is the design of programming models that simplify the development of large-scale parallel applications and that allow ordinary programmers to take full advantage of the computing power and the storage provided by the Cloud, both of which made available, on demand, in a pay-only-forwhat-you-use pricing model. In this paper, we discuss the use of the Transactional Memory programming model in the context of the cloud computing paradigm, which we refer to as Cloud-TM. We identify where existing Distributed Transactional Memory platforms still fail to meet the requirements of the cloud and of its users, and we point several open research problems whose solution we deem as essential to materialize the Cloud-TM vision.


1 April 2008
Verified
Conference Paper
Open access
PDF file
NCNuno Carvalho
Nuno Carvalho
JCJoão Cachopo
João Cachopo
LRLuís Rodrigues
Luís Rodrigues
ASAntonio Silva
Antonio Silva

12 February 2011 in ACM SIGPLAN Notices
Verified
Journal Article
Open access
PDF file
SFSérgio Miguel Fernandes
Sérgio Miguel Fernandes
JCJoão Cachopo
João Cachopo
Software Transactional Memory (STM) was initially proposed as a lock-free mechanism for concurrency control. Early implementations had efficiency limitations, and soon obstruction-free proposals appeared, to tackle this problem, often simplifying STM implementation. Today, most of the modern and top-performing STMs use blocking designs, relying on locks to ensure an atomic commit operation. This approach has revealed better in practice, in part due to its simplicity. Yet, it may have scalability problems when we move into many-core computers, requiring fine-tuning and careful programming to avoid contention. In this paper we present and discuss the modifications we made to a lock-based multi-version STM in Java, to turn it into a lock-free implementation that we have tested to scale at least up to 192 cores, and which provides results that compete with, and sometimes exceed, some of today's top-performing lock-based implementations. The new lock-free commit algorithm allows write transactions to proceed in parallel, by allowing them to run their validation phase independently of each other, and by resorting to helping from threads that would otherwise be waiting to commit, during the write-back phase. We also present a new garbage collection algorithm to dispose of old unused object versions that allows for asynchronous identification of unnecessary versions, which minimizes its interference with the rest of the transactional system.