Ontology type: schema:Chapter
1997
AUTHORSShin-Mu Tseng , Y. H. Chin , Wei-Pang Yang
ABSTRACTA real-time transaction carries the constraint that it must be completed before its assigned deadline. For some real-time applications, a successfully completed transaction may contribute a value to the system to reflect its profit. Satisfying both constraints of maximizing the totally obtained profits and minimizing the number of missed transactions simultaneously under various system conditions is a challenge. In this paper, we present a dynamic scheduling policy named Dynamic Processor Allocation (DPA) for scheduling value-based transactions in a multiprocessor real-time database system. The DPA policy allocates the processors to both of high-value transactions and urgent transactions dynamically by utilizing the statistical information of the system. Through simulation experiments, DPA is shown to deliver good performance in both maximizing the totally obtained profits and minimizing the number of missed transactions under various system environments. Hence, it resolves the drawbacks of the existing scheduling policies which can deliver good performance only at normal loads or at high loads. More... »
PAGES83-97
Advances in Computing Science — ASIAN'97
ISBN
978-3-540-63875-9
978-3-540-69658-2
http://scigraph.springernature.com/pub.10.1007/3-540-63875-x_45
DOIhttp://dx.doi.org/10.1007/3-540-63875-x_45
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1000231015
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Artificial Intelligence and Image Processing",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Institute of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.",
"id": "http://www.grid.ac/institutes/grid.260539.b",
"name": [
"Institute of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C."
],
"type": "Organization"
},
"familyName": "Tseng",
"givenName": "Shin-Mu",
"id": "sg:person.014462456627.07",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014462456627.07"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.",
"id": "http://www.grid.ac/institutes/grid.38348.34",
"name": [
"Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C."
],
"type": "Organization"
},
"familyName": "Chin",
"givenName": "Y. H.",
"id": "sg:person.015310427073.62",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015310427073.62"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Institute of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.",
"id": "http://www.grid.ac/institutes/grid.260539.b",
"name": [
"Institute of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C."
],
"type": "Organization"
},
"familyName": "Yang",
"givenName": "Wei-Pang",
"id": "sg:person.014374171260.51",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014374171260.51"
],
"type": "Person"
}
],
"datePublished": "1997",
"datePublishedReg": "1997-01-01",
"description": "A real-time transaction carries the constraint that it must be completed before its assigned deadline. For some real-time applications, a successfully completed transaction may contribute a value to the system to reflect its profit. Satisfying both constraints of maximizing the totally obtained profits and minimizing the number of missed transactions simultaneously under various system conditions is a challenge. In this paper, we present a dynamic scheduling policy named Dynamic Processor Allocation (DPA) for scheduling value-based transactions in a multiprocessor real-time database system. The DPA policy allocates the processors to both of high-value transactions and urgent transactions dynamically by utilizing the statistical information of the system. Through simulation experiments, DPA is shown to deliver good performance in both maximizing the totally obtained profits and minimizing the number of missed transactions under various system environments. Hence, it resolves the drawbacks of the existing scheduling policies which can deliver good performance only at normal loads or at high loads.",
"editor": [
{
"familyName": "Shyamasundar",
"givenName": "R. K.",
"type": "Person"
},
{
"familyName": "Ueda",
"givenName": "K.",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/3-540-63875-x_45",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-540-63875-9",
"978-3-540-69658-2"
],
"name": "Advances in Computing Science \u2014 ASIAN'97",
"type": "Book"
},
"keywords": [
"dynamic processor allocation",
"scheduling policies",
"real-time database systems",
"multiprocessor real-time database system",
"real-time constraints",
"real-time transactions",
"real-time applications",
"dynamic scheduling policy",
"high-value transactions",
"better performance",
"database systems",
"processor allocation",
"system environment",
"urgent transactions",
"simulation experiments",
"transactions",
"statistical information",
"system conditions",
"constraints",
"multiprocessors",
"processors",
"deadlines",
"system",
"performance",
"allocation",
"information",
"drawbacks",
"profit",
"environment",
"applications",
"challenges",
"number",
"load",
"policy",
"experiments",
"high load",
"values",
"conditions",
"normal load",
"paper",
"DPA policies"
],
"name": "Dynamic multiprocessor scheduling for supporting real-time constraints",
"pagination": "83-97",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1000231015"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/3-540-63875-x_45"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/3-540-63875-x_45",
"https://app.dimensions.ai/details/publication/pub.1000231015"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:44",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_267.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/3-540-63875-x_45"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-63875-x_45'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-63875-x_45'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-63875-x_45'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-63875-x_45'
This table displays all metadata directly associated to this object as RDF triples.
123 TRIPLES
23 PREDICATES
67 URIs
60 LITERALS
7 BLANK NODES
Subject | Predicate | Object | |
---|---|---|---|
1 | sg:pub.10.1007/3-540-63875-x_45 | schema:about | anzsrc-for:08 |
2 | ″ | ″ | anzsrc-for:0801 |
3 | ″ | schema:author | N422be4938e714c78bfd506cb05d68c2d |
4 | ″ | schema:datePublished | 1997 |
5 | ″ | schema:datePublishedReg | 1997-01-01 |
6 | ″ | schema:description | A real-time transaction carries the constraint that it must be completed before its assigned deadline. For some real-time applications, a successfully completed transaction may contribute a value to the system to reflect its profit. Satisfying both constraints of maximizing the totally obtained profits and minimizing the number of missed transactions simultaneously under various system conditions is a challenge. In this paper, we present a dynamic scheduling policy named Dynamic Processor Allocation (DPA) for scheduling value-based transactions in a multiprocessor real-time database system. The DPA policy allocates the processors to both of high-value transactions and urgent transactions dynamically by utilizing the statistical information of the system. Through simulation experiments, DPA is shown to deliver good performance in both maximizing the totally obtained profits and minimizing the number of missed transactions under various system environments. Hence, it resolves the drawbacks of the existing scheduling policies which can deliver good performance only at normal loads or at high loads. |
7 | ″ | schema:editor | N64981dc647f64d9183f7160ce9b0d6f3 |
8 | ″ | schema:genre | chapter |
9 | ″ | schema:inLanguage | en |
10 | ″ | schema:isAccessibleForFree | false |
11 | ″ | schema:isPartOf | N2ade2ee2bea341029d8a4a784bfe2d52 |
12 | ″ | schema:keywords | DPA policies |
13 | ″ | ″ | allocation |
14 | ″ | ″ | applications |
15 | ″ | ″ | better performance |
16 | ″ | ″ | challenges |
17 | ″ | ″ | conditions |
18 | ″ | ″ | constraints |
19 | ″ | ″ | database systems |
20 | ″ | ″ | deadlines |
21 | ″ | ″ | drawbacks |
22 | ″ | ″ | dynamic processor allocation |
23 | ″ | ″ | dynamic scheduling policy |
24 | ″ | ″ | environment |
25 | ″ | ″ | experiments |
26 | ″ | ″ | high load |
27 | ″ | ″ | high-value transactions |
28 | ″ | ″ | information |
29 | ″ | ″ | load |
30 | ″ | ″ | multiprocessor real-time database system |
31 | ″ | ″ | multiprocessors |
32 | ″ | ″ | normal load |
33 | ″ | ″ | number |
34 | ″ | ″ | paper |
35 | ″ | ″ | performance |
36 | ″ | ″ | policy |
37 | ″ | ″ | processor allocation |
38 | ″ | ″ | processors |
39 | ″ | ″ | profit |
40 | ″ | ″ | real-time applications |
41 | ″ | ″ | real-time constraints |
42 | ″ | ″ | real-time database systems |
43 | ″ | ″ | real-time transactions |
44 | ″ | ″ | scheduling policies |
45 | ″ | ″ | simulation experiments |
46 | ″ | ″ | statistical information |
47 | ″ | ″ | system |
48 | ″ | ″ | system conditions |
49 | ″ | ″ | system environment |
50 | ″ | ″ | transactions |
51 | ″ | ″ | urgent transactions |
52 | ″ | ″ | values |
53 | ″ | schema:name | Dynamic multiprocessor scheduling for supporting real-time constraints |
54 | ″ | schema:pagination | 83-97 |
55 | ″ | schema:productId | N12eb00681c374f5daa396e0cb1258c02 |
56 | ″ | ″ | N6f82a85a0f984088b488c814f667201d |
57 | ″ | schema:publisher | N6acf6276858c41a085aab191b03c2d84 |
58 | ″ | schema:sameAs | https://app.dimensions.ai/details/publication/pub.1000231015 |
59 | ″ | ″ | https://doi.org/10.1007/3-540-63875-x_45 |
60 | ″ | schema:sdDatePublished | 2022-05-10T10:44 |
61 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |
62 | ″ | schema:sdPublisher | Nd8996cc2d3084c4d955163553a7d4631 |
63 | ″ | schema:url | https://doi.org/10.1007/3-540-63875-x_45 |
64 | ″ | sgo:license | sg:explorer/license/ |
65 | ″ | sgo:sdDataset | chapters |
66 | ″ | rdf:type | schema:Chapter |
67 | N12eb00681c374f5daa396e0cb1258c02 | schema:name | doi |
68 | ″ | schema:value | 10.1007/3-540-63875-x_45 |
69 | ″ | rdf:type | schema:PropertyValue |
70 | N2ade2ee2bea341029d8a4a784bfe2d52 | schema:isbn | 978-3-540-63875-9 |
71 | ″ | ″ | 978-3-540-69658-2 |
72 | ″ | schema:name | Advances in Computing Science — ASIAN'97 |
73 | ″ | rdf:type | schema:Book |
74 | N3e7cd7e0f36a45fbbfe7735795d28b31 | rdf:first | sg:person.014374171260.51 |
75 | ″ | rdf:rest | rdf:nil |
76 | N422be4938e714c78bfd506cb05d68c2d | rdf:first | sg:person.014462456627.07 |
77 | ″ | rdf:rest | Ne3cc964e07a34b73ac0795a2c3e954a1 |
78 | N64981dc647f64d9183f7160ce9b0d6f3 | rdf:first | Nbfdb75316e184a248cb1241c11b59d40 |
79 | ″ | rdf:rest | Nee6325a3727c4a74a4584b6e3be614f2 |
80 | N6acf6276858c41a085aab191b03c2d84 | schema:name | Springer Nature |
81 | ″ | rdf:type | schema:Organisation |
82 | N6f82a85a0f984088b488c814f667201d | schema:name | dimensions_id |
83 | ″ | schema:value | pub.1000231015 |
84 | ″ | rdf:type | schema:PropertyValue |
85 | Nbfdb75316e184a248cb1241c11b59d40 | schema:familyName | Shyamasundar |
86 | ″ | schema:givenName | R. K. |
87 | ″ | rdf:type | schema:Person |
88 | Ncd535f7cf903421d870013625c107665 | schema:familyName | Ueda |
89 | ″ | schema:givenName | K. |
90 | ″ | rdf:type | schema:Person |
91 | Nd8996cc2d3084c4d955163553a7d4631 | schema:name | Springer Nature - SN SciGraph project |
92 | ″ | rdf:type | schema:Organization |
93 | Ne3cc964e07a34b73ac0795a2c3e954a1 | rdf:first | sg:person.015310427073.62 |
94 | ″ | rdf:rest | N3e7cd7e0f36a45fbbfe7735795d28b31 |
95 | Nee6325a3727c4a74a4584b6e3be614f2 | rdf:first | Ncd535f7cf903421d870013625c107665 |
96 | ″ | rdf:rest | rdf:nil |
97 | anzsrc-for:08 | schema:inDefinedTermSet | anzsrc-for: |
98 | ″ | schema:name | Information and Computing Sciences |
99 | ″ | rdf:type | schema:DefinedTerm |
100 | anzsrc-for:0801 | schema:inDefinedTermSet | anzsrc-for: |
101 | ″ | schema:name | Artificial Intelligence and Image Processing |
102 | ″ | rdf:type | schema:DefinedTerm |
103 | sg:person.014374171260.51 | schema:affiliation | grid-institutes:grid.260539.b |
104 | ″ | schema:familyName | Yang |
105 | ″ | schema:givenName | Wei-Pang |
106 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014374171260.51 |
107 | ″ | rdf:type | schema:Person |
108 | sg:person.014462456627.07 | schema:affiliation | grid-institutes:grid.260539.b |
109 | ″ | schema:familyName | Tseng |
110 | ″ | schema:givenName | Shin-Mu |
111 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014462456627.07 |
112 | ″ | rdf:type | schema:Person |
113 | sg:person.015310427073.62 | schema:affiliation | grid-institutes:grid.38348.34 |
114 | ″ | schema:familyName | Chin |
115 | ″ | schema:givenName | Y. H. |
116 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015310427073.62 |
117 | ″ | rdf:type | schema:Person |
118 | grid-institutes:grid.260539.b | schema:alternateName | Institute of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C. |
119 | ″ | schema:name | Institute of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C. |
120 | ″ | rdf:type | schema:Organization |
121 | grid-institutes:grid.38348.34 | schema:alternateName | Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C. |
122 | ″ | schema:name | Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C. |
123 | ″ | rdf:type | schema:Organization |