Algorithmic Solutions for Several Offline Constrained Resource Processing and Data Transfer Multicriteria Optimization Problems

In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented techniques are strategies which solve the considered problems (almost) optimally. Thus, the developed algorithms construct intelligent strategies which can be implemented by agents in specific situations. All the described solutions make use of the properties of the considered problems and, thus, they are not applicable to a very general class of problems. However, by considering the specific details of each problem, we were able to obtain very efficient results.

[1]  David Eppstein,et al.  Choosing Subsets with Maximum Weighted Average , 1997, J. Algorithms.

[2]  Mugurel IonuAndreica.  Optimal Scheduling of Two Communication Flows on Multiple Disjoint Packet- Type Aware Paths , 2008 .

[3]  Haim Kaplan,et al.  Sorting signed permutations by reversals, revisited , 2005, J. Comput. Syst. Sci..

[4]  Arjan J. Mooij,et al.  A distributed spanning tree algorithm for topology-aware networks , 2003 .

[5]  Mugurel Ionut Andreica.  Efficient Gaussian Elimination on a 2D SIMD Array of Processors without Column Broadcasts , 2009, ArXiv.

[6]  Nicolae Tapus,et al.  Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling , 2008, 2008 International Symposium on Parallel and Distributed Computing.

[7]  Nicolae Ţăpuş,et al.  A peer-to-peer architecture for multi-path data transfer optimization using local decisions , 2009, WDDM '09.

[8]  Hsueh-I Lu,et al.  An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract , 2003, CIAA.

[9]  Ely Porat,et al.  On the Cost of Interchange Rearrangement in Strings , 2009, SIAM J. Comput..

[10]  Michael Elkin,et al.  A faster distributed protocol for constructing a minimum spanning tree , 2004, SODA '04.

[11]  Atakan Dogan,et al.  Concurrent Scheduling: Efficient Heuristics for Online Large-Scale Data Transfers in Distributed Real-Time Environments , 2006, IEEE Transactions on Parallel and Distributed Systems.

[12]  Nicolae Tapus,et al.  Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees , 2009, ArXiv.

[13]  Mugurel Ionut Andreica,et al.  A fault-tolerant peer-to-peer object storage architecture with multidimensional range search capabilities and adaptive topology , 2009, 2009 IEEE 5th International Conference on Intelligent Computer Communication and Processing.

[14]  Yueping Li,et al.  The Minimum All-Ones Problem for Graphs with Small Treewidth , 2007, COCOA.

[15]  Liu Xianglong,et al.  Predicting Internet Network Distance Using ISOMAP , 2010, 2010 Second International Workshop on Education Technology and Computer Science.

[16]  Pascale Vicat-Blanc Primet,et al.  Scheduling deadline-constrained bulk data transfers to minimize network congestion , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).