distributed computing applications provide concurrent processing and services executed from different systems through a common cloud platform. However, without modifications or adaptable security measures, such concur...
详细信息
distributed computing applications provide concurrent processing and services executed from different systems through a common cloud platform. However, without modifications or adaptable security measures, such concurrency presents a great challenge to the proper administration of security. This paper introduces a hybrid secure equivalent computing model to address this security issue. The proposed security model was designed using a genetic algorithm for equivalent measure distribution over the processing systems. Via this model, variations in security management owing to differences in the processing times of various services can be mitigated using the probabilistic annealing method. This method helps to preserve the stability of the security method without decreasing its robustness. For robust processing, the model exploits parallel security as a service feature from the cloud with a non-tokenized key sharing method. The key sharing and revocation processes are determined using the probabilistic outcomes of the annealing method. The genetic process verifies the distribution of security measures in the key sequence of any possible processing combination without compromise. The performance of the proposed model was verified using the metrics of process failure, computational complexity, time delay, false rate, and computing level.
Cellular Automata (CA) have been established as a dynamic mathematical modeling tool for scientific and engineering applications. Equal Length Cellular Automata (ELCA) are special classifications of CA having all gene...
详细信息
Cellular Automata (CA) have been established as a dynamic mathematical modeling tool for scientific and engineering applications. Equal Length Cellular Automata (ELCA) are special classifications of CA having all generated equal length CA subspaces (cycles). Potential usages of ELCA have been reported for engineering applications [1-4]. A detailed analysis of ELCA generating linear and complemented linear rules has been presented in our work. General forms of characteristic matrix and characteristic polynomial for ELCA generation have been reported. Mathematical relationships between cell length of CA and length of generated equal length cycles using explored rules have been reported in the paper.
We present the project Asteroids@home that uses distributed computing to solve the time-consuming inverse problem of shape reconstruction of asteroids. The project uses the Berkeley Open Infrastructure for Network Com...
详细信息
We present the project Asteroids@home that uses distributed computing to solve the time-consuming inverse problem of shape reconstruction of asteroids. The project uses the Berkeley Open Infrastructure for Network computing (BOINC) framework to distribute, collect, and validate small computational units that are solved independently at individual computers of volunteers connected to the project. Shapes, rotational periods, and orientations of the spin axes of asteroids are reconstructed from their disk integrated photometry by the lightcurve inversion method. (C) 2015 Elsevier B.V. All rights reserved.
distributed computing systems, such as Hadoop, have been widely studied and used for executing and analyzing large data. In this paper, we investigate an emerging resource allocation problem for wireless distributed c...
详细信息
distributed computing systems, such as Hadoop, have been widely studied and used for executing and analyzing large data. In this paper, we investigate an emerging resource allocation problem for wireless distributed computing systems consisting of multifunctional nodes in charge of both numerical computation and wireless communication with master nodes. We focus on a computation power consumption model based on CMOS devices and a communication power consumption model involving multiple antenna transceivers against mutual interference. We present a joint optimization problem for workload scheduling and power allocation for achieving maximum computational speed under total power constraint. We simplify the joint optimization into two sub-problems. For workload scheduling as an integer programming sub-problem, we relax the integer constraint and establish the equivalence between relaxed and original problems. For the power allocation sub-problem, we maximize a difference of convex functions by utilizing the concave-convex procedure. We prove our proposed algorithm to converge to a stationary point of the original program. Simulation results confirm the efficiency and near-optimal performance of our proposed algorithms.
distributed computing has become one of the most important frameworks in dealing with large computation tasks. In this paper, we propose a systematic construction of coded computing schemes for MapReduce-type distribu...
详细信息
distributed computing has become one of the most important frameworks in dealing with large computation tasks. In this paper, we propose a systematic construction of coded computing schemes for MapReduce-type distributed systems. The construction builds upon placement delivery arrays (PDA), originally proposed by Yan et al. for coded caching schemes. The main contributions of our work are three-fold. First, we identify a class of PDAs, called Comp-PDAs, and show how to obtain a coded computing scheme from any Comp-PDA. We also characterize the normalized number of stored files (storage load), computed intermediate values (computation load), and communicated bits (communication load), of the obtained schemes in terms of the Comp-PDA parameters. Then, we show that the performance achieved by Comp-PDAs describing Maddah-Ali and Niesen's coded caching schemes matches a new information-theoretic converse, thus establishing the fundamental region of all achievable performance triples. In particular, we characterize all the Comp-PDAs achieving the pareto-optimal storage, computation, and communication (SCC) loads of the fundamental region. Finally, we investigate the file complexity of the proposed schemes, i.e., the smallest number of files required for implementation. In particular, we describe Comp-PDAs that achieve pareto-optimal SCC triples with significantly lower file complexity than the originally proposed Comp-PDAs.
distributed computing techniques offer the potential to significantly reduce the run time of transmission-line-matrix (TLM) calculations. This letter describes the implementation of a TLM model of a two-channel wavegu...
详细信息
distributed computing techniques offer the potential to significantly reduce the run time of transmission-line-matrix (TLM) calculations. This letter describes the implementation of a TLM model of a two-channel waveguide distributed across a network of workstations using parallel virtual machine (PVM). The methods for distributing the TLM matrix across the workstations and the effect on performance of different approaches are described and discussed.
Software agents that are autonomous, communicative, and possibly intelligent processes raise new questions for developers of distributed systems. Specifically, what is responsible agent behavior, and who, as the owner...
详细信息
Software agents that are autonomous, communicative, and possibly intelligent processes raise new questions for developers of distributed systems. Specifically, what is responsible agent behavior, and who, as the owner, is legally responsible for it? The answers involve an understanding of human-agent interaction, agent-oriented middleware, and social behavior. Some software agents will have a sufficiently large number of internal states to be capable of seemingly intelligent behavior. Hence, an agent's future external behavior cannot be guaranteed on the basis of its past behavior, even if that behavior has been monitored over time. Complete compliance tests of intelligent agents, therefore, may not be achievable because of the (possibly) large number of internal states. Thus, the best we can say is that an agent has not exhibited noncompliant behavior yet. Communication between agents implies a contract between owners, and the complexity of agents implies possibly unpredictable behavior. Therefore, an appropriate legal framework is required to underwrite the consequences of communicative actions and to provide safeguards against unlawful activities. The legal implications of agent technology require new ways of thinking about working with an agent, new requirements for agent-oriented middleware, and additional types of social behavior to be considered when designing a multiagent system
We can use grid computing and virtualization to distribute computing applications on the Internet, letting a collection of interconnected servers host a set of applications to balance the processing load and improve p...
详细信息
We can use grid computing and virtualization to distribute computing applications on the Internet, letting a collection of interconnected servers host a set of applications to balance the processing load and improve performance. An important question is which applications to assign to which servers so we can meet the applications' quality of service (QoS) goals, given the servers' bandwidth and capacity constraints. In this column, the author precisely defines the problem and discusses a solution through a motivating numerical example.
By using distributed computing techniques and a supercluster of more than 20,000 processors we simulated folding of a 20-residue Trp Cage miniprotein in atomistic detail with implicit GB/SA solvent at a variety of sol...
详细信息
By using distributed computing techniques and a supercluster of more than 20,000 processors we simulated folding of a 20-residue Trp Cage miniprotein in atomistic detail with implicit GB/SA solvent at a variety of solvent viscosities (gamma). This allowed us to analyze the dependence of folding rates on viscosity. In particular, we focused on the low-viscosity regime (values below the viscosity of water). In accordance with Kramers' theory, we observe approximately linear dependence of the folding rate on 1/gamma for values from 1-10(-1)x that of water viscosity. However, for the regime between 10(-4)-10(-1)x that of water viscosity we observe power-law dependence of the form k similar to y(-1/5). These results suggest that estimating folding rates from molecular simulations run at low viscosity under the assumption of linear dependence of rate on inverse viscosity may lead to erroneous results. (C) 2003 Wiley Periodicals, Inc.
暂无评论