Heuristics for Scheduling Data Requests Using Collective Communications in a Distributed Communication Network

Theys, Mitchell D.; Siegel, Howard Jay; Chong, Edwin K. P.

doi:10.1006/jpdc.2001.1753

Cited by 9 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [4], the authors introduce a wide range of algorithmic techniques for scheduling data transfers in tree networks. Several heuristic methods for data request scheduling were presented in [5]. A scheduling model based on bandwidth reservations for critical data transfers was introduced in [6].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Decision optimization techniques for efficient delivery of multimedia streams

Andreica

Țăpuș

2009

2009 International Symposium on Signals, Circuits and Systems

View full text Add to dashboard Cite

Abstract-With the amount of available multimedia data increasing world-wide and with the expanding need for rapid access to this data, efficient data delivery has become a significant problem for which no fully satisfactory solutions have been provided, yet. A major issue is the concurrent usage of the same bottleneck network resources by multiple communication flows. In the case of multimedia streams, which consist of large volumes of data being transferred over usually long periods of time, and which require strict quality of service guarantees, this problem is even more acute. In this paper we present several decision support and optimization techniques for one of the most common types of solutions employed nowadays -advance resource reservations.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

Decision optimization techniques for efficient delivery of multimedia streams

Andreica

Țăpuș

2009

2009 International Symposium on Signals, Circuits and Systems

View full text Add to dashboard Cite

show abstract

“…Several extensions of the FAP have been studied for static networks such as the data allocation problem (DAP) [1], the data replication problem (DRP) [27], the data staging problem (DSP) [35,36], and video allocation problem (VAP) [25]. All of the above mentioned methods and problem formulations are related to the ADRP, because all address the improvement of data accessibility by replicating data items.…”

Section: Related Workmentioning

confidence: 99%

A game theoretical data replication technique for mobile ad hoc networks

Khan

Maciejewski

Siegel

et al. 2008

2008 IEEE International Symposium on Parallel and Distributed Processing

Self Cite

View full text Add to dashboard Cite

show abstract

“…One technical objective of the MSHN project was to design, prototype, and refine a mapping system as part of a distributed resource management system that leverages the heterogeneity of resources and workload to deliver the requested qualities of service [20,59]. One aspect of the AICE and BADD programs involved designing a scheduling system for forwarding data items prior to their use as inputs to a local application in a wide area network distributed computing environment [79,78]. The AICE, BADD, and MSHN environments are similar in that, in some situations, not all applications or communication requests can be completed with their most preferred qualities of service by their deadlines.…”

mentioning

confidence: 99%

Characterizing Resource Allocation Heuristics for Heterogeneous Computing Systems

Ali¹,

Braun²,

Siegel³

et al. 2005

Advances in Computers

Self Cite

View full text Add to dashboard Cite

In many distributed computing environments, collections of applications need to be processed using a set of heterogeneous computing (HC) resources to maximize some performance goal. An important research problem in these environments is how to assign resources to applications (matching) and order the execution of the applications (scheduling) so as to maximize some performance criterion without violating any constraints. This process of matching and scheduling is called mapping.1Howard Jay Siegel holds a joint appointment in the Computer Science Department as well. 2Albert I. Reuther is currently with MIT Lincoln Laboratory, Lexington, MA. CHARACTERIZING RESOURCE ALLOCATION HEURISTICSTo make meaningful comparisons among mapping heuristics, a system designer needs to understand the assumptions made by the heuristics for (1) the model used for the application and communication tasks, (2) the model used for system platforms, and (3) the attributes of the mapping heuristics. This chapter presents a three-part classification scheme (3PCS) for HC systems. The 3PCS is useful for researchers who want to (a) understand a mapper given in the literature, (b) describe their design of a mapper more thoroughly by using a common standard, and (c) select a mapper to match a given real-world environment.

show abstract

Heuristics for Scheduling Data Requests Using Collective Communications in a Distributed Communication Network

Cited by 9 publications

References 18 publications

Decision optimization techniques for efficient delivery of multimedia streams

Decision optimization techniques for efficient delivery of multimedia streams

A game theoretical data replication technique for mobile ad hoc networks

Characterizing Resource Allocation Heuristics for Heterogeneous Computing Systems

Contact Info

Product

Resources

About