The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As a leader in providing video service in US, Comcast provides cloud video service to Americans. Currently, the primary legal interpretation approving cloud video recording in cable-vision decision relies on individual copies for each video recorded. This means every recorded video in the cloud needs its own copy in the data center. Categorizing users by the estimated similar behavior is proposed...
The paper proposes a Log Data Analytics based Scheduling in the Private Cloud environment in order to boost up the probability of launching Virtual Machine successfully. Analytics is applied to the logs maintained by Eucalyptus, a Open Source Cloud Software. The Proposed Methodology focuses on scheduling in the private cloud built with Eucalyptus Cloud Software, so that the proposed Scheduling at...
Elasticity is a key feature of current cloud computing platforms. Dependent on their demand tenants can dynamically scale up and down their applications. To increase their revenue, cloud providers are used to over-provision their clusters, but they still have to reserve capacity to avoid that services get unresponsive and cause SLO violation during bursts. In this paper, we propose CLOUDFARM, a PaaS...
Cloud computing is a new paradigm to deliver computing resources to customers in a pay-as-you-go model. In this paper, the recently emerged container-based virtualization technology is adopted for building the infrastructure of a cloud data center. Cloud providers are concerned with the resource usage in a multi-type resource sharing environment while cloud customers desire higher quality of services...
In this paper, we propose the most efficient server first (MESF) task scheduling scheme to minimize the energy consumed by data-center servers. MESF allocates and schedules tasks to servers according to the energy profile of servers. Energy consumed by data-center servers constitutes the largest portion of the total data-center energy consumption. The proposed MESF scheme uses resource allocation...
The AFDX technology is used as backbone in several aircraft. It offers a high bandwidth (commonly 100Mb/s), and guaranteed per data flow a bound on the network traversal delay, while being a shared resource. To do so, it uses a segregation mechanism, the Virtual Link (VL), designed as a bus abstraction.
Widespread use of SIP as a signalling protocol in VoIP networks is the main reason for tackling various challenges. SIP throughput can severely be degraded when an overload situation happens in the proxy servers due to several retransmissions from user agents. In this paper we try to prevent throughput reduction by properly distributing the loads over available proxy servers. The proposed scheme utilizes...
The large amount of energy used by datacenters impacts both energy cost and the electricity grid. These issues can be mitigated by dynamically adjusting the power demand of datacenters. However, conflicting objectives have to be considered: workload and cooling can be dynamically reduced, but with a potential impact on quality of service or excursions beyond acceptable temperature bands. In this paper...
This work enunciates the task of input stream optimization of user tasks and virtual machines, installed on physical servers in cloud data-centre. Basing on heuristics, offered in this work, in future one can investigate and build effective algorithms for resource assignment in computer systems, built according to “cloud computing” technology.
Nowadays, with the increased deployment of servers to facilitate high performance computing (HPC) for scientific and engineering applications lead to large consumption of energy. Cloud computing is a cost-effective solution, as it allows to host storage, computational and supported network services on a shared infrastructure of physical servers. However, the growing demand of cloud infrastructure...
This paper presents a server-based framework for task overrun management in multi-core real-time systems. Unlike most existing scheduling methods which usually assume a single upper bound of the Worst-Case Execution Time (WCET) for each task, our approach targets scenarios with task overruns. The main idea of our framework is to employ Synchronized Deferrable Servers (SDS) to deal with globally scheduled...
Energy consumption has attracted a lot of attention in the past few years, because energy reduction causes a significant mitigation of the negative impact on the environment along with an operational cost reduction. Energy-efficient task scheduling is an effective technique to decrease the energy consumption in the Cloud Computing Systems (CCSs). In this paper, the problem of scheduling a set of precedence-constrained...
Distributed systems rely in communication networks, typically a bus, in order to exchange messages and fulfill their goals. However, message transmission is subject to interferences that ultimately can lead to message corruption. In systems where a high-reliability is sought, error recovery mechanisms can be deployed in order to give the required reliability level, and this can be done in the spatial...
We propose an architecture for a storage system of surveillance videos. Such systems have to handle massive amounts of incoming video streams and relatively few requests for replay. In such a system load (i.e., Write requests) scheduling is essential to guarantee performance. Large-scale data-storage system (LSDSS) is an emerging hosting facility for video-storage, which has a very high number of...
We consider a system where multiple users are connected to a small cell base station enhanced with computational capabilities. Instead of doing the computation locally at the handset, the users offload the computation of full applications or pieces of code to the small cell base station. In this scenario, this paper provides a strategy to allocate the uplink, downlink, and remote computational resources...
In this paper, we present a new reservation based scheduling framework for soft real-time systems using EDF algorithm (called CARB-EDF). This framework has the features of Capacity Adaptation, Reclaiming and Borrowing. This framework can simplify the initial configuration of the system, where the system designer does not need to provide any estimations of task execution times. We also present a Chebyshev's...
Indexing play an indispensable role in Search Engine. Indexing empower ease of mining of data and lessen the latency of searching a term in huge documents. In this paper, we propose a methodology to index documents in a parallel - distributed manner. Define Metadata structure of a document for indexing; from the metadata, the occurrence of a word shall be ascertained by document wise, page number...
The problem of high energy consumption of data centres has become increasingly serious. Computing and cooling energy are the most significant parts. On one hand, as the energy consumption of under-utilized resources accounts for a substantial amount of the actual energy draw, load consolidation is widely used for reducing computing energy by increasing resource utilization. On the other hand, to avoid...
We describe a new algorithm, called Quasi-Partitioned Scheduling (QPS), capable of scheduling any feasible system composed of independent implicit-deadline sporadic tasks on identical processors. QPS partitions the system tasks into subsets, each of which is either scheduled by EDF on a single processor or by a set of servers on two or more processors. More precisely, QPS uses an efficient scheme...
The Reduction to UNiprocessor (RUN) algorithm represents an original approach to multiprocessor scheduling that exhibits the prerogatives of both global and partitioned algorithms, without incurring the respective drawbacks. As an interesting trait, RUN promises to reduce the amount of migration interference. However, RUN has also raised some concerns on the complexity and specialization of its run-time...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.