A Scheduling Method for Node Relay-based Webcast Considering Reconnection

Gotoh, Yusuke; Yoshihisa, Tomoki; Takahashi, Hideo; Kanazawa, Masanori; Rahayu, Wenny; Chen, Yi‐Ping Phoebe

doi:10.1109/aina.2012.126

Cited by 2 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We previously proposed scheduling methods to reduce waiting time for division-based broadcasting [13], [14]. Contents Cumulated Broadcasting Considering Bandwidth (CCB-CB) method [15] reduces waiting time effectively by acquiring bandwidth identical to the data consumption rate.…”

Section: Related Workmentioning

confidence: 99%

A Scheduling Method to Reduce Waiting Time on Immersive Contents Broadcasting

Gotoh

Yoshihisa

Takahashi

et al. 2012

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

Self Cite

View full text Add to dashboard Cite

Due to the recent popularization of 3-D broadcasting, 3-D broadcasting using an immersive display has been attracted great attention. In conventional 3-D broadcasting, since they watch the image with only the partial region and the view point is fixed, their realistic sensation is low. In immersive contents broadcasting, clients can play data without interruption. When the server delivers immersive contents in broadcasting, since the data size of each content is so large that the waiting time while playing it becomes unrealistic. In this paper, we propose a scheduling method to reduce waiting time on immersive contents broadcasting. In our proposed method, by dividing the immersive content into active immersive data and static immersive data and scheduling them effectively, the waiting time can be reduced.

show abstract

Section: Related Workmentioning

confidence: 99%

A Scheduling Method to Reduce Waiting Time on Immersive Contents Broadcasting

Gotoh

Yoshihisa

Takahashi

et al. 2012

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…To meet deadlines, waiting time is reduced by receiving contents from several nodes. In [8], the authors propose a scheduling method considering reconnection on selective contents delivery with node relay-based web cast that relay data among nodes.…”

mentioning

confidence: 99%

Deadline scheduling for aperiodic tasks in inter-Cloud environments: a new approach to resource management

et al. 2014

View full text Add to dashboard Cite

Aquesta és una còpia de la versió author's final draft d'un article publicat a la revista Journal of supercomputing.La publicació final està disponible a Springer a través de http://dx.doi.org/10.1007/s11227- 014-1285-8 This is a copy of the author 's final draft version of an article published in the journal Journal of supercomputing. Abstract In the big data era, the speed of analytical processing is influenced by the storage and retrieval capabilities to handle large amounts of data. While the distributed crunching applications themselves can yield useful information, the analysts face difficult challenges: they need to predict how much data to process and where, such that to get an optimum data crunching cost, while also respect deadlines and service level agreements within a limited budget. In today's data centers, data processing on demand and data transfers requests coming from distributed applications are usually expressed as aperiodic tasks. In this paper, we challenge the problem of tasks scheduling with deadline constraints of aperiodic tasks within inter-Cloud environments. In massively multithreaded computing systems that deal with data-intensive applications, Hadoop and BaTs tasks arrive periodically, which challenges traditional scheduling approaches previously proposed for supercomputing. Here, we consider the deadline as the main constraint, and propose a method to estimate the number of resources needed to schedule a set of aperiodic tasks, considering both execution and data transfers costs. Starting from classical scheduling techniques, and considering asynchronous tasks handling, we analyze the possibility of decoupling task arriving from task creation, scheduling and execution, sets of actions that can be put into a peer-to-peer relation over a network or over a client-server architecture in the Cloud. Based on a mathematical model, and using different simulation scenarios, we prove the following statements: (1) multiple source of independent aperiodic tasks can be considered similar to a single one; (2) with respect to the global deadline, the tasks migration between different regional centers is the appropriate solution when the number of estimated resources exceed a data center capacity; and (3) in a heterogeneous data center, we need a higher number of resources for the same request in order to respect the deadline constraints. We believe such results will benefit researchers and practitioners alike, who are interested in optimizing the resource management in data centers according to novel challenges coming from next-generation big data applications.

show abstract

A Scheduling Method for Node Relay-based Webcast Considering Reconnection

Cited by 2 publications

References 14 publications

A Scheduling Method to Reduce Waiting Time on Immersive Contents Broadcasting

A Scheduling Method to Reduce Waiting Time on Immersive Contents Broadcasting

Deadline scheduling for aperiodic tasks in inter-Cloud environments: a new approach to resource management

Contact Info

Product

Resources

About