• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Efficient Bandwidth Reservation Strategies for Data Movements on High Performance Networks

Zuo, Liudong 01 August 2015 (has links)
Many next-generation e-science applications require fast and reliable transfer of large volumes of data, now frequently termed as ``big data", with guaranteed performance, which is typically enabled by the bandwidth reservation service in high-performance networks (HPNs). Users normally specify the properties and requirements of their data transfers in the bandwidth reservation requests (BRRs), and want to make bandwidth reservations on the HPNs to satisfy the requirements of their data transfers. The challenges of the bandwidth reservation arise from the requirements desired by both the users and the bandwidth reservation service providers of the HPNs. We focus on two important bandwidth reservation problems formulated from the combinations of the requirements from both users and the bandwidth reservation service providers of the HPNs: (i) Problem of scheduling all BRRs in one batch while achieving their best average data transfer earliest completion time and shortest duration, and (ii) Problem of scheduling two generic types of BRRs concerning data transfer reliability with different objectives and constraints in unreliable HPNs that are subject to node and link failures. We prove the two subproblems of the first problem are NP-complete problems, and fast and efficient heuristic algorithms are proposed. While the two subproblems of the second problem can be optimally solved in polynomial time. The corresponding optimal algorithms and proofs are given. We conduct extensive simulations to compare the performance of the proposed heuristic and optimal algorithms with naive scheduling algorithms and the algorithms currently used in production network in various performance metrics. The performance superiority of the proposed heuristic and optimal algorithms is verified.
2

Opravné položky - procyklické chování bank / Creation of provisions - Pro-cyclical behavior of banks

Matějovská, Anna January 2013 (has links)
In relation to the latest economic crisis much attention was paid to the bank capital requirements. Many papers discuss the pro-cyclical effect of these capital requirements and the options of how to stabilize the banking industry and financial system. In this thesis I researched another instrument which can cause the pro-cyclical effect - the loan loss provisions. In reaction to this issue the Spanish central bank has adopted the model of dynamic provisioning which acts counter-cyclically. This model is supposed to balance the amount of created provisions and banks' profit over the time. In this thesis I introduce a hypothetical situation in which the countries using the Euro currency adopted the model of dynamic provisioning and I examine the hypothesis that the adoption of this model would mitigate the latest economic crisis as the banks would achieve higher profits during the time of recession. Based on the conducted research I confirmed my hypothesis and conclude that the dynamic provisioning would balance the economic swings. However, the results also showed that the set-up of dynamic provisions model is crucial. In order to make the model efficient the model coefficients have to be precisely determined by central banks or individual banks and approved by independent supervisors. Keywords...

Page generated in 0.1427 seconds