Search
Now showing items 1-10 of 14
Overrun-freeness verification of Rate-Monotonic Least-Splitting Real-Time Scheduler on Multicores
Abstract—In real-time task scheduling, semi-partitioning
allows some tasks to be split into portions and each portion to
be assigned to a different core. This improves the performance
of system but by ...
Workflow Scheduling on the Hybrid Cloud to Maintain Data Privacy under Deadline Constraint
The development of cloud computing technology has been continuously growing since its invention and has attracted the attention of many researchers in the academia and the industry, particularly during the recent years. ...
Safety Verification of Rate-Monotonic Least-Splitting Real-Time Scheduler on Multiprocessor System
In real-time task scheduling on multiprocessor systems, partitioning approach has received the attention of many researchers because of its higher least upper bound utilization of safe systems. Semi-partitioning allows ...
Scheduling Hard Real-time Tasks on Multi-core using Intelligent Rate-monotonic
Recently, researchers have applied semipartitioned
approaches to improve performance of hard
real-time scheduling algorithms in multiprocessor
architectures. RMLS is one of these methods. However,
Graph-based Partitioning of Ontology with Semantic Similarity
Ontology partitioning is a good solution to overcome challenges of large ontologies such as reusability, scalability, complexity and maintenance. The languages of ontology such as OWL do not allow partial reuse and one ...
Modularization of Graph-Structured Ontology with Semantic Similarity
Modularization is a key requirement to manage the size and complexity
of large ontologies by replacing each one by a set of smaller ontologies.
Two reasons for this requirement are that current ontology ...
Assignment Look-ahead HEFT for Scheduling Workflows of Communicating Tasks
cheduling scientific workflows of communicating tasks is the process of mapping tasks of the workflow to the cloud resources and directly or indirectly determining when to execute each task. Different objectives such as ...
A Novel Deadline-Constrained Scheduling to Preserve Data Privacy in Hybrid Cloud
Cloud computing is always facing privacy and
security challenges and this makes the enterprises and the
research organizations hesitate to utilize the Cloud
technology. Therefore without appropriate ...
الگوریتم زمانبندی در محاسبات ابری ترکیبی برپایه افزایش محرمانگی داده ها
در این مقاله زمانبندی جریان کاری با وظایف حساس و غیرحساس مورد بررسی قرارگرفته و الگوریتمی ارایه شده که وظایف حساس را روی ابر خصوصی و بقیه را روی ابر عمومی زمانبندی کند. عملکرد الگوریتم با الگوریتم های مشابه مقایسه شده است
A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power
processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality ...