@misc {26489,
	title = {Data-Intensive Computing on Cross-Clouds},
	howpublished = {Gj{\o}vik, Norway},
	year = {2019},
	type = {NTNU CCIS Seminar},
	abstract = {Clouds offer significant advantages over traditional cluster computing architectures including flexibility, high-availability, ease of deployments, and on-demand resource allocation - all packed up in an attractive pay-as-you-go economic model for the users. However, cloud users are often forced into vendor lock-in due to the use of incompatible APIs, cloud-specific services, and complex pricing models used by the cloud service providers (CSPs). Cloud management platforms (CMPs), supporting hybrid and multi-cloud deployments, offer an answer by providing a unified abstract interface to multiple cloud platforms. Nonetheless, modelling applications to use multi-clouds, automated resource selection based on the user requirements from various available CSPs, cost optimization, security, and runtime adaptation of deployed applications and services still remain a challenge.In this talk, I{\textquoteright}ll give an introduction to Melodic, which is a middleware platform for Cross-Cloud data-intensive applications. The Melodic platform enables data-intensive applications to run within defined security, cost, and performance boundaries seamlessly on geographically distributed and federated cloud infrastructures. Melodic thereby realizes the potential of heterogeneous cloud environments for big data and data-intensive applications by transparently taking advantage of distinct characteristics of available private and public clouds, dynamically optimize resource utilization, consider data locality, conform to the user{\textquoteright}s privacy needs and service requirements, and counter vendor lock-in.},
	author = {Zahid, Feroz and Horn, Geir}
}
@misc {26472,
	title = {Tutorial: Good Bye Vendor Lock-in: Getting your Cloud Applications Multi-Cloud Ready!},
	year = {2019},
	publisher = {ACM IEEE},
	address = {The 19th IEEE/ACM International Symposium in Cluster, Cloud, and Grid Computing (CCGrid)},
	abstract = {Clouds offer significant advantages over traditional cluster computing architectures including flexibility, high-availability, ease of deployments, and on-demand resource allocation - all packed up in an attractive \emph{pay-as-you-go} economic model for the users. However, cloud users are often forced into vendor lock-in due to the use of incompatible APIs, cloud-specific services, and complex pricing models used by the cloud service providers (CSPs). Cloud management platforms (CMPs), supporting hybrid and multi-cloud deployments, offer an answer by providing a unified abstract interface to multiple cloud platforms. Nonetheless, modelling applications to use multi-clouds, automated resource selection based on the user requirements from various available CSPs, cost optimization, security, and runtime adaptation of deployed applications and services still remain a challenge.\&nbsp;In this tutorial, we provide a practical introduction to the multi-cloud application modelling, configuration, deployment, and adaptation. We survey existing CMPs, compare their features, modelling methods, and, not the least, provide a practical hands-on training for getting your applications ready for the multi-clouds using selected tools. By the end of this tutorial, attendees should be able to understand various tools and technologies available for the multi-clouds, and prepared to spin-off their first multi-cloud ready application.},
	author = {Zahid, Feroz and Horn, Geir and Kritikos, Kyriakos and R{\'o}{\.z}a{\'n}ska, Marta}
}
@article {26197,
	title = {Future Cloud Systems Design: Challenges and Research Directions},
	journal = {IEEE Access},
	volume = {6},
	year = {2018},
	pages = {74120 - 74150},
	publisher = {IEEE},
	abstract = {Cloud computing has been recognized as the de facto computing utility standard for hosting and delivering services over the Internet. Cloud platforms are being rapidly adopted by business owners and end-users thanks to its many superiorities to traditional computing models such as cost saving, scalability, unlimited storage, anytime anywhere access, better security, and high fault-tolerance capability. However, despite the fact that clouds offer huge opportunities and services to the ICT industry, the landscape of cloud computing research is being expanded due to several reasons, such as emerging data-intensive applications, multicloud deployment models, and more strict non-functional requirements on cloud-based services. In this paper, we study a comprehensive taxonomy of main cloud computing research areas, discuss state-of-the-art approaches for each area and the associated sub-areas, and highlight the challenges and future directions per research area. The survey framework, presented in this paper, provides useful insights and outlook for the cloud computing research and development, allows broader understanding of the design challenges of cloud computing, and sheds light on the future of this fast-growing computing paradigm.},
	doi = {10.1109/ACCESS.2018.2883149},
	author = {Taherkordi, Amir and Zahid, Feroz and Verginadis, Yiannis and Horn, Geir}
}
@phdthesis {24199,
	title = {An Interdiciplinary Approach to Optimisation in Parallel Computing},
	year = {2012},
	month = {08/12},
	author = {Horn, Geir}
}
@article {24485,
	title = {Solving Multiconstraint Assignment Problems Using Learning Automata},
	journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) },
	volume = {40},
	year = {2010},
	pages = {6-18},
	publisher = {IEEE},
	doi = {10.1109/TSMCB.2009.2032528},
	author = {Horn, Geir and Oommen, John}
}
@article {Simula.ND.269,
	title = {A Comprehensive Solution for Application-Level Adaptation},
	journal = {Software: Practice and Experience},
	number = {Published online},
	year = {2009},
	publisher = {ACM},
	abstract = {Driven by the emergence of mobile and pervasive computing, there is a growing demand for context-aware software systems that can dynamically adapt to their run-time environment. We present the results of project MADAM that has delivered a comprehensive solution for the development and operation of context-aware, self-adaptive aplications. The main contributions of MADAm are (a) a sophisticated middleware that supports the dynamic adaptation of component-based applications, and (b) an innovative model-driven development methodology that is based on abstract adaptation models and corresponding model\_to-code transformations. MADAM has demonstrated the viability of a general, integrated approach to application-level adaptation. We discuss our experiences with two real-world case studies that were built using the MADAM approach.},
	isbn = {1097-024X},
	doi = {10.1002/spe.900},
	author = {Geihs, Kurt and Barone, Paolo and Eliassen, Frank and Floch, Jacqueline and Fricke, Rolf and Gj{\o}rven, Eli and Svein O. {Hallsteinsen} and Horn, Geir and Owais Mohammad {Khan} and Mamelli, Alessandro and George A. {Papadopoulos} and Paspallis, Nearchos and Reichle, Roland and Stav, Erlend}
}
@article {24494,
	title = {A comprehensive solution for application-level adaptation},
	journal = {Software - Practice and Experience},
	volume = {39},
	year = {2009},
	pages = {385-422},
	publisher = {John Wiley \& Sons},
	doi = { 10.1002/spe.900},
	author = {Geihs, Kurt and Barone, Paolo and Eliassen, Frank and Floch, Jacqueline and Fricke, Rolf and Gj{\o}rven, Eli and Hallsteinsen, Svein and Horn, Geir and Muhammad Uzair {Khan} and Mamelli, Alessandro and Reichle, Roland and Stav, Erlend}
}
@article {Musunoori.2007.1,
	title = {Application Service Placement in Stochastic Grid Environments Using Learning and Ant Based Methods},
	journal = {Multi Agent and Grid Systems},
	volume = {3},
	number = {1},
	year = {2007},
	note = {Special Issue on Nature Inspired Systems for Parallel, Asynchronous and Decentralised Environments},
	pages = {19-41},
	abstract = {Achieving acceptable application performance in a grid environment remains a difficult challenge. In particular this is true for applications composed of services requiring some quality requirements to be fulfilled in order to satisfy users{\textquoteright} needs. The problem considered here is partitioning of application services onto the available execution nodes of grid environment in such a way that they satisfy some minimum quality requirements. Fundamentally this is an NP-hard problem. In this paper we propose three algorithms that are the first ones to be based on the concepts of learning automata and the metaphor of foraging ants. The algorithms naturally follow a decentralised multi-agent method for solving the service partitioning problem. Moreover they establish a distributed problem solving mechanism that does not require the use of a central controller. The proposed algorithms have been rigorously tested and evaluated through extensive simulations on randomly generated application services and grid environments. The results indicate that learning is an essential component to achieve scalability and efficiency in nature inspired systems.},
	author = {Sharath Babu {Musunoori} and Horn, Geir}
}
@inproceedings {Musunoori.2007.3,
	title = {Co-Ordination in Intelligent Ant-Based Application Service Mapping in Grid Environments},
	journal = {IEEE Swarm Intelligence Symposium (SIS 2007)},
	year = {2007},
	month = {April},
	pages = {303-309},
	publisher = {IEEE Computer Society Press},
	type = {Conference},
	isbn = {1-4244-0708-7},
	author = {Sharath Babu {Musunoori} and Horn, Geir}
}
@article {Horn.2006.1,
	title = {An Empirical Comparison of Generators for Self Similar Simulated Traffic},
	journal = {Performance Evaluation},
	volume = {64},
	number = {2},
	year = {2007},
	month = {February},
	pages = {162-190},
	abstract = {It is generally recognised that aggregated network traffic is self similar and that self similar traffic models should be used in simulation experiments when assessing the performance of a network. Many generators have been proposed to synthetically produce self similar simulation input; however most of them require the trace length to be known a priori. Four generators that allow continuous generation of self similar time series are evaluated in this work with respect to their ability to reproduce the desired level of self similarity. This extensive investigation uses ten times as many traces and twice the number of parameter values as previously reported. Three of the tested generators perform well but surprisingly the generator supplied with a widely used commercial network simulator is unusable. The reported results indicate that the generator based on multiplexing strictly alternating ON/OFF sources may perform better than generators based on chaotic maps, provided that more than 100 ON/OFF sources can be used. Three estimators for the degree of self similarity of a time series have been evaluated as part of the process, and the only acceptable is based on a Wavelet decomposition of the traffic trace.},
	author = {Horn, Geir and Kvalbein, Amund and Blomsk{\o}ld, Joakim and Nilsen, Erlend}
}
@inproceedings {Musunoori.2007.2,
	title = {Unintelligent Guided Ant-Based Solution to the Application Service Mapping Problem in a Grid Environment},
	journal = {International Conference on Computing: Theory and Applications (ICCTA 2007), March 5-7, Kolkata, India},
	year = {2007},
	month = {March},
	pages = {170-175},
	publisher = {IEEE Computer Society Press},
	type = {Conference},
	address = {Los Alamitos, CA, USA},
	isbn = {0-7695-2770-1},
	author = {Sharath Babu {Musunoori} and Horn, Geir}
}
@inproceedings {Musunoori.2006.3,
	title = {Ant-Based Approach to the Quality Aware Application Service Partitioning in a Grid Environment},
	journal = {2006 IEEE Congress on Evolutionary Computation (CEC 2006), July 16-21, Vancouver, BC, Canada},
	year = {2006},
	month = {July},
	pages = {2604-2611},
	publisher = {IEEE, ISBN 0-7803-9487-9},
	type = {1},
	author = {Sharath Babu {Musunoori} and Horn, Geir}
}
@inproceedings {Musunoori.2006.2,
	title = {On the Challenge of Allocating Service Based Applications in a Grid Environment},
	journal = {International Conference on Autonomic and Autonomous Systems (ICAS 2006), July 19-21, Silicon Valley, USA},
	year = {2006},
	month = {July},
	publisher = {IEEE Computer Society Press, ISBN 0-7695-2653-5},
	type = {1},
	author = {Sharath Babu {Musunoori} and Horn, Geir and Eliassen, Frank and Alia, Mourad},
	editor = {Dini, Petre and Ayed, Dhouha and Dini, Cosmin and Berbers, Yolande}
}
@inproceedings {Alia.2006.1,
	title = {A Component-Based Planning Framework for Adaptive Systems},
	journal = {8th International Symposium on Distributed Objects and Applications (DOA)},
	year = {2006},
	month = {November},
	pages = {1686-1704},
	publisher = {Springer},
	type = {Conference},
	abstract = {In recent times, many researchers have focused on designing generic and reusable middlewares to overcome the complexity in building adaptive systems. There is a general agreement that the openness provided by componentbased approahes coupled with reflection mechanisms is the minimum prerequisites for supporting dynamic reconfigurations. However, this is not sufficient to implement the heart of the adaptation loop namely the decision making on the required reconfiguration that adapts the system in a given context. In this regard, this paper proposes a planning framework that subsumes and automates the decision-making in reflective component-based adaptive systems. The salient feature of this framework is to model the variability of the adaptive system as a set of variation points at which alternative component compositions and implementations can be selected. to form an application configuration. The selection of a feasible configuration in a given context is based on the concept of component wise utility functions that estimates the user benefit of including a specific implementation alternative at a variation point in the composition. We show that the selection problem can be modelled as a multi constraint shortest path that can be found in polynomial time. Our approach is validated through a real world example implementing adaptive scenarios in the domain of mobile computing.},
	isbn = {3-540-48274-1},
	author = {Alia, Mourad and Horn, Geir and Eliassen, Frank and Mohammad Ullah {Khan} and Fricke, Rolf and Reichle, Roland},
	editor = {Meersman, Robert and Tari, Zahir}
}
@inproceedings {Musunoori.2006.4,
	title = {Intelligent Ant-Based Solution to the Application Service Partitioning Problem in a Grid Environment},
	journal = {The 6th International Conference on Intelligent Systems Design and Applications (ISDA{\textquoteright}06), October16-18, Jinan, Shandong, China},
	year = {2006},
	month = {October},
	pages = {416-422},
	publisher = {IEEE Computer Society},
	type = {Conference},
	address = {Los Alamitos, CA, USA},
	abstract = {This paper presents a decentralised multi-agent method based the metaphor of foraging intelligent ants, for solving the problem of application service partitioning onto the execution nodes of the grid environment such that all services of the application satisfy some minimum quality requirements. Fundamentally this an NP-hard problem. The proposed algorithms have been rigorously tested and evaluated through extensive simulations on randomly generated application services and grid environment. The results show that intelligent ants perform significantly better than what could be achieved with simple unintelligent random ants.},
	isbn = {0-7695-2528-8},
	author = {Sharath Babu {Musunoori} and Horn, Geir},
	editor = {Ajith Abraham Yu {Chen}}
}
@inproceedings {Sodring.2006.1,
	title = {A Statistical Approach to Traffic Management in Source Routed Loss-Less Networks},
	journal = {The 2006 International Conference on High Performance Computing and Communications},
	year = {2006},
	month = {9},
	pages = {190-199},
	publisher = {Springer},
	type = {Conference},
	address = {New York},
	abstract = {The evolution of high-performance networks has resulted in the development of new applications with Quality of Service (QoS) requirements. In this paper we review and evaluate the Simple Host(SH) traffic management mechanism that enables QoS provisioning within source-routed loss-less interconnect networks. SH provides statistical QoS guarantees for brokered multimedia traffic while supporting limited amounts of unbrokered background traffic. The results obtained from simulation show how to configure SH to provide statistical QoS based on jitter and latency requirements in an efficient manner.},
	isbn = {3-540-39368-4},
	author = {Thomas John {S{\o}dring} and Horn, Geir and Martinez, Raul},
	editor = {Gerndt, Michael and Kranz{\"u}ller, Dieter}
}
@inproceedings {Musunoori.2005.2,
	title = {A Fixed-Structure Learning Automaton Solution to the Quality Aware Application Service Configuration in a Grid Environment},
	journal = {Proceedings of the 17th International Conference on Parallel and Distributed Computing and Systems (PDCS 2005), November 14-16, Phoenix, AZ, USA},
	year = {2005},
	pages = {7-12},
	publisher = {ACTA Press, ISBN 0-88986-527-2},
	type = {1},
	author = {Sharath Babu {Musunoori} and Horn, Geir},
	editor = {Zheng, S.Q.}
}
@inproceedings {Horn.2005.1,
	title = {A Fixed-Structure Learning Automaton Solution to the Stochastic Static Mapping Problem},
	journal = {Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005)},
	year = {2005},
	month = {April},
	pages = {297b-297b},
	publisher = {IEEE},
	type = {1},
	address = {Denver, Colorado, USA, April 3-8},
	abstract = {This paper considers the problem of distributing the processes of a parallel application onto a set of computing nodes. This problem called the Static Mapping Problem (SMP) is known to be NP-Hard, and has been tackled using heuristic solutions. The objective of this paper is to present the first reported Learning Automaton (LA) based solution to the SMP, generated by the close resemblance of the SMP to the equipartitioning problem. The LA in question is of the so-called Fixed-Structure family, solution to the equipartitioning problem is then modified to solve the SMP. Several algorithmic variants of this solution have been implemented, and these have all been rigorously tested and evaluated through extensive simulations on randomly generated parallel applications. The focus in this work is to demonstrate the applicability of LA to the SMP, not to optimise and evaluate the performance of the proposed strategy. The results presented here clearly demonstrate that LA provide a promising tool that can effectively solve the mapping problem.},
	author = {Horn, Geir and Oommen, John},
	editor = {H. J. {Siegel} and David A. {Bader} and Gaudiot, Jean-Luc}
}
@inproceedings {Frost-urstad.2005.1,
	title = {Frogs in a Wheelbarrow? the Role and Challenges of the Project Manager Throughout the Life Cycle of a European Union Funded R\&D Project From the Proposal to the Completion Stage},
	journal = {PMI Global Congress EMEA 2005, Edinburg, Scotland, May 23-25},
	year = {2005},
	month = {May},
	publisher = {Project Management Institute (PMI)},
	type = {1},
	chapter = {PER 03 Session 2},
	address = {EMEA Service Centre, 300, Avenue Tervueren, B-1150 Brussels, Belgium, http://www.pmi.org},
	abstract = {The paper highlights the unique role of the project manager engaged in an EU funded R\&D project. The challenges have a dual facet. Project management skill is particularly demanding due to the necessity of pulling together a project proposal based on the wishes and desires of from six to thirty consortium partners. This is in addition to handling the language and cultural barriers of the partners that come from diverse countries and disciplines. Most tasks are conducted in a virtual project setting via the Internet. The project manager must at all times adhere to the rules and regulations of the CEC, the Commission of the European Communities, which are stringent and uncompromising regarding reporting and project control, as well as release of funds. The Brussels based Project Officer autocratically represents the EC with full decisive power over the project and thus autocratically represents the primary EC stakeholder. Languages and cultural barriers of the partners from diverse countries and disciplines are daunting.},
	author = {Joan Frost {Urstad} and Davis, Kim and Horn, Geir}
}
@inproceedings {Horn.2005.6,
	title = {Generalised Pursuit Learning Automata for Non-Stationary Environments Applied to the Stochastic Static Mapping Problem},
	journal = {The 11th International onference on Information Systems Analysis and Synthesis (ISAS 2005) and The 2nd International Conference on Cybernetics and Information Technologies, Systems and Applications (CITSA 2005)},
	year = {2005},
	note = {ISBN 980-6560-42-6},
	month = {July},
	pages = {91-97},
	publisher = {International Institute of Informatics and Systemics (IIIS)},
	type = {1},
	edition = {Volume 1},
	address = {Orlado, Florida, USA July 14-17},
	abstract = {In this paper, we propose the first variable-structure Learning-Automata (LA) based approach to solve the Stochastic Static Mapping Problem (SMP). The problem is known to be NP-hard and involves distributing the processes of a parallel application onto a set of computing nodes. Our solution has salient characteristics novel to both the fields of LA and process allocation. Thus, while the solution attempts to optimise the inter-process communication costs and the workload allocated to each machine, it achieves this without artificially generating potential pairings which are to be used by our previous fixed-structure LA-based solution. Furthermore, unlike all the reported estimator-based LA, we propose the utilization of the recently introduced weak estimators suitable for non-stationary environments. We report the results obtained by simulating our algorithm on various problems where the number of processes and nodes is "small". In each case, the accuracy of the strategy to converge to a feasible partitioning is remarkable - sometimes even as high as 96\%. We are currently investigating how the current solution can be enhanced to be rendered scalable.},
	author = {Horn, Geir and Oommen, John},
	editor = {Aguilar, Jos{\'e} and Chu, Hsing-Wei and St-Amand, Johnny and Galkin, Ivan and Chantzimisios, Periklis}
}
@misc {Horn.2005.4,
	title = {A New Science for Digital Ecosystems?},
	howpublished = {http://digital-ecosystems.org/events/2005.05/workshop_3ya2.html},
	year = {2005},
	note = {This is an invited talk at the workshop organised by the European Commission 18th May 2005, CCAB / 3D, Centre Albert Borchette, Rue Froissart 36, Brussels: "Towards a network of digital ecosystems: which technology, which research and which instruments? Review of the technology and research activities needs". The official position paper resulting from the workshop can be found at http://digital-ecosystems.org/events/2005.05/de\_position\_paper\_vf.pdf},
	month = {May},
	abstract = {The research on Digital Ecosystems is inspired by the evolution of biologic ecosystems. This easily leads to the conclusion that the science needed to analyse and model these system has to be new and does not exist. This talk challenges this view arguing that the toolbox of science build over the ages is sufficient, and it emphasise a thorough approach to build lasting results. The claim is that we do not yet understand the business ecosystems, and consequently we can no transpose it to the digital world. A new theory is needed integrating results from socio-economic research on the role of the regional and national governments in facilitating and stimulating growth; a better understanding of dynamically evolving complex systems; and finally knowledge of what drives business collaboration and the interaction of SMEs with in a global marketplace.},
	author = {Horn, Geir}
}
@inproceedings {Horn.2005.2,
	title = {SH: a Simple Distributed Bandwidth Broker for Source-Routed Loss-Less Networks},
	journal = {Computer, Networks and Information Security , Phoenix, USA, November 14-16 2005},
	year = {2005},
	month = {11},
	publisher = {IASTED},
	type = {1},
	abstract = {This paper presents SH (Simple Host), a new and relatively simple method to deal with bandwidth brokering within a loss-less and source routed network, where a percentage of the traf{fi}c can be regarded as background noise. It achieves this by categorizing two types of {fl}ows within a network and provides end-to-endbandwidth brokering for one while accepting that the other simply consumes a limited and de terminate amount of bandwidth. To exemplify our proposal we detail how it could be applied to the recently standard ized Advanced Switching speci{fi}cation.},
	author = {Horn, Geir and S{\o}dring, Thomas}
}
@inproceedings {Horn.2005.3,
	title = {SH: a Simple Distributed Bandwidth Broker for Source-Routed Loss-Less Networks},
	journal = {Proceedings of the IASTED International Conference on Computer, Networks and Information Security (CNIS), November 14-16, Phoenix, AZ, USA},
	year = {2005},
	month = {11},
	pages = {133-139},
	publisher = {ACTA Press, ISBN 0-88986-537-X},
	type = {1},
	abstract = {This paper presents SH (Simple Host), a new and relatively simple method to deal with bandwidth brokering within a loss-less and source routed network, where a percentage of the traf{fi}c can be regarded as background noise. It achieves this by categorizing two types of {fl}ows within a network and provides end-to-endbandwidth brokering for one while accepting that the other simply consumes a limited and de terminate amount of bandwidth. To exemplify our proposal we detail how it could be applied to the recently standard ized Advanced Switching speci{fi}cation.},
	author = {Horn, Geir and S{\o}dring, Thomas},
	editor = {Hamza, M.H.}
}
@misc {Horn.2005.5,
	title = {Themes for the Future... (MADAM \& MUSIC FP7 Position Statement)},
	howpublished = {Misc},
	year = {2005},
	note = {The presentation was given at the Consultation Workshop on "Future Service Platforms and Software Development Technologies" organised by the European Commission 7 December in Brussels for the Technology Pillar "Software, Grids, security and dependability" of ICT Theme of the FP7 proposal. Participation to the workshop was by invitation only.},
	month = {December},
	abstract = {The position statement postulates that the key areas for research over the next ten years in Framework Programme 7 will be on simplification and reliability of complex systems making them socially accpetable when the focus shifts from the individual user to groups. Making systems self configurable and autonomic may contradict the user{\textquoteright}s desire to be able to control the digital environment.},
	author = {Horn, Geir}
}
