• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 42
  • 7
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 68
  • 68
  • 32
  • 19
  • 13
  • 10
  • 10
  • 10
  • 10
  • 10
  • 9
  • 9
  • 8
  • 8
  • 8
  • 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.
11

Architecting energy efficient servers

Kgil, Tae Ho. January 1900 (has links)
Thesis (Ph.D.)--University of Michigan, 2007. / Adviser: Trevor N. Mudge. Includes bibliographical references.
12

Empirical study of error behavior in Web servers

Singh, Ajay Deep. January 2005 (has links)
Thesis (M.S.)--West Virginia University, 2005. / Title from document title page. Document formatted into pages; contains vi, 47 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 41-45).
13

Characterization of Web server workload

Sangle, Amit. January 1900 (has links)
Thesis (M.S.)--West Virginia University, 2005. / Title from document title page. Document formatted into pages; contains viii, 80 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 79-80).
14

Mechanisms for provisioning quality of service in web servers

Chan, Ka Ho 01 January 2008 (has links)
No description available.
15

Document replication and distribution algorithms for load balancing ingeographically distributed web server systems

Zhuo, Ling, 卓玲 January 2002 (has links)
published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy
16

Adaptive multimedia content delivery for scalable web servers

Pradhan, Rahul. January 2001 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: multimedia; content adaptation; scalable web server. Includes bibliographical references (p. 68-74).
17

An open-source and Java-technologies approach to Web applications /

Siripala, Seksit. January 2003 (has links) (PDF)
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2003. / Thesis advisor(s): Neil C. Rowe, Gary L. Kreeger. Includes bibliographical references (p. 121-122). Also available online.
18

Function-based condition indexing for guyed communication towers

Tulasi, Devi Prasad. January 2005 (has links)
Thesis (M.S.)--University of Missouri-Columbia, 2005. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (January 24, 2007) Includes bibliographical references.
19

Server selection for heterogeneous cloud video services

Chang, He 01 January 2017 (has links)
Server selection is an important problem of cloud computing in which cloud service providers direct user demands to servers in one of the multiple data centers located in different geographical locations. The existing solutions usually assume homogeneity of cloud services (i.e., all users request the same type of service) and handle user demands in an individual basis which incurs high computational overhead. In this study, we propose a new and effective server selection scheme in which diversities of cloud services are taken into account. We focus on a specific cloud service, i.e., online video service, and assume that different videos have different bandwidth requirements. We group users into clusters and handle user demands on a cluster basis for faster and more efficient process. Firstly, we assume that user demands and bandwidth capacities of servers are given in the data centers, our problem is to assign the user demands to the servers under the bandwidth constraint, such that the overall latency (measured by the network distance) between the user clusters and the selected servers is minimized. We design a server selection system and formulate this problem as a linear programming formulation which can be solved by existing techniques. The system periodically executes our scheme and computes an optimal solution for server selection. User demands are assigned to the servers according to the optimal solution and the minimum overall latency can be achieved. The simulation results show that our scheme is significantly better than the random algorithm and the YouTube server selection strategy. Based on the first part, we take the storage capacities of servers constraint into consideration. In the second part, our new problem is to assign the user demands to the servers under the bandwidth and storage constraint, such that the function of overall latency (measured by the network distance) between the user clusters and the selected servers and standard deviation of traffic load of every server in the system is minimized. We design a server selection system and formulate this problem which can be solved by existing techniques. User demands are assigned to the servers according to the optimal solution and the two goals (minimum overall latency and the most balanced traffic load) can be achieved. The simulation results show the influence of different weights of these two goals on the user demands assigning.
20

Document distribution algorithms for distributed web servers

伍頌斌, Ng, Chung-pun. January 2002 (has links)
published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy

Page generated in 0.0879 seconds