Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Memorial University of Newfoundland

$20,000.00

Atomicity and consistency issues in service composition and transactional memory

EF 2014-15

Résumé
The concept of transactions has been fundamental for providing fault tolerance, reliability and robustness for database applications. Over the years, researchers have been trying to achieve similar transactional guarantees for other, non-database, applications. This proposal is concerned with incorporating transactional properties for services in the area of Services Computing and for memory operations in the area of Transactional Memory. A transaction is an execution of a program. It is committed when the execution is complete and successful. Otherwise, it is aborted and partial execution, if any, is rolled back. Thus, a transaction is an atomic unit. Each transaction, when executed alone, is assumed to be correct. A concurrent execution of several transactions is taken to be correct when the execution is equivalent to some serial execution of the same transactions. In Services Computing, the general vision is that services can be (i) described in an implementation-independent and ``semantic'' fashion, (ii) published in generally accessible repositories, (iii) found in standard ways, by clients, (iv) composed into new services fitting their needs, and (v) executed by referring back to the service providers behind their selection. Composite services may further be composed into higher level services. ``Black box'' services are gradually replaced by services whose executions can be monitored and even controlled (in a limited way) by consumers. My research aims at incorporating transactional properties for such services to enable flexible and dynamic compositions. In Transactional Memory, memory operations are grouped into atomic units. Demarcation into atomic units is intended to free the programmers from explicit synchronization of different units using locks, critical sections, etc. Nesting of the atomic units occurs naturally, with procedure calls. I propose to work on characterizing correct concurrent executions of atomic units and on compositional properties. The ultimate goal is to make concurrent programming easy. This will facilitate increasing the speed of computation, especially in multi-core machines.
Programme
Discovery Grants Program - Individual
Emplacement
Newfoundland and Labrador, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
3182-2011
Name nom
Vidyasankar, Krishnamurthy
Department département
Computer Science
Organization id
89
Institution établissement
Memorial University of Newfoundland
Province en
Newfoundland and Labrador
Province fr
Terre-Neuve-et-Labrador
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2011
Award amount
20000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2704
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Distributed and parallel processing
Research subject fr
Traitement réparti et simultané
Partie
4
Nb partie
5
Application title
Atomicity and consistency issues in service composition and transactional memory
Keyword
NSERC
Application summary
The concept of transactions has been fundamental for providing fault tolerance, reliability and robustness for database applications. Over the years, researchers have been trying to achieve similar transactional guarantees for other, non-database, applications. This proposal is concerned with incorporating transactional properties for services in the area of Services Computing and for memory operations in the area of Transactional Memory. A transaction is an execution of a program. It is committed when the execution is complete and successful. Otherwise, it is aborted and partial execution, if any, is rolled back. Thus, a transaction is an atomic unit. Each transaction, when executed alone, is assumed to be correct. A concurrent execution of several transactions is taken to be correct when the execution is equivalent to some serial execution of the same transactions. In Services Computing, the general vision is that services can be (i) described in an implementation-independent and ``semantic'' fashion, (ii) published in generally accessible repositories, (iii) found in standard ways, by clients, (iv) composed into new services fitting their needs, and (v) executed by referring back to the service providers behind their selection. Composite services may further be composed into higher level services. ``Black box'' services are gradually replaced by services whose executions can be monitored and even controlled (in a limited way) by consumers. My research aims at incorporating transactional properties for such services to enable flexible and dynamic compositions. In Transactional Memory, memory operations are grouped into atomic units. Demarcation into atomic units is intended to free the programmers from explicit synchronization of different units using locks, critical sections, etc. Nesting of the atomic units occurs naturally, with procedure calls. I propose to work on characterizing correct concurrent executions of atomic units and on compositional properties. The ultimate goal is to make concurrent programming easy. This will facilitate increasing the speed of computation, especially in multi-core machines.