Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Experimental Design
Experimental Results
Related Work
Conclusions
References
All Topics
Computer Science
Distributed Systems

Grid load balancing using intelligent agents

Profile image of Stephen JarvisStephen Jarvis

2005, Future Generation Computer Systems

https://doi.org/10.1016/J.FUTURE.2004.09.032
visibility

…

description

14 pages

link

1 file

Abstract

Workload and resource management are essential functionalities in the software infrastructure for grid computing. The management and scheduling of dynamic grid resources in a scalable way requires new technologies to implement a next generation intelligent grid environment. This work demonstrates that AI technologies can be utilised to achieve effective workload and resource management. A combination of intelligent agents and multi-agent approaches is applied for both local grid resource scheduling and global grid load balancing. Each agent is a representative of a local grid resource and utilises predictive application performance data and iterative heuristic algorithms to engineer local load balancing across multiple hosts. At a higher level of the global grid, agents cooperate with each other to balance workload using a peer-to-peer service advertisement and discovery mechanism. A case study is included with corresponding experimental results to demonstrate that intelligent agents are effective to achieve resource scheduling and load balancing, improve application execution performance and maximise resource utilisation.

Related papers

A Multi-agent Task Delivery System for Balancing the Load in Collaborative Grid Environment
Pilar Herrero

2009

This paper focuses on improving load balancing algorithms in grid environments by means of multi-agent systems. The goal is endowing the environment with an efficient scheduling, taking into account not only the computational capabilities of resources but also the task requirements and resource configurations in a given moment. In fact, task delivery makes use of a Collaborative/Cooperative Awareness Management Model (CAM) which provides information of the environment. Next, a Simulated Annealing based method (SAGE) which optimizes the process assignment. Finally, a historic database which stores information about previous cooperation/collaborations in the environment aiming to learn from experience and infer to obtain more suitable future cooperation/collaboration. The integration of these three subjects allows agents define a system to cover all the aspects related with load-balancing problem in collaborations grid environment.

View PDFchevron_right
Adaptive negotiation for agent-based grid computing
Hamada H. Ghenniwa

2002

The Grid concept has recently emerged as a vision for future network based computing, by enabling seamless integration of computing systems and clusters, data storage, specialized networks and sophisticated analysis and visualization software. Intelligent agents can play an important role in helping achieve the Grid vision. Although agents have been applied to computing load balancing for many years, attempts to apply intelligent agents in realizing the Grid vision have been made by academic researchers during the past few years. Due to the highly heterogeneous and complex computing environments, effective load balancing for Grid computing is a very difficult problem, even though intelligent agents are used. In this paper we attempt to highlight major challenges in managing resources in a Grid computing environment and present some of our recent work on adaptive negotiation strategies for agent-based load balancing and Grid computing. The proposed approach is to implement multiple negotiation models/protocols/strategies that can be selected by the system automatically to adapt to computation needs as well as changing computing resource environment.

View PDFchevron_right
A hybrid load balancing strategy of sequential tasks for grid computing environments
Maode Ma

Future Generation Computer Systems, 2009

Agent paradigm has been sucessfully used in a large number of diverse fields and initiatives. One of this initiative is the definition of MAPFS, a parallel file system based on a multiagent architecture. The use of a multiagent system implies coordination and cooperation among its agents. MAPFS is intended for clusters of workstations, where the agent technology is applied in order to provide a communication model between agents with different roles. The adaptation of MAPFS to a grid environment is named MAPFS-Grid. This paper describes the conceptual agent framework and the communication model used in the design and development of MAPFS-Grid, which provides the management of data resources in a grid environment.

View PDFchevron_right
Dynamic Load Balancing with Multi-Agent System for Grid Computing Service Middleware
Vishnu Kumar Prajapati

The policy in dynamic load balancing, when the transfer policy and selection policy are combine in new migration policy then the internal communication are reduce. By using multi agent system and workload system manager the overall time reduced in place of token based load balancing strategy. The hierarchical architecture of grid computing service middleware achieves good load balancing and resource utilization. The modified grid computing service architecture reduces the layer upper layer, middle layer and lover layer.

View PDFchevron_right
Dynamic Load Balancing Policy with Communication Andcomputation Elements in Grid Computing with Multi-Agent System Integration
Bakri Yahaya

International journal of new computer architectures and their applications, 2011

The policy in dynamic load balancing, classification and function are variety based on the focus study for each research. They are different but employing the same strategy to obtain the load balancing. The communication processes between policies are explored within the dynamic load balancing and decentralized approaches. At the same time the computation processes also take into consideration for further steps. Multi-agent system characteristics and capabilities are explored too. The unique capabilities offered by multi-agent systems can be integrated or combined with the structure of dynamic load balancing to produce a better strategy and better load balancing algorithm.

View PDFchevron_right
Utilizing Jini Features to Implement a Multiagent Framework for Performance-based Resource Allocation in Grid Environment
Sarbani Roy

2006

Jini is able to support applications in heterogeneous, dynamic computing environments and is also being used to develop agent-based applications. This paper presents the design of a multiagent framework for resource brokering and management in a Grid environment and implementation of a part of it utilizing Jini features. The multiagent framework provides services like resource brokering and allocation, analysis of performance-monitoring data, local tuning of applications and also rescheduling in case of any performance problem on a specific resource provider. Part of the framework makes use of mobile agents for scheduling and rescheduling purposes.

View PDFchevron_right
Resource Management in Grids: Overview and a discussion of a possible approach for an Agent-Based Middleware
Richard Olejnik

Computational Science, Engineering & Technology Series, 2009

Resource management and job scheduling are important research issue in computational Grids. When software agents are used as resource managers and brokers in the Grid a number of additional issues and possible approaches materialize. The aim of this chapter is twofold. First, we discuss traditional job scheduling in Grids, and when agents are utilized as Grid middleware. Second, we use this as a context for discussion of how job scheduling can be done in the agent-based system under development.

View PDFchevron_right
A Hierarchical Load Balancing Policy for Grid Computing Environment
said elzoghdy

International Journal of Computer Network and Information Security, 2012

With the rapid development of high-speed wide-area networks and powerful yet low-cost computational resources, grid computing has emerged as an attractive computing paradigm. It provides resources for solving large scientific applications. It is typically composed of heterogeneous resources such as clusters or sites at different administrative domains connected by networks with widely varying performance characteristics. The service level of the grid software infrastructure provides two essential functions for workload and resource management. To efficiently utilize the resources at these environments, effective load balancing and resource management policies are fundamentally important. This paper addresses the problem of load balancing and task migration in grid computing environments. We propose a fully decentralized two-level load balancing policy for computationally intensive tasks on a heterogeneous multi-cluster grid environment. It resolves the single point of failure problem which many of the current policies suffer from. In this policy, any site manager receives two kinds of tasks namely, remote tasks arriving from its associated local grid manager, and local tasks submitted directly to the site manager by local users in its domain, which makes this policy closer to reality and distinguishes it from any other similar policy. It distributes the grid workload based on the resources occupation ratio and the communication cost. The grid overall mean task response time is considered as the main performance metric that need to be minimized. The simulation results show that the proposed load balancing policy improves the grid overall mean task response time.

View PDFchevron_right
Task Load Balancing Strategy for Grid Computing
Belabbas Yagoubi, Y. Slimani

Journal of Computer Science, 2007

Workload and resource management are two essential functions provided at the service level of the grid software infrastructure. To improve the global throughput of these software environments, workloads have to be evenly scheduled among the available resources. To realize this goal several load balancing strategies and algorithms have been proposed. Most strategies were developed in mind, assuming homogeneous set of sites linked with homogeneous and fast networks. However for computational grids we must address main new issues, namely: heterogeneity, scalability and adaptability. In this paper, we propose a layered algorithm which achieve dynamic load balancing in grid computing. Based on a tree model, our algorithm presents the following main features: (i) it is layered; (ii) it supports heterogeneity and scalability; and, (iii) it is totally independent from any physical architecture of a grid.

View PDFchevron_right
Multi-agent support for Internet-scale Grid management
Frances Brazier

Proceedings of the AISB’02 Symposium on AI and Grid Computing, 2002

Internet-scale computational grids are emerging from various research projects. Most notably are the US National Technology Grid and the European Data Grid projects. One specific problem in realizing wide-area distributed computing environments as proposed in these projects, is effective management of the vast amount of resources that are made available within the grid environment. This paper proposes an agent-based approach to resource management in grid environments, and describes an agent infrastructure that ...

View PDFchevron_right

References (42)

  1. A. Abraham, R. Buyya, and B. Nath, Nature's heuristics for scheduling jobs on computational grids, in: Proceedings of 8 th IEEE International Conference on Advanced Computing and Communications (Cochin, India, 2000).
  2. D. Abramson, R. Sosic, J. Giddy, and B. Hall, Nimrod: a tool for performing parameterized simulations using distributed workstations, in: Proceedings 4 th IEEE International Symposium on High Performance Distributed Computing (HPDC '95) (Pentagon City, VA, USA, 1995).
  3. D. Abramson, J. Giddy, and L. Kotler, High performance parametric modelling with Nimrod/G: killer application for the global grid, in: Proceedings 14 th International Parallel and Distributed Processing Symposium (Cancun, Mexico, 2000).
  4. K. Amold, B. O'Sullivan, R. Scheifer, J. Waldo, and A. Woolrath, The Jini™ Specification (Addison Wesley, 1999).
  5. F. Berman, R. Wolski, S. Figueira, J. Schopf, and G. Shao, Application-level scheduling on distributed heterogeneous networks, in: Proceedings
  6. Supercomputing '96 (Pittsburgh, PA, USA, 1996).
  7. F. Berman, A. J. G. Hey, and G. Fox, Grid Computing: Making The Global Infrastructure a Reality (John Wiley & Sons, 2003).
  8. C. Brooks, B. Tierney, and W. Johnston, JAVA agents for distributed system management, LBNL Report (1997).
  9. J. Cao, D. J. Kerbyson, E. Papaefstathiou, and G. R. Nudd, Performance modelling of parallel and distributed computing using PACE, in: Proceedings of 19 th IEEE International Performance, Computing and Communication Conference (IPCCC '00) (Phoenix, AZ, USA, 2000) pp. 485-492.
  10. J. Cao, D. J. Kerbyson, and G. R. Nudd, Dynamic application integration using agent-based operational administration, in: Proceedings of 5 th International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM '00) (Manchester, UK, 2000) pp. 393-396.
  11. Cao, D. J. Kerbyson, and G. R. Nudd, High performance service discovery in large-scale multi-agent and mobile-agent systems, International Journal of Software Engineering and Knowledge Engineering 11(5) (2001) 621-641.
  12. J. Cao, D. J. Kerbyson and G. R. Nudd, Use of agent- based service discovery for resource management in metacomputing environment, in: Proceedings of 7 th International Euro-Par Conference (Manchester, UK, 2001), Lecture Notes on Computer Science Volume 2150 pp. 882-886.
  13. J. Cao, D. J. Kerbyson, and G. R. Nudd, Performance evaluation of an agent-based resource management infrastructure for grid computing, in: Proceedings of 1 st IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid '01) (Brisbane, Australia, 2001) pp. 311-318.
  14. J. Cao, D. P. Spooner, J. D. Turner, S. A. Jarvis, D. J. Kerbyson, S. Saini, and G. R. Nudd, Agent-based resource management for grid computing, in: Proceedings of 2 nd Workshop on Agent-based Cluster and Grid Computing (AgentGrid '02) (Berlin, Germany, 2002) pp. 350-351.
  15. J. Cao, S. A. Jarvis, S. Saini, D. J. Kerbyson, and G. R. Nudd, ARMS: an agent-based resource management system for grid computing, Scientific Programming (Special Issue on Grid Computing) 10(2) (2002) 135- 148.
  16. J. Cao, S. A. Jarvis, D. P. Spooner, J. D. Turner, D. J. Kerbyson, and G. R. Nudd, Performance prediction technology for agent-based resource management in grid environments, in: Proceedings of 11 th IEEE Heterogeneous Computing Workshop (HCW '02) (Fort Lauderdale, FL, USA, 2002).
  17. J. Cao, D. P. Spooner, S. A. Jarvis, S. Saini, and G. R. Nudd, Agent-based grid load balancing using performance-driven task scheduling, in: Proceedings of 17 th IEEE International Parallel and Distributed Processing Symposium (IPDPS '03) (Nice, France, 2003).
  18. H. Casanova, and J. Dongarra, Using agent-based software for scientific computing in the NetSolve system, Parallel Computing 24(12-13) (1998) 1777-1790.
  19. H. Casanova, and J. Dongarra, Applying NetSolve's network-enabled server, IEEE Computational Science & Engineering 5(3) (1998) 57-67.
  20. I. Foster and C. Kesselman, Globus: a metacomputing infrastructure toolkit, International Journal of High Performance Computing Applications 2 (1997) 115-128.
  21. I. Foster and C. Kesselman, The GRID: Blueprint for a New Computing Infrastructure (Morgan-Kaufmann, 1998).
  22. I. Foster, C. Kesselman, J. M. Nick, and S. Tuecke, Grid services for distributed system integration, IEEE Computer 35(6) (2002) 37-46.
  23. J. Frey, T. Tannenbaum, M. Livny, I. Foster, and S. Tuecke, Condor-G: a computation management agent for multi-institutional grids, Cluster Computing 5(3) (2002) 237-246.
  24. A. Grimshaw, W. A. Wulf, and the Legion team, The Legion vision of a worldwide virtual computer, Communications of the ACM 40(1) (1997) 39-45.
  25. L. Henderson, Job scheduling under the Portable Batch System, in: Proceeding of 1 st Workshop on Job Scheduling Strategies for Parallel Processing (Santa Barbara, CA, USA, 1995), Lecture Notes in Computer Science Volume 949 pp. 279-294.
  26. D. Jackson, Q. Snell, and M. Clement, Core algorithms of the Maui scheduler, in: Proceedings of 7 th Workshop on Job Scheduling Strategies for Parallel Processing (Cambridge, MA, USA, 2001), Lecture Notes Computer Science Volume 2221 pp 87-102.
  27. N. R. Jennings and M. J. Wooldridge (eds), Agent Technology: Foundations, Applications, and Markets (Springer Verlag, 1998).
  28. D. Lifka, The ANL/IBM SP scheduling system, in: Proceeding of 1 st Workshop on Job Scheduling Strategies for Parallel Processing, 9 th IEEE International Parallel Processing Symposium (Santa Barbara, CA, USA, 1995), Lecture Notes in Computer Science Volume 949 pp. 187- 191.
  29. M. Litzkow, M. Livny, and M. Mutka, Condor -a hunter of idle workstations, in: Proceedings of 8 th International Conference on Distributed Computing Systems (ICDCS '88) (San Jose, CA, USA, 1988) pp. 104-111.
  30. L. Moreau, Agents for the grid: a comparison for web services (part 1: the transport layer), in: Proceedings of 2 nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid '02) (Berlin, Germany, 2002) pp. 220-228.
  31. H. Nakada, M. Sato, and S. Sekiguchi, Design and implementations of Ninf: towards a global computing infrastructure, Future Generation Computing Systems 5- 6 (1999) 649-658.
  32. E. Newcomer, Understanding Web Services: XML, WSDL, SOAP, and UDDI (Addison Wesley, 2002).
  33. G. R. Nudd, D. J. Kerbyson, E. Papaefstathiou, S. C. Perry, J. S. Harper, and D. V. Wilcox, PACE -a toolset for the performance prediction of parallel and distributed systems, International Journal of High Performance Computing Applications 14(3) (2000) 228-251.
  34. O. F. Rana, and D. W. Walker, The agent grid: agent- based resource integration in PSEs, in: Proceedings of 16 th IMACS World Congress on Scientific Computation, Applied Mathematics and Simulation (Lausanne, Switzerland, 2000).
  35. W. Shen, Y. Li, H. Ghenniwa, and C. Wang, Adaptive negotiation for agent-based grid computing, in: Proceedings of AAMAS Workshop on Agentcities: Challenges in Open Agent Environments (Bologna, Italy, 2002) pp. 32-36.
  36. D. Slama, J. Garbis, and P. Russell, Enterprise Corba (Prentice Hall,
  37. R. Stevens, P. Woodward, T. DeFanti, and C. Catlett, From the I-WAY to the national technology grid, Communications of the ACM 40(11) (1997) 50-60.
  38. C. Thompson, Characterizing the agent grid, Technical Report, Object Services and Consulting Inc. (1998) http://www.objs.com/agility/tech-reports/9812-grid.html. B. Tierney, W. Johnston, J. Lee, and M. Thompson, A data intensive distributed computing architecture for grid applications, Future Generation Computer Systems 16(5) (2000) 473-481.
  39. R. Wolski, N. T. Spring, and J. Hayes, The network weather service: a distributed resource performance forecasting service for metacomputing, Future Generation Computing Systems 15(5-6) (1999) 757-768.
  40. S. Zhou, LSF: load sharing in large-scale heterogeneous distributed systems, in: Proceedings of 1992 Workshop on Cluster Computing (1992).
  41. Zhuge, Semantics, resource and grid, Future Generation Computer Systems 20(1) (2004) 1-5.
  42. Zhuge, China's E-Science Knowledge Grid Environment, IEEE Intelligent Systems 19(1) (2004) 13- 17.

Related papers

Agent-based grid load balancing using performance-driven task scheduling
Stephen Jarvis

Proceedings International Parallel and Distributed Processing Symposium, 2003

Load balancing is a key concern when developing parallel and distributed computing applications. The emergence of computational grids extends this problem, where issues of cross-domain and large-scale scheduling must also be considered. In this work an agent-based grid management infrastructure is coupled with a performance-driven task scheduler that has been developed for local grid load balancing. Each grid scheduler utilises predictive application performance data and an iterative heuristic algorithm to engineer local load balancing across multiple processing nodes. At a higher level, a hierarchy of homogeneous agents are used to represent multiple grid resources. Agents cooperate with each other to balance workload in the global grid environment using service advertisement and discovery mechanisms. A case study is included with corresponding experimental results to demonstrate that both local schedulers and agents contribute to overall grid load balancing, which significantly improves grid application execution performance and resource utilisation.

View PDFchevron_right
Agent Based Load Balancing in Grid Computing
ali wided

2020

Load-Balancing is an important problem in distributed heterogeneous systems. In this paper, an Agent-based load-balancing model is developed for implementation in a grid environment. Load balancing is realized via migration of worker agents from overloaded resources to underloaded ones. The proposed model purposes to take benefit of the multi-agent system characteristics to create an autonomous system. The Agent-based load balancing model is implemented using JADE (Java Agent Development Framework) and Alea 2 as a grid simulator. The use of MAS is discussed, concerning the solutions adopted for gathering information policy, location policy, selection policy, worker agents migration, and load balancing.

View PDFchevron_right
A novel Agent Based Load Balancing Model for maximizing resource utilization in Grid Computing
ali wided

Informatica, 2019

Grid is the collection of geographically distributed computing resources. For effective management of these resources, the manager must maximize its utilization, which can be achieved by efficient load balancing algorithm, The objective of load balancing algorithms is to assign the load on resources to optimize resource use while reducing total jobs execution time. The proposed agent based load balancing model aims to take advantage of the agent characteristics to generate an autonomous system. It also addresses similar systems drawbacks such as instability, scalability or adaptability. The performance of the proposed algorithms were tested in Alea 2 simulator by using different parameters such as response time, resources utilization and overall queue time. The performance evaluation suggests that the proposed algorithm can enhance the overall performance of grid computing. Povzetek: Predstavljena in s simulatorjem analizirana je agentna metoda razporejanja obremenitev v omrežju.

View PDFchevron_right
Agent-Based Resource Management for Grid Computing
Stephen Jarvis

2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02), 2002

Resource management is an important component of a grid computing infrastructure. The scalability and adaptability of such systems are two key challenges that must be addressed. In this work an agent-based resource management system, ARMS, is implemented for grid computing. ARMS utilises the performance prediction techniques of the PACE toolkit to provide quantitative data regarding the performance of complex applications running on a local grid resource. At the meta-level, a hierarchy of homogeneous agents are used to provide a scalable and adaptable abstraction of the system architecture. Each agent is able to cooperate with other agents and thereby provide service advertisement and discovery for the scheduling of applications that need to utilise grid resources. A case study with corresponding experimental results is included to demonstrate the efficiency of the resource management and scheduling system.

View PDFchevron_right
A Novel Agent-Based Load Balancing Algorithm for Grid Computing
Shuo Chen

Lecture Notes in Computer Science, 2004

This paper presents an agent-based resource scheduling algorithm for Grid computing systems. With this scheduling algorithm, the computational resources of the Grid can be dynamically scheduled according to the real-time working load on each node. Thus a Grid system can hold an excellent load balance state. Furthermore, the application of this algorithm is introduced into the practical protein molecules docking applications, which run at the DDG, a Grid computing system for drug discovery and design. Solid experimental results show the load balance and robustness of the proposed algorithm.

View PDFchevron_right

Related topics

  • Information Systems
  • Distributed Computing
  • Grid Computing
  • Service discovery
  • Load Balance
  • Resource Scheduling
  • Heuristic algorithm

    • Cited by

    A Genetic Approach for Long Term Virtual Organization Distribution
    Soledad Valero, Victor Sanchez-Anguix

    International Journal on Artificial Intelligence Tools, 2011

    An agent-based Virtual Organization is a complex entity where dynamic collections of agents agree to share resources in order to accomplish a global goal or offer a complex service. An important problem for the performance of the Virtual Organization is the distribution of the agents across the computational resources. The final distribution should provide a good load balancing for the organization. In this article, a genetic algorithm is applied to calculate a proper distribution across hosts in an agent-based Virtual Organization. Additionally, an abstract multi-agent system architecture which provides infrastructure for Virtual Organization distribution is introduced. The developed genetic solution employs an elitist crossover operator where one of the children inherits the most promising genetic material from the parents with higher probability. In order to validate the genetic proposal, the designed genetic algorithm has been successfully compared to several heuristics in different scenarios.

    View PDFchevron_right
    An Improved Min-Min Task Scheduling Algorithm in Grid Computing
    Mahmoud Ahmadi

    Lecture Notes in Computer Science, 2013

    Supercomputer prices on one hand and the need for vast computational resources on the other hand, led to the development of network computing resources were under name Grid. For optimal use of the capabilities of large distributed systems, the need for effective and efficient scheduling algorithms is necessary. For reduction of total completion time and improvement of load balancing, many algorithms have been implemented. In this paper, we propose new scheduling algorithm based on well known task scheduling algorithms, Min-Min. The proposed algorithm tries to use the advantages of this basic algorithm and avoids its drawbacks. To achieve this, the proposed algorithm firstly like Min-Min estimating of the completion time of the tasks on each of resources and then selects the appropriate resource for scheduling. The experimental results show that the proposed algorithm improved total completion time of scheduling in compared to Min-Min algorithm.

    View PDFchevron_right
    The Application of Fractal Transform and Entropy for Improving Fault Tolerance and Load Balancing in Grid Computing Environments
    Oday A L I Hassen

    Entropy

    This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with res...

    View PDFchevron_right
    A Framework for an Adaptive Grid Scheduling: An Organizational Perspective
    Khaled Ghedira

    Lecture Notes in Computer Science, 2013

    View PDFchevron_right
    An improved load-balancing mechanism based on deadline failure recovery on GridSim
    devashree tripathy

    Engineering with Computers, 2015

    failure of the Gridlets. Extensive simulation experiments are conducted to quantify the performance of the proposed load-balancing strategy on the GridSim platform. Experiments have shown that the proposed system can considerably improve Grid performance in terms of total execution time, percentage gain in execution time, average response time, resubmitted time and throughput. The proposed loadbalancing technique gives 7 % better performance than EGDC in case of constant number of resources, whereas in case of constant number of Gridlets, it gives 11 % better performance than EGDC.

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved