Abstract
Cluster file systems provide access for multiple computing nodes to the same data via a storage area network with the same performance as a local drive. Such clusters allow applications distributed over multiple nodes to access storage via parallel data paths. Also storage management applications can take advantage of this parallelism by distributing the data transfers over multiple nodes. This paper presents an approach for client/server oriented backup solutions. The workload is distributed over multiple client nodes for successive backups to a storage repository server by an adaptive approach. An outlook is given how the method can be applied also for distributing workload of several clients to multiple servers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kaczmarksi, M., Jiang, T., Pease, D.A.: Beyond backup toward storage management. IBM Systems Journal 42(2), 223 (2003)
Tivoli Storage Manager for UNIX. Backup-Archive Client Installation and User Guide, Version 5 Release 2, 4th edn. (2003)
Shen, K., Yang, T., Chu, L.: Cluster Load Balancing for Fine-grain Network Services. In: IEEE Proc. of the Int. Parallel and Distributed Processing Symposium IPDPS 2002, p. 51b (2002)
Thomé, V., Vianna, D., Costa, R., Plastino, A., Filho, O.T.: Exploring Load Balancing in a Scientific SPMD Parallel Application. In: IEEE Proc. Of the Int. Conf. on Parallel Processing Workshops ICPPW 2002, p. 419 (2002)
Tanenhaus, A.: Operating Systems – Design and Implementation. Prentice Hall, Englewood Cliffs (1992)
Schröfel, U.: Separation eines Dateisystembaums zum dynamischen Lastenausgleich, master thesis, University of Paderborn, Germany (2002)
Tivoli Storage Manager for AIX: Administrator’s Guide, Version 5 Release 2, 2nd edn. (2003)
Wanka, R.: Approximationsalgorithmen version 2.1 (2002), http://www.upd.de/cs/agmadh/vorl/Approx02
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of discrete Mathematics 5, 287 (1979)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 263 (1969)
Autonomic computing Overview, IBM research (2003) http://www.research.ibm.com/autonomic/overview/faqs.html
Akelbein, J.-P.: Ein Massenspeicher mit höherer logischer Schnittstelle – Design und Analyse, PhD thesis, University of the federal Armed Forces, Hamburg, Shaker Verlag (1998)
Akelbein, J.P., Schröfel, U.: A method for adaptively assigning of data management applications to data objects, patent application 02019559.0, European patent office (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akelbein, JP., Schröfel, U. (2004). Adaptive Workload Balancing for Storage Management Applications in Multi Node Environments. In: Müller-Schloer, C., Ungerer, T., Bauer, B. (eds) Organic and Pervasive Computing – ARCS 2004. ARCS 2004. Lecture Notes in Computer Science, vol 2981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24714-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-24714-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21238-6
Online ISBN: 978-3-540-24714-2
eBook Packages: Springer Book Archive