<?xml version="1.0" encoding="UTF-8"?><lom xmlns="http://ltsc.ieee.org/xsd/LOM" xmlns:lomfr="http://www.lom-fr.fr/xsd/LOMFR" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://ltsc.ieee.org/xsd/LOM http://www.lom-fr.fr/xsd/lomfrv1.0/std/lomfr.xsd">
<general>
<identifier>
<catalog>Canal-U_Ocms</catalog>
<entry>40511</entry>
</identifier>
<title><string language="fre"><![CDATA[Adding Concurrency to Smart Contracts]]></string></title>
<language>ENG</language>
<description>
<string language="fre"><![CDATA[Modern cryptocurrency systems, such as Ethereum,
permit complex financial transactions through scripts called *smart contracts*.
These smart contracts are executed many, many times, always without
concurrency. First, smart contracts are serially executed before being recorded
on the blockchain, and once recorded, they are serially re-executed whenever it
is necessary to check that the blockchain is correct. Such serial execution
limits system throughput and fails to exploit today's concurrent multicore and
cluster architectures.
This talk presents a novel way to permit miners and validators to execute smart
contracts in parallel. A party attempting to add a smart contract to the
blockchain executes multiple smart contracts speculatively, in parallel, thus
``discovering'' a serializable concurrent schedule for those transactions. This
schedule is captured and encoded as a parallel but deterministic fork-join
program used by later validators to re-execute those transactions concurrently
and securely.
Experiments show non-trivial speedup with even a small number of cores.
Joint work with Thomas Dickerson, Eric Koskinen, and Paul Gazzillo.]]></string></description>
<keyword><string language="fre"><![CDATA[cryptocurrence]]></string></keyword><keyword><string language="fre"><![CDATA[contrat intelligent]]></string></keyword><keyword><string language="fre"><![CDATA[Ethereum]]></string></keyword>
<lomfr:documentType>
<lomfr:source>LOMFRv1.0</lomfr:source>
<lomfr:value>image en mouvement</lomfr:value>
</lomfr:documentType>
</general><lifeCycle>
<contribute>
<role>
<source>LOMv1.0</source>
<value>publisher</value>
</role>
<entity><![CDATA[BEGIN:VCARD
VERSION:3.0
CLASS:PUBLIC
REV:2021-09-16 17:52:57
FN:INRIA (Institut national de recherche en informatique et automatique)
N:INRIA (Institut national de recherche en informatique et automatique);;;;
URL;TYPE=work:http://www.inria.fr/
ROLE:publisher
TZ:+0200
END:VCARD
]]></entity>
<date><dateTime>2017-05-05</dateTime></date>
</contribute>
<contribute>
<role>
<source>LOMv1.0</source>
<value>author</value>
</role>
<entity><![CDATA[BEGIN:VCARD
VERSION:3.0
CLASS:PUBLIC
REV:2021-09-16 17:52:57
FN:Maurice HERLIHY
N:HERLIHY;Maurice;;;
URL;TYPE=work:https://www.canal-u.tv/auteurs/herlihy_maurice
ROLE:author
TZ:+0200
END:VCARD
]]></entity>
<date><dateTime>2017-05-05</dateTime></date>
</contribute>
</lifeCycle>
<metaMetadata>
<metadataSchema>LOMv1.0</metadataSchema>
<metadataSchema>LOMFRv1.0</metadataSchema>
</metaMetadata>
<technical>
<format>video/mp4</format>
<location><![CDATA[https://www.canal-u.tv/video/inria/adding_concurrency_to_smart_contracts.40511]]></location>
<location><![CDATA[https://streaming-canal-u.fmsh.fr/vod/media/canalu/videos/fuscia/adding.concurrency.to.smart.contracts_40511/talk.mauriceherlihy.workshopmichelraynal.5mai2017.mp4]]></location>
<size>373393468</size>
<duration><duration>PT0H44M8S</duration></duration>
</technical>
<educational>
<learningResourceType>
<source>LOMv1.0</source>
<value>lecture</value>
</learningResourceType>
<context>
<source>LOMv1.0</source>
<value>master</value>
</context>
<context>
<source>LOMv1.0</source>
<value>doctorat</value>
</context>
</educational>
<rights>
<cost>
<source>LOMv1.0</source>
<value>no</value>
</cost>
<copyrightAndOtherRestrictions>
<source>LOMv1.0</source>
<value>no</value>
</copyrightAndOtherRestrictions>
<description>
<string language="fre"><![CDATA[Droits réservés à l'éditeur et aux auteurs. 
Document libre, dans le cadre de la licence Creative Commons (http://creativecommons.org/licenses/by-nd/2.0/fr/), citation de l'auteur obligatoire et interdiction de désassembler (paternité, pas de modification).]]></string>
</description>
</rights>
<relation>
<kind>
<source>LOMv1.0</source>
<value>ispartof</value>
</kind>
<resource>
<identifier>
<catalog>URI</catalog>
<entry>https://www.canal-u.tv/producteurs/inria/seminaires_scientifiques/international_workshop_on_distributed_computing_in_the_honor_of_michel_raynal</entry>
</identifier>
<description>
<string language="fre"><![CDATA[International Workshop on Distributed Computing in the honor of Michel Raynal]]></string>
</description>
</resource>
</relation>
<classification>
<purpose>
<source>LOMv1.0</source>
<value>discipline</value>
</purpose>
<taxonPath>
<source>
<string language="fre"><![CDATA[Universités Numériques Thématiques 2009 http://www.universites-numeriques.fr]]></string>
</source>
<taxon>
<id/>
<entry>
<string language="fre"/>
</entry>
</taxon>
</taxonPath>
</classification>
<classification>
<purpose>
<source>LOMv1.0</source>
<value>discipline</value>
</purpose>
<taxonPath>
<source>
<string language="fre">CDD 22e éd.</string>
<string language="eng">DDC 22nd ed.</string>
</source>
<taxon>
<id>004.36</id>
<entry>
<string language="fre"><![CDATA[Distributed processing]]></string>
</entry>
</taxon>
</taxonPath>
<taxonPath>
<source>
<string language="fre">CDD 22e éd.</string>
<string language="eng">DDC 22nd ed.</string>
</source>
<taxon>
<id>005.276</id>
<entry>
<string language="fre"><![CDATA[informatique distribuée]]></string>
</entry>
</taxon>
</taxonPath>
</classification> </lom>