Academic literature on the topic 'Decentralized computing'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Decentralized computing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Decentralized computing"

1

Kelly, Terence. "Decentralized Computing." Queue 18, no. 5 (October 31, 2020): 41–53. http://dx.doi.org/10.1145/3434571.3436964.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Farrens, Matt. "Distributed decentralized computing." ACM Computing Surveys 28, no. 4es (December 1996): 28. http://dx.doi.org/10.1145/242224.242259.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mohammad Badiezadegan, Sayed. "Secure Multiparty Computing: A Decentralized Approach to GPA Calculation." International Journal of Science and Research (IJSR) 12, no. 9 (September 5, 2023): 515–16. http://dx.doi.org/10.21275/sr23905191245.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

YAMAGUCHI, A. "Autonomous Decentralized Control in Ubiquitous Computing." IEICE Transactions on Communications E88-B, no. 12 (December 1, 2005): 4421–26. http://dx.doi.org/10.1093/ietcom/e88-b.12.4421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Miller, Daniel E., and Edward J. Davison. "On Computing Quotient Decentralized Fixed Modes." IFAC Proceedings Volumes 44, no. 1 (January 2011): 2546–51. http://dx.doi.org/10.3182/20110828-6-it-1002.03142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yin, Yingying, and Leilei Deng. "A dynamic decentralized strategy of replica placement on edge computing." International Journal of Distributed Sensor Networks 18, no. 8 (August 2022): 155013292211150. http://dx.doi.org/10.1177/15501329221115064.

Full text
Abstract:
Smart phone and its applications are used more and more extensively in our daily life. Short delay of arriving data is important to these applications, especially to some time-sensitive ones. To reduce transmission latency and improve user experience, a dynamic decentralized data replica placement and management strategy which works in edge nodes is proposed in this article. It studies the location, access frequency, latency improvement, and cost spent on placing replicas on edge nodes to seek a balance between cost spent for storage and reduced latency. Specifically, dynamic and decentralized replica placement strategy algorithm has load guarantee for edge nodes to avoid overload; it dynamically create or delete data replicas on edge nodes according to the request frequency. Dynamic and decentralized replica placement strategy is decentralized to relieve transmission cost. Experiment results show that dynamic and decentralized replica placement strategy algorithm in edge computing environments can greatly reduce transmission latency, balance edge nodes load, and improve system performance. Dynamic and decentralized replica placement strategy also considers the cost spent for storage, and it pursues a balance between many factors.
APA, Harvard, Vancouver, ISO, and other styles
7

Nafus, Dawn, Eve M. Schooler, and Karly Ann Burch. "Carbon-Responsive Computing: Changing the Nexus between Energy and Computing." Energies 14, no. 21 (October 21, 2021): 6917. http://dx.doi.org/10.3390/en14216917.

Full text
Abstract:
While extensive research has gone into demand response techniques in data centers, the energy consumed in edge computing systems and in network data transmission remains a significant part of the computing industry’s carbon footprint. The industry also has not fully leveraged the parallel trend of decentralized renewable energy generation, which creates new areas of opportunity for innovation in combined energy and computing systems. Through an interdisciplinary sociotechnical discussion of current energy, computer science and social studies of science and technology (STS) literature, we argue that a more comprehensive set of carbon response techniques needs to be developed that span the continuum of data centers, from the back-end cloud to the network edge. Such techniques need to address the combined needs of decentralized energy and computing systems, alongside the social power dynamics those combinations entail. We call this more comprehensive range “carbon-responsive computing,” and underscore that this continuum constitutes the beginnings of an interconnected infrastructure, elements of which are data-intensive and require the integration of social science disciplines to adequately address problems of inequality, governance, transparency, and definitions of “necessary” tasks in a climate crisis.
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Yabin, Chenghao Guo, and Jin Yu. "Immune Scheduling Network Based Method for Task Scheduling in Decentralized Fog Computing." Wireless Communications and Mobile Computing 2018 (September 2, 2018): 1–8. http://dx.doi.org/10.1155/2018/2734219.

Full text
Abstract:
Fog computing has changed the distributed computing rapidly by including the smart devices widely distributed at the network edges. It is able to provide less latency and is more capable of decreasing traffic jam in the network. However, it will bring more difficulties for resource managing and task scheduling especially in a decentralized ad hoc network. In this paper, we propose a method that takes advantages of the immune mechanism to schedule tasks in a decentralized way for fog computing. By using forward propagation and backward propagation in the ad hoc network, the power of distributed schedulers is used to generate the optimized scheduler strategies to deal with computing nodes overloaded and achieve the optimal task finishing time reducing. The experiment results show that our approach can beat similar methods.
APA, Harvard, Vancouver, ISO, and other styles
9

Haposan Yoga Pradika Napitupulu and I Gde Dharma Nugraha. "Fog Computing-Based System for Decentralized Smart Parking System by Using Firebase." Jurnal Nasional Teknik Elektro dan Teknologi Informasi 13, no. 1 (February 22, 2024): 44–52. http://dx.doi.org/10.22146/jnteti.v13i1.10095.

Full text
Abstract:
The growth of vehicle number is unavoidable whilst the availability of parking is not directly proportional with this condition. Nowadays, many shopping centers do not have sufficient parking spot, causing customers to have difficulty in finding available parking spots. Research has been conducted to tackle the issue of finding available parking spots. Much of this research proposed the narrowband-Internet of things (NB-IoT) as a fog node. For communication purposes, this NB-IoT-based fog node has some shortcomings, such as security and privacy, lower data rate, higher cost in development, dependency with wireless system, and only covers one area. In this research, the fog computing was proposed to decentralize smart parking system by using Firebase to cover several areas or malls in one system and interface. Instead of using NB-IoT, this research employed decentralized local server as a fog node to deliver a fast data exchange. Firestore database (Firebase) was also used to secure, manage, and analyze the data in the cloud. Conjunctively, the Android application was created as a user interface to book and find the availability of parking spots. The Android application was built using Android Studio and implemented authentication to keep the data access secure and private. The testing scenario was done following the design unified modeling language (UML). The research results confirmed that the fog computing system successfully supported the decentralized smart parking system and was able to be implemented for covering several areas or malls in one system.
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Wei, Li Chen, and Wenyi Zhang. "Decentralized Federated Learning: Balancing Communication and Computing Costs." IEEE Transactions on Signal and Information Processing over Networks 8 (2022): 131–43. http://dx.doi.org/10.1109/tsipn.2022.3151242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Decentralized computing"

1

Lu, Kai. "Decentralized load balancing in heterogeneous computational grids." Thesis, The University of Sydney, 2007. http://hdl.handle.net/2123/9382.

Full text
Abstract:
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. The space limitations of conventional distributed systems can thus be overcome, to fully exploit the resources of under-utilised computing resources in every region around the world for distributed jobs. Workload and resource management are key grid services at the service level of grid software infrastructure, where issues of load balancing represent a common concern for most grid infrastructure developers. Although these are established research areas in parallel and distributed computing, grid computing environments present a number of new challenges, including large-scale computing resources, heterogeneous computing power, the autonomy of organisations hosting the resources, uneven job-arrival pattern among grid sites, considerable job transfer costs, and considerable communication overhead involved in capturing the load information of sites. This dissertation focuses on designing solutions for load balancing in computational grids that can cater for the unique characteristics of grid computing environments. To explore the solution space, we conducted a survey for load balancing solutions, which enabled discussion and comparison of existing approaches, and the delimiting and exploration of the apportion of solution space. A system model was developed to study the load-balancing problems in computational grid environments. In particular, we developed three decentralised algorithms for job dispatching and load balancing—using only partial information: the desirability-aware load balancing algorithm (DA), the performance-driven desirability-aware load-balancing algorithm (P-DA), and the performance-driven region-based load-balancing algorithm (P-RB). All three are scalable, dynamic, decentralised and sender-initiated. We conducted extensive simulation studies to analyse the performance of our load-balancing algorithms. Simulation results showed that the algorithms significantly outperform preexisting decentralised algorithms that are relevant to this research.
APA, Harvard, Vancouver, ISO, and other styles
2

Josilo, Sladana. "Decentralized Algorithms for Resource Allocation in Mobile Cloud Computing Systems." Licentiate thesis, KTH, Nätverk och systemteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-228084.

Full text
Abstract:
The rapid increase in the number of mobile devices has been followed by an increase in the capabilities of mobile devices, such as the computational power, memory and battery capacity. Yet, the computational resources of individual mobile devices are still insufficient for various delay sensitive and computationally intensive applications. These emerging applications could be supported by mobile cloud computing, which allows using external computational resources. Mobile cloud computing does not only improve the users’ perceived performance of mobile applications, but it also may reduce the energy consumption of mobile devices, and thus it may extend their battery life. However, the overall performance of mobile cloud computing systems is determined by the efficiency of allocating communication and computational resources. The work in this thesis proposes decentralized algorithms for allocating these two resources in mobile cloud computing systems. In the first part of the thesis, we consider the resource allocation problem in a mobile cloud computing system that allows mobile users to use cloud computational resources and the resources of each other. We consider that each mobile device aims at minimizing its perceived response time, and we develop a game theoretical model of the problem. Based on the game theoretical model, we propose an efficient decentralized algorithm that relies on average system parameters, and we show that the proposed algorithm could be a promising solution for coordinating multiple mobile devices. In the second part of the thesis, we consider the resource allocation problem in a mobile cloud computing system that consists of multiple wireless links and a cloud server. We model the problem as a strategic game, in which each mobile device aims at minimizing a combination of its response time and energy consumption for performing the computation. We prove the existence of equilibrium allocations of mobile cloud resources, and we use game theoretical tools for designing polynomial time decentralized algorithms with a bounded approximation ratio. We then consider the problem of allocating communication and computational resources over time slots, and we show that equilibrium allocations still exist. Furthermore, we analyze the structure of equilibrium allocations, and we show that the proposed decentralized algorithm for computing equilibria achieves good system performance. By providing constructive equilibrium existence proofs, the results in this thesis provide low complexity decentralized algorithms for allocating mobile cloud resources for various mobile cloud computing architectures.

-the webinar ID on Zoom: 670-3514-7251,  - the registration URL​: https://kth-se.zoom.us/webinar/register/WN_EQCltecySbSMoEQiRztIZg​

QC 20180518

APA, Harvard, Vancouver, ISO, and other styles
3

Ferreira, Heitor José Simões Baptista. "4Sensing - decentralized processing for participatory sensing data." Master's thesis, Faculdade de Ciências e Tecnologia, 2010. http://hdl.handle.net/10362/5091.

Full text
Abstract:
Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática.
Participatory sensing is a new application paradigm, stemming from both technical and social drives, which is currently gaining momentum as a research domain. It leverages the growing adoption of mobile phones equipped with sensors, such as camera, GPS and accelerometer, enabling users to collect and aggregate data, covering a wide area without incurring in the costs associated with a large-scale sensor network. Related research in participatory sensing usually proposes an architecture based on a centralized back-end. Centralized solutions raise a set of issues. On one side, there is the implications of having a centralized repository hosting privacy sensitive information. On the other side, this centralized model has financial costs that can discourage grassroots initiatives. This dissertation focuses on the data management aspects of a decentralized infrastructure for the support of participatory sensing applications, leveraging the body of work on participatory sensing and related areas, such as wireless and internet-wide sensor networks, peer-to-peer data management and stream processing. It proposes a framework covering a common set of data management requirements - from data acquisition, to processing, storage and querying - with the goal of lowering the barrier for the development and deployment of applications. Alternative architectural approaches - RTree, QTree and NTree - are proposed and evaluated experimentally in the context of a case-study application - SpeedSense - supporting the monitoring and prediction of traffic conditions, through the collection of speed and location samples in an urban setting, using GPS equipped mobile phones.
APA, Harvard, Vancouver, ISO, and other styles
4

Wilson, Dany. "Architecture for a Fully Decentralized Peer-to-Peer Collaborative Computing Platform." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32790.

Full text
Abstract:
We present an architecture for a fully decentralized peer-to-peer collaborative computing platform, offering services similar to Cloud Service Provider’s Platform-as-a-Service (PaaS) model, using volunteered resources rather than dedicated resources. This thesis is motivated by three research questions: (1) Is it possible to build a peer-to-peer col- laborative system using a fully decentralized infrastructure relying only on volunteered resources?, (2) How can light virtualization be used to mitigate the complexity inherent to the volunteered resources?, and (3) What are the minimal requirements for a computing platform similar to the PaaS cloud computing platform? We propose an architecture composed of three layers: the Network layer, the Virtual layer, and the Application layer. We also propose to use light virtualization technologies, or containers, to provide a uniform abstraction of the contributing resources and to isolate the host environment from the contributed environment. Then, we propose a minimal API specification for this computing platform, which is also applicable to PaaS computing platforms. The findings of this thesis corroborate the hypothesis that peer-to-peer collaborative systems can be used as a basis for developing volunteer cloud computing infrastructures. We outline the implications of using light virtualization as an integral virtualization primitive in public distributed computing platform. Finally, this thesis lays out a starting point for most volunteer cloud computing infrastructure development effort, because it circumscribes the essential requirements and presents solutions to mitigate the complexities inherent to this paradigm.
APA, Harvard, Vancouver, ISO, and other styles
5

Bicak, Mesude. "Agent-based modelling of decentralized ant behaviour using high performance computing." Thesis, University of Sheffield, 2011. http://etheses.whiterose.ac.uk/1392/.

Full text
Abstract:
Ant colonies are complex biological systems that respond to changing conditions in nature by solving dynamic problems. Their ability of decentralized decision-making and their self-organized trail systems have inspired computer scientists since 1990s, and consequently initiated a class of heuristic search algorithms, known as ant colony optimization (ACO) algorithms. These have proven to be very effective in solving combinatorial optimisation problems, especially in the field of telecommunication. The major challenge in social insect research is understanding how colony-level behaviour emerges from individual interactions. Models to date focus on simple pheromone usage with mathematically devised behaviour, which deviates largely from the real ant behaviour. Furthermore, simulating large-scale behaviour at the individual level is a difficult computational challenge; hence models fail to simulate realistic colony sizes and dimensions for foraging environments. In this thesis, FLAME, an agent-based modelling (ABM) framework capable of producing parallelisable models, was used as the modelling platform and simulations were performed on a High Performance Computing (HPC) grid. This enabled large-scale simulations of complex models to be run in parallel on a grid, without compromising on the time taken to attain results. Furthermore, the advanced features of the framework, such as dynamic creation of agents during a simulation, provided realistic grounds for modelling pheromones and the environment. ABM approach through FLAME was utilized to improve existing models of the Pharaoh's ants (Monomorium pharaonis) focusing on their foraging strategies. Based on related biological research, a number of hypotheses were further tested, which were: (i) the ability of the specialist ‘U-turner' ants in trail maintenance, (ii) the trail choices performed at bifurcations, and (iii) the ability of ants to deposit increased concentrations of pheromones based on food quality. Heterogeneous colonies with 7% U-turner ant agents were further shown to perform significantly better in foraging compared to homogeneous colonies. Furthermore, laying pheromones with a higher intensity based on food quality was shown to be beneficial for the Pharaoh's ant colonies in switching to more rewarding trails. The movement of the Pharaoh's ants in unexplored areas (without pheromones) was also investigated by conducting biological experiments. Video tracking was used to extract movement vectors from the recordings of experiments and the data obtained was subject to statistical analysis in order to devise parameters for ant movement in the models developed. Overall, this research makes contributions to biology and computer science research by: (i) utilizing ABM and HPC via FLAME to reduce technological challenges, (ii) further validating existing hypotheses through realistic models, (iii) developing a video tracking system to acquire experimental data, and (iv) discussing potential applications to emergent telecommunication and networking problems.
APA, Harvard, Vancouver, ISO, and other styles
6

Tkachuk, Roman-Valentyn. "Towards Decentralized Orchestration of Next-generation Cloud Infrastructures." Licentiate thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-21345.

Full text
Abstract:
Cloud Computing helps to efficiently utilize the abundance of computing resources in large data centers. It enables interested parties to deploy their services in data centers while the hardware infrastructure is maintained by the cloud provider. Cloud computing is interesting in particular as it enables automation of service deployment and management processes. However, the more complex the service structure becomes, the more complex deployment and management automation of all its parts can become. To this end, the concept of service orchestration is introduced to streamline service deployment and management processes. Orchestration enables the definition and execution of complex automation workflows targeted to provision computing infrastructure, deploy needed service features, and provide management support. In particular, the orchestration process enables the deployment and enforcement of security and compliance mechanisms in the context of systems where sensitive data is being processed.  This thesis investigates the orchestration process as a uniform approach to deploy and manage network services and required security and compliance mechanisms. To this end, we investigate different use-cases where the orchestration process is applied to address specific requirements towards security and compliance. This thesis includes two parts. In the first part, we focus on centralized orchestration mechanisms, where all activities are performed from one trusted server. We explore the use-cases of a security testbed and collaborative AI engineering and investigate the advantages and limitations of orchestration mechanisms application in their context. In the second part, we shift towards the investigation of decentralized orchestration mechanisms. We employ blockchain technology as the main decentralization mechanism, exploring the advantages and limitations of its application in the context of digital marketplaces. We demonstrate that the shift towards blockchain-enabled orchestration enables the deployment and management of decentralized security mechanisms, ensuring compliant behavior of digital marketplace actors.
APA, Harvard, Vancouver, ISO, and other styles
7

Barker, James W. "A Low-Cost, Decentralized Distributed Computing Architecture for an Autonomous User Environment." NSUWorks, 1998. http://nsuworks.nova.edu/gscis_etd/402.

Full text
Abstract:
The focus of this research was the individual or small organization. These organizations include small businesses, community groups, K-12 schools or community colleges, local government, and the individual user, as well as many others. In this work, all of these organizations as well as the individual user were collectively referred to as users. The common element shared by each of these users was that they each have legitimate purposes for access to Internet services or each provides a service or services that could be enhanced if distributed via the connectivity provided by the Internet. However, the costs of establishing a conventional Internet server and the associated connectivity are prohibitive to such small-scale organizations. The objectives of this research were to: Establish a definition of a low-cost decentralized distributed computing environment for Intel-based personal computers that will provide users the capability to access the full spectrum of Internet services while enabling them with the ability to retain control of their computing environment. Develop a replication process to replicate and distribute the defined environment in a modular form so as to facilitate installation on a target system. Conduct testing and evaluation of the architecture and replication process to validate its ease of configuration and installation, and compliance with the requirements to provide users the capability to access the full spectrum of Internet services while retaining complete control of their computing environment. This was accomplished in three phases: (a) Phase I - Define an objective architecture, (b) Phase II - Develop a technique for replicating and distributing the architecture, and (c) Phase III - Test and validate the architecture and the replication and distribution processes. Definition of the objective architecture was accomplished through development of a prototype system that successfully demonstrated all of the characteristics required by the objectives of this research. Following the definition of the architecture on the prototype system, development of a technique for replicating and distributing the architecture was undertaken. This was accomplished by developing a group of programs that configured a system to the needs of a target user, captured that configured system on a removable medium, and restored that configured system on the target hardware. Finally the architecture, as well as its replication and distribution processes were evaluated for validity using statistical analysis of data collected from test subjects acting as users. All of these tasks were accomplished within the Linux Operating System environment using only software tools developed by the researcher or tools that are a native component of Linux. The first objective of this research was satisfied by the researcher's selection of Linux and its suite of associated applications as the operating system that would host the solution system. The second objective of this research was accomplished by the researcher's development of a suite of software tools that replicated the configured environment, moved the replication to an appropriate media and restored the environment on a target system. Inviting a group of Linux users to use the tools and provide feedback via a survey satisfied the third objective of this research. It was concluded that the three objectives of this research and therefore the overall goal of this research were accomplished. In each measured evaluation of the architecture, procedures and programs developed by the researcher, the resulting data were plotted in the advanced area or the area tending toward the advanced level of maturity as defined by the Boloix and Robillard (1995) evaluation scale. In a like manner the resulting data were plotted in the exceptionally compliant range or higher on the normal distribution curve survey scale. The trend of results was consistently at the advanced level of maturity on the Boloix and Robillard (1995) evaluation scale or in the exceptionally compliant range of the normal distribution curve survey scale. The researcher found that the results of testing the defined architecture and replication process revealed users are able to quickly implement a fully configured Linux system with all the capabilities defined in the architecture. This resulting Linux system provided a low cost, decentralized, distributed computing environment for Intel-based personal computers that enabled users to access the full spectrum of Internet services while maintaining control of their computing environment. By accomplishing this objective the researcher's Linux system can provide fiscally constrained individuals or small organizations full access to Internet services without the high costs of establishing a conventional Internet server and associated connectivity, prohibitive to a small-scale organization.
APA, Harvard, Vancouver, ISO, and other styles
8

Tordsson, Johan. "Decentralized resource brokering for heterogeneous grid environments." Licentiate thesis, Umeå : Department of Computing Science, Umeå University, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-966.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Agarwal, Radhika. "DRAP: A Decentralized Public Resourced Cloudlet for Ad-Hoc Networks." Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/30682.

Full text
Abstract:
Handheld devices are becoming increasingly common, and they have varied range of resources. Mobile Cloud Computing (MCC) allows resource constrained devices to offload computation and use storage capacities of more resourceful surrogate machines. This enables creation of new and interesting applications for all devices. We propose a scheme that constructs a high-performance de-centralized system by a group of volunteer mobile devices which come together to form a resourceful unit (cloudlet). The idea is to design a model to operate as a public-resource between mobile devices in close geographical proximity. This cloudlet can provide larger storage capability and can be used as a computational resource by other devices in the network. The system needs to watch the movement of the participating nodes and restructure the topology if some nodes that are providing support to the cloudlet fail or move out of the network. In this work, we discuss the need of the system, our goals and design issues in building a scalable and reconfigurable system. We achieve this by leveraging the concept of virtual dominating set to create an overlay in the broads of the network and distribute the responsibilities in hosting a cloudlet server. We propose an architecture for such a system and develop algorithms that are requited for its operation. We map the resources available in the network by first scoring each device individually, and then gathering these scores to determine suitable candidate cloudlet nodes. We have simulated cloudlet functionalities for several scenarios and show that our approach is viable alternative for many applications such as sharing GPS, crowd sourcing, natural language processing, etc.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Mianyu Kam Moshe Kandasamy Nagarajan. "A decentralized control and optimization framework for autonomic performance management of web-server systems /." Philadelphia, Pa. : Drexel University, 2007. http://hdl.handle.net/1860/2643.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Decentralized computing"

1

Duckham, Matt. Decentralized Spatial Computing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Duckham, Matt. Decentralized Spatial Computing: Foundations of Geosensor Networks. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Markus, Endler, and SpringerLink (Online service), eds. Decentralized Reasoning in Ambient Intelligence. London: Springer London, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

International Symposium on Autonomous Decentralized Systems (5th 2001 Dallas, Tex.). Fifth International Symposium on Autonomous Decentralized Systems: Proceedings : 26-28 March, 2001, Dallas, Texas. Los Alamitos, Calif: IEEE Computer Society, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

International Symposium on Autonomous Decentralized Systems (1st 1993 Kawasaki-shi, Japan). ISADS 93, International Symposium on Autonomous Decentralized Systems, March 30-April 1, 1993, Kawasaki, Japan: Proceedings. Los Alamitos, Calif: IEEE Computer Society Press, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

International Symposium on Autonomous Decentralized Systems (2nd 1995 Phoenix, Ariz.). ISADS 95, Second International Symposium on Autonomous Decentralized Systems: Proceedings, April 25-27, 1995, Phoenix, Arizona, USA. Los Alamitos, Calif: IEEE Computer Society Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Society, IEEE Computer, Jōhō Shori Gakkai (Japan), and Keisoku Jidō Seigyo Gakkai (Japan), eds. ISADS 97, Third International Symposium on Autonomous Decentralized Systems: Proceedings, April 9-11, 1997, Berlin, Germany. Los Alamitos, Calif: IEEE Computer Society Press, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Emergence, evolution, intelligence: Hydroinformatics : a study of distributed and decentralised computing using intelligent agents. Rotterdam: A.A. Balkema, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Decentralized Spatial Computing. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Duckham, Matt. Decentralized Spatial Computing: Foundations of Geosensor Networks. Springer Berlin / Heidelberg, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Decentralized computing"

1

Summers, Akira. "Decentralized computing." In Understanding Blockchain and Cryptocurrencies, 25–32. New York: CRC Press, 2022. http://dx.doi.org/10.1201/9781003187165-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Duckham, Matt. "When Computing Happens Somewhere." In Decentralized Spatial Computing, 3–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Duckham, Matt. "Formal Foundations." In Decentralized Spatial Computing, 33–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Duckham, Matt. "Algorithmic Foundations." In Decentralized Spatial Computing, 57–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Duckham, Matt. "Neighborhood-Based Algorithms." In Decentralized Spatial Computing, 85–128. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Duckham, Matt. "Location-Based Algorithms." In Decentralized Spatial Computing, 129–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Duckham, Matt. "Monitoring Spatial Change over Time." In Decentralized Spatial Computing, 169–206. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Duckham, Matt. "Simulating Scalable Decentralized Spatial Algorithms." In Decentralized Spatial Computing, 209–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Duckham, Matt. "Simulating Robust Decentralized Spatial Algorithms." In Decentralized Spatial Computing, 245–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Duckham, Matt. "Further Topics and Technologies." In Decentralized Spatial Computing, 275–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-30853-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Decentralized computing"

1

Christie V, Samuel H., Amit K. Chopra, and Munindar P. Singh. "Deserv: Decentralized Serverless Computing." In 2021 IEEE International Conference on Web Services (ICWS). IEEE, 2021. http://dx.doi.org/10.1109/icws53863.2021.00020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Alp, Enis Ceyhun, Eleftherios Kokoris-Kogias, Georgia Fragkouli, and Bryan Ford. "Rethinking General-Purpose Decentralized Computing." In HotOS '19: Workshop on Hot Topics in Operating Systems. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3317550.3321448.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kephart, Jeffrey O. "Engineering decentralized autonomic computing systems." In Proceeding of the second international workshop. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1809036.1809038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kourtis, Michail Alexandros, George Xilouris, Michael Batistatos, Anastasios Kourtis, and Albertos Markakis. "Emergency communications leveraging decentralized swarm computing." In CPS-IoT Week '23: Cyber-Physical Systems and Internet of Things Week 2023. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3576914.3588019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gheorghe, Alin-Gabriel, Constantin-Cosmin Crecana, Catalin Negru, Florin Pop, and Ciprian Dobre. "Decentralized Storage System for Edge Computing." In 2019 18th International Symposium on Parallel and Distributed Computing (ISPDC). IEEE, 2019. http://dx.doi.org/10.1109/ispdc.2019.00009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Domingo-Ferrer, Josep. "Ethics by Design in Decentralized Computing." In EICC 2022: European Interdisciplinary Cybersecurity Conference. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3528580.3535331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abdullah Antor, Md, Tasmin Jannat Tahsin, Minhas Abedin Sohan, and Syed Ahsanul Kabir. "High Performance Computing in Decentralized Network." In 2022 4th International Conference on Sustainable Technologies for Industry 4.0 (STI). IEEE, 2022. http://dx.doi.org/10.1109/sti56238.2022.10103309.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bridges, Christopher P., and Tanya Vladimirova. "Agent computing applications in distributed satellite systems." In 2009 International Symposium on Autonomous Decentralized Systems (ISADS). IEEE, 2009. http://dx.doi.org/10.1109/isads.2009.5207326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Domingo-Ferrer, Josep, Alberto Blanco-Justicia, David Sanchez, and Najeeb Jebreel. "Co-Utile Peer-to-Peer Decentralized Computing." In 2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID). IEEE, 2020. http://dx.doi.org/10.1109/ccgrid49817.2020.00-90.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

D'Angelo, Mirko. "Decentralized self-adaptive computing at the edge." In ICSE '18: 40th International Conference on Software Engineering. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3194133.3194160.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Decentralized computing"

1

Northcutt, J. D., E. D. Jensen, Edward J. Burke, Raymond K. Clark, and James G. Hanko. Decentralized Computing Technology for Fault-Tolerant, Survivable C3I systems. Volume 1. Fort Belvoir, VA: Defense Technical Information Center, June 1990. http://dx.doi.org/10.21236/ada232289.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography