this paper presents a new online frequency selecting algorithm for asynchronous parallel methods running over grids. It selects a vector of frequencies that gives the best tradeoff between energy consumption and perfo...
详细信息
Communication and agreement are fundamental abstractions in any distributed system. (If the computing entities do not need to communicate or agree in one way or another, the system is not a distributed system!) this t...
详细信息
distributed Denial of Service attacks produce large volumes of spoofed network data. Manual analysis of gigabytes of network logs to determine source of the attacks, victim IPs and vulnerability exploitation is time-c...
详细信息
Inductor winding is often composed as parallel-connected wires to suppress the copper loss. However, in high frequency inductors, the proximity effect can cause concentrated AC current distribution, hindering suppress...
详细信息
ISBN:
(纸本)9784886860989
Inductor winding is often composed as parallel-connected wires to suppress the copper loss. However, in high frequency inductors, the proximity effect can cause concentrated AC current distribution, hindering suppression of the copper loss. therefore, optimization of the physical inductor structure requires predicting the AC current distribution. Although simulators are commonly employed for predicting the AC current distribution, simple analytical methods are also required for effective design or invention of the inductor structure with less copper loss. the purpose of this paper is to propose a novel analysis method of the AC current distribution in parallel-connected wires of high frequency inductors. the proposed method is based on a novel insight that the AC current is distributed to give an extremum of the magnetic co-energy contributed by the AC flux and the AC current under the given total AC current. Experiments are presented in this paper to verify the proposed method.
In this paper,we are presenting QR factorization algorithms that can tolerate process crashes and soft errors(bit flips).Our algorithms take advantage of structural properties of a QR factorization algorithm referred ...
详细信息
ISBN:
(纸本)9781509035946
In this paper,we are presenting QR factorization algorithms that can tolerate process crashes and soft errors(bit flips).Our algorithms take advantage of structural properties of a QR factorization algorithm referred to as "communication-avoiding".We show that,exploiting these properties,our resilient,robust algorithms modify the communication pattern of the computation but do not add any significant computation in the critical path.
In this paper, we present a novel approach to optimally fuse estimates in distributed state estimation for linear and nonlinear systems. An optimal fusion requires the knowledge of the correct correlations between loc...
详细信息
ISBN:
(纸本)9780996452748
In this paper, we present a novel approach to optimally fuse estimates in distributed state estimation for linear and nonlinear systems. An optimal fusion requires the knowledge of the correct correlations between locally obtained estimates. the naive and intractable way of calculating the correct correlations would be to exchange information about every processed measurement between all nodes. Instead, we propose to obtain the correct correlations by keeping and processing a small set of deterministic samples on each node in parallel to the actual local state estimation. Sending these samples in addition to the local state estimate to the fusion center allows for correctly reconstructing the desired correlations between all estimates. In doing so, each node does not need any information about measurements processed on other nodes. We show the optimality of the proposed method by means of tracking an extended object in a multi-camera network.
the proceedings contain 35 papers. the topics discussed include: signature-free communication and agreement in the presence of byzantine processes;dynamic reconfiguration: a tutorial;time to change: on distributed com...
ISBN:
(纸本)9783939897989
the proceedings contain 35 papers. the topics discussed include: signature-free communication and agreement in the presence of byzantine processes;dynamic reconfiguration: a tutorial;time to change: on distributedcomputing in dynamic networks;space bounds for reliable storage: fundamental limits of coding;approximation of distances and shortest paths in the broadcast congest clique;the cost of global broadcast in dynamic radio networks;bounds for blind rate adaptation;overcoming obstacles with ants;distributed sparse cut approximation;distributed approximation of k-service assignment;the relative power of composite loop agreement tasks;loosely-stabilizing leader election on arbitrary graphs in population protocols without identifiers nor random numbers;and a heap-based concurrent priority queue with mutable priorities for faster parallel algorithms.
Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether a given distribution policy for the ...
详细信息
this paper investigates the problem of controlling a heterogeneous group of vehicles withthe aim of forming multilane convoys. We use a distributed, graph-based control law, implemented in a longitudinal coordinate s...
详细信息
We study the problem of computing a sparse cut in an undirected network graph G = (V, E). We measure the sparsity of a cut (S, V \ S) by its conductance φ(S), i.e., by the ratio of the number of edges crossing the cu...
详细信息
暂无评论