Multi-scheduler concurrency control for parallel database systems

Sushant Goel; Hema Sharda; David Taniar

doi:10.1007/978-3-540-39425-9_75

Multi-scheduler concurrency control for parallel database systems

Sushant Goel, Hema Sharda, David Taniar

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

1 Citation (Scopus)

Abstract

Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still remains one of the major issues. Concurrency control algorithms used by PDS uses single scheduler approach. Single scheduler approach has some inherent weaknesses such as - very big lock tables, overloaded centralized scheduler and more number of messages in the system. In this paper we investigate the possibility of multiple schedulers and conclude that single scheduler algorithms cannot be migrated in the present form to multi-scheduler environment. Next, we propose a Multi-Scheduler Concurrency Control algorithm for PDS that distributes the scheduling responsibilities to the respective Processing Elements. Correctness of the proposed algorithm is then discussed using a different serializability criterion - Parallel Database Quasi-Serializability.

Original language	English
Title of host publication	Advanced Parallel Processing Technologies
Subtitle of host publication	5th International Workshop, APPT 2003 Xiamen, China, September 17-19, 2003 Proceedings
Editors	Xingming Zhou, Stefan Jähnichen, Ming Xu, Jiannong Cao
Place of Publication	Berlin Germany
Publisher	Springer
Pages	643-654
Number of pages	12
ISBN (Print)	3540200541
DOIs	https://doi.org/10.1007/978-3-540-39425-9_75
Publication status	Published - 2003
Event	International Workshop in Advanced Parallel Processing Technologies 2003 - Xiamen, China Duration: 17 Sep 2003 → 19 Sep 2003 Conference number: 5th https://link-springer-com.ezproxy.lib.monash.edu.au/book/10.1007/b13582 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2834
ISSN (Print)	0302-9743

Conference

Conference	International Workshop in Advanced Parallel Processing Technologies 2003
Abbreviated title	APPT 2003
Country	China
City	Xiamen
Period	17/09/03 → 19/09/03
Internet address	https://link-springer-com.ezproxy.lib.monash.edu.au/book/10.1007/b13582 (Proceedings)

Access to Document

10.1007/978-3-540-39425-9_75

Link to publication in Scopus

Cite this

Goel, S., Sharda, H., & Taniar, D. (2003). Multi-scheduler concurrency control for parallel database systems. In X. Zhou, S. Jähnichen, M. Xu, & J. Cao (Eds.), Advanced Parallel Processing Technologies: 5th International Workshop, APPT 2003 Xiamen, China, September 17-19, 2003 Proceedings (pp. 643-654). (Lecture Notes in Computer Science; Vol. 2834). Springer. https://doi.org/10.1007/978-3-540-39425-9_75

Goel, Sushant ; Sharda, Hema ; Taniar, David. / Multi-scheduler concurrency control for parallel database systems. Advanced Parallel Processing Technologies: 5th International Workshop, APPT 2003 Xiamen, China, September 17-19, 2003 Proceedings. editor / Xingming Zhou ; Stefan Jähnichen ; Ming Xu ; Jiannong Cao. Berlin Germany : Springer, 2003. pp. 643-654 (Lecture Notes in Computer Science).

@inproceedings{6fbedfa7bb424d58ad311975c44f280b,

title = "Multi-scheduler concurrency control for parallel database systems",

abstract = "Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still remains one of the major issues. Concurrency control algorithms used by PDS uses single scheduler approach. Single scheduler approach has some inherent weaknesses such as - very big lock tables, overloaded centralized scheduler and more number of messages in the system. In this paper we investigate the possibility of multiple schedulers and conclude that single scheduler algorithms cannot be migrated in the present form to multi-scheduler environment. Next, we propose a Multi-Scheduler Concurrency Control algorithm for PDS that distributes the scheduling responsibilities to the respective Processing Elements. Correctness of the proposed algorithm is then discussed using a different serializability criterion - Parallel Database Quasi-Serializability.",

author = "Sushant Goel and Hema Sharda and David Taniar",

year = "2003",

doi = "10.1007/978-3-540-39425-9_75",

language = "English",

isbn = "3540200541",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "643--654",

editor = "Xingming Zhou and Stefan J{\"a}hnichen and Ming Xu and Jiannong Cao",

booktitle = "Advanced Parallel Processing Technologies",

note = "International Workshop in Advanced Parallel Processing Technologies 2003, APPT 2003 ; Conference date: 17-09-2003 Through 19-09-2003",

url = "https://link-springer-com.ezproxy.lib.monash.edu.au/book/10.1007/b13582",

}

Goel, S, Sharda, H & Taniar, D 2003, Multi-scheduler concurrency control for parallel database systems. in X Zhou, S Jähnichen, M Xu & J Cao (eds), Advanced Parallel Processing Technologies: 5th International Workshop, APPT 2003 Xiamen, China, September 17-19, 2003 Proceedings. Lecture Notes in Computer Science, vol. 2834, Springer, Berlin Germany, pp. 643-654, International Workshop in Advanced Parallel Processing Technologies 2003, Xiamen, China, 17/09/03. https://doi.org/10.1007/978-3-540-39425-9_75

Multi-scheduler concurrency control for parallel database systems. / Goel, Sushant; Sharda, Hema; Taniar, David.

Advanced Parallel Processing Technologies: 5th International Workshop, APPT 2003 Xiamen, China, September 17-19, 2003 Proceedings. ed. / Xingming Zhou; Stefan Jähnichen; Ming Xu; Jiannong Cao. Berlin Germany : Springer, 2003. p. 643-654 (Lecture Notes in Computer Science; Vol. 2834).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Multi-scheduler concurrency control for parallel database systems

AU - Goel, Sushant

AU - Sharda, Hema

AU - Taniar, David

N1 - Conference code: 5th

PY - 2003

Y1 - 2003

N2 - Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still remains one of the major issues. Concurrency control algorithms used by PDS uses single scheduler approach. Single scheduler approach has some inherent weaknesses such as - very big lock tables, overloaded centralized scheduler and more number of messages in the system. In this paper we investigate the possibility of multiple schedulers and conclude that single scheduler algorithms cannot be migrated in the present form to multi-scheduler environment. Next, we propose a Multi-Scheduler Concurrency Control algorithm for PDS that distributes the scheduling responsibilities to the respective Processing Elements. Correctness of the proposed algorithm is then discussed using a different serializability criterion - Parallel Database Quasi-Serializability.

AB - Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still remains one of the major issues. Concurrency control algorithms used by PDS uses single scheduler approach. Single scheduler approach has some inherent weaknesses such as - very big lock tables, overloaded centralized scheduler and more number of messages in the system. In this paper we investigate the possibility of multiple schedulers and conclude that single scheduler algorithms cannot be migrated in the present form to multi-scheduler environment. Next, we propose a Multi-Scheduler Concurrency Control algorithm for PDS that distributes the scheduling responsibilities to the respective Processing Elements. Correctness of the proposed algorithm is then discussed using a different serializability criterion - Parallel Database Quasi-Serializability.

UR - http://www.scopus.com/inward/record.url?scp=35248836488&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-39425-9_75

DO - 10.1007/978-3-540-39425-9_75

M3 - Conference Paper

AN - SCOPUS:35248836488

SN - 3540200541

T3 - Lecture Notes in Computer Science

SP - 643

EP - 654

BT - Advanced Parallel Processing Technologies

A2 - Zhou, Xingming

A2 - Jähnichen, Stefan

A2 - Xu, Ming

A2 - Cao, Jiannong

PB - Springer

CY - Berlin Germany

T2 - International Workshop in Advanced Parallel Processing Technologies 2003

Y2 - 17 September 2003 through 19 September 2003

ER -

Goel S, Sharda H, Taniar D. Multi-scheduler concurrency control for parallel database systems. In Zhou X, Jähnichen S, Xu M, Cao J, editors, Advanced Parallel Processing Technologies: 5th International Workshop, APPT 2003 Xiamen, China, September 17-19, 2003 Proceedings. Berlin Germany: Springer. 2003. p. 643-654. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-540-39425-9_75