scholarly journals On the Analysis of Spatially Constrained Power of Two Choice Policies

2021 ◽  
Vol 48 (3) ◽  
pp. 51-56
Author(s):  
Nitish K. Panigrahy ◽  
Prithwish Basu ◽  
Don Towsley ◽  
Ananthram Swami ◽  
Kin K. Leung

We consider a class of power of two choice based assignment policies for allocating users to servers, where both users and servers are located on a two-dimensional Euclidean plane. In this framework, we investigate the inherent tradeoff between the communication cost, and load balancing performance of different allocation policies. To this end, we first design and evaluate a Spatial Power of two (sPOT) policy in which each user is allocated to the least loaded server among its two geographically nearest servers sequentially. When servers are placed on a two-dimensional square grid, sPOT maps to the classical Power of two (POT) policy on the Delaunay graph associated with the Voronoi tessellation of the set of servers. We show that the associated Delaunay graph is 4-regular and provide expressions for asymptotic maximum load using results from the literature. For uniform placement of servers, we map sPOT to a classical balls and bins allocation policy with bins corresponding to the Voronoi regions associated with the second order Voronoi diagram of the set of servers. We provide expressions for the lower bound on the asymptotic expected maximum load on the servers and prove that sPOT does not achieve POT load balancing benefits. However, experimental results suggest the efficacy of sPOT with respect to expected communication cost. Finally, we propose two non-uniform server sampling based POT policies that achieve the best of both the performance metrics. Experimental results validate the effectiveness of our proposed policies.

2020 ◽  
Vol 2020 (12) ◽  
Author(s):  
Yi Li ◽  
Yang Zhou

Abstract In this article we probe the proposed holographic duality between $$ T\overline{T} $$ T T ¯ deformed two dimensional conformal field theory and the gravity theory of AdS3 with a Dirichlet cutoff by computing correlators of energy-momentum tensor. We focus on the large central charge sector of the $$ T\overline{T} $$ T T ¯ CFT in a Euclidean plane and a sphere, and compute the correlators of energy-momentum tensor using an operator identity promoted from the classical trace relation. The result agrees with a computation of classical pure gravity in Euclidean AdS3 with the corresponding cutoff surface, given a holographic dictionary which identifies gravity parameters with $$ T\overline{T} $$ T T ¯ CFT parameters.


2021 ◽  
Vol 11 (15) ◽  
pp. 7169
Author(s):  
Mohamed Allouche ◽  
Tarek Frikha ◽  
Mihai Mitrea ◽  
Gérard Memmi ◽  
Faten Chaabane

To bridge the current gap between the Blockchain expectancies and their intensive computation constraints, the present paper advances a lightweight processing solution, based on a load-balancing architecture, compatible with the lightweight/embedding processing paradigms. In this way, the execution of complex operations is securely delegated to an off-chain general-purpose computing machine while the intimate Blockchain operations are kept on-chain. The illustrations correspond to an on-chain Tezos configuration and to a multiprocessor ARM embedded platform (integrated into a Raspberry Pi). The performances are assessed in terms of security, execution time, and CPU consumption when achieving a visual document fingerprint task. It is thus demonstrated that the advanced solution makes it possible for a computing intensive application to be deployed under severely constrained computation and memory resources, as set by a Raspberry Pi 3. The experimental results show that up to nine Tezos nodes can be deployed on a single Raspberry Pi 3 and that the limitation is not derived from the memory but from the computation resources. The execution time with a limited number of fingerprints is 40% higher than using a classical PC solution (value computed with 95% relative error lower than 5%).


2020 ◽  
Vol 146 ◽  
pp. 03004
Author(s):  
Douglas Ruth

The most influential parameter on the behavior of two-component flow in porous media is “wettability”. When wettability is being characterized, the most frequently used parameter is the “contact angle”. When a fluid-drop is placed on a solid surface, in the presence of a second, surrounding fluid, the fluid-fluid surface contacts the solid-surface at an angle that is typically measured through the fluid-drop. If this angle is less than 90°, the fluid in the drop is said to “wet” the surface. If this angle is greater than 90°, the surrounding fluid is said to “wet” the surface. This definition is universally accepted and appears to be scientifically justifiable, at least for a static situation where the solid surface is horizontal. Recently, this concept has been extended to characterize wettability in non-static situations using high-resolution, two-dimensional digital images of multi-component systems. Using simple thought experiments and published experimental results, many of them decades old, it will be demonstrated that contact angles are not primary parameters – their values depend on many other parameters. Using these arguments, it will be demonstrated that contact angles are not the cause of wettability behavior but the effect of wettability behavior and other parameters. The result of this is that the contact angle cannot be used as a primary indicator of wettability except in very restricted situations. Furthermore, it will be demonstrated that even for the simple case of a capillary interface in a vertical tube, attempting to use simply a two-dimensional image to determine the contact angle can result in a wide range of measured values. This observation is consistent with some published experimental results. It follows that contact angles measured in two-dimensions cannot be trusted to provide accurate values and these values should not be used to characterize the wettability of the system.


Author(s):  
Katsumasa Miyazaki ◽  
Kunio Hasegawa ◽  
Koichi Saito ◽  
Bostjan Bezensek

The fitness-for-service code requires the characterization of non-aligned multiple flaws for the flaw evaluation, which is performed using a flaw proximity rule. Worldwide almost all codes provide own proximity rule, often with unclear technical bases of the application of proximity rule to ductile fracture. To clarify the appropriate proximity rule for non-aligned multiple flaws in fully plastic fracture, fracture tests on flat plate specimen with non-aligned multiple through wall flaws were conducted at ambient temperature. The emphasis of this study was put on the flaw alignment rule, which determines whether non-aligned flaws are treated as independent or aligned onto the same plane for the purpose of flaw evaluations. The effects of the flaw separation and flaw size on the maximum load were investigated. The experimental results were compared with the estimations of the collapse load using the alignment rules in the ASME Section XI, BS7910 and API 579-1 codes. A new estimation procedure specific to the fully plastic fracture was proposed and compared with the comparison with the experimental results.


2013 ◽  
Vol 22 (05) ◽  
pp. 1350033
Author(s):  
CHI-CHOU KAO ◽  
YEN-TAI LAI

The Time-Multiplexed FPGA (TMFPGA) architecture can improve dramatically logic utilization by time-sharing logic but it needs a large amount of registers among sub-circuits for partitioning the given sequential circuits. In this paper, we propose an improved TMFPGA architecture to simplify the precedence constraints so that the number of the registers among sub-circuits can be reduced for sequential circuits partitioning. To demonstrate the practicability of the architecture, we also present a greedy algorithm to minimize the maximum number of the registers. Experimental results demonstrate the effectives of the algorithm.


Entropy ◽  
2018 ◽  
Vol 20 (10) ◽  
pp. 801 ◽  
Author(s):  
A. Karawia

To enhance the encryption proficiency and encourage the protected transmission of multiple images, the current work introduces an encryption algorithm for multiple images using the combination of mixed image elements (MIES) and a two-dimensional economic map. Firstly, the original images are grouped into one big image that is split into many pure image elements (PIES); secondly, the logistic map is used to shuffle the PIES; thirdly, it is confused with the sequence produced by the two-dimensional economic map to get MIES; finally, the MIES are gathered into a big encrypted image that is split into many images of the same size as the original images. The proposed algorithm includes a huge number key size space, and this makes the algorithm secure against hackers. Even more, the encryption results obtained by the proposed algorithm outperform existing algorithms in the literature. A comparison between the proposed algorithm and similar algorithms is made. The analysis of the experimental results and the proposed algorithm shows that the proposed algorithm is efficient and secure.


1987 ◽  
Vol 91 (908) ◽  
pp. 359-366

Summary A surface singularity method has been formulated to predict two-dimensional spoiler characteristics at low speeds. Vorticity singularities are placed on the aerofoil surface, on the spoiler surface, on the upper separation streamline from the spoiler tip and on the lower separation streamline from the aerofoil trailing edge. The separation region is closed downstream by two discrete vortices. The flow inside the separation region is assumed to have uniform total head. The downstream extent of the separated wake is an empirical input. The flows both external and internal to the separated regions are solved. Theoretical results have been obtained for a range of spoiler-aerofoil configurations which compare reasonably with experimental results. The model is deficient in that it predicts a higher compression ahead of the spoiler than obtained in practice. Furthermore, there is a minimum spoiler angle below which a solution is not possible; it is thought that this feature is related to the physical observation that at small spoiler angles, the separated flow from the spoiler reattaches on the aerofoil upper surface ahead of the trailing edge.


Author(s):  
Rafi U Zaman ◽  
Humaira M Alam ◽  
Khaleel Ur Rahman Khan ◽  
A. Venugopal Reddy

<p class="0abstract">Internetworking of different types of networks is envisaged as one of the primary objectives of the future 5G networks. Integrated Internet-MANET is a heterogeneous networking architecture which is the result of interconnecting wired Internet and wireless MANET. Multiprotocol gateways are used to achieve this interconnection. There are two types of Integrated Internet-MANET architectures, two-tier and three-tier. A combination of two-tier and three tier architectures also exists, called the Hybrid Framework or Hybrid Integrated Internet-MANET. Some of the most important issues common to all Integrated Internet-MANET architecture are: efficient gateway discovery, mobile node registration and gateway load balancing. Adaptive WLB-AODV is an existing protocol which addresses the issues of Gateway load balancing and efficient Gateway discovery. In this paper, an improvement is proposed to Adaptive WLB-AODV, called Adaptive Modified-WLV-AODV by taking into account route latency. The proposed protocol has been implemented in Hybrid Integrated Internet-MANET and has been simulated using network simulation tool ns-2. Based on the simulation results, it is observed that the proposed protocol delivers better performance than the existing protocol in terms of performance metrics end-to-end delay and packet loss ratio.  The performance of the proposed protocol is further optimized using a genetic algorithm.</p>


Author(s):  
S. M. Miner ◽  
R. D. Flack ◽  
P. E. Allaire

Two dimensional potential flow was used to determine the velocity field within a laboratory centrifugal pump. In particular, the finite element technique was used to model the impeller and volute simultaneously. The rotation of the impeller within the volute was simulated by using steady state solutions with the impeller in 10 different angular orientations. This allowed the interaction between the impeller and the volute to develop naturally as a result of the solution. The results for the complete pump model showed that there are circumferential asymmetries in the velocity field, even at the design flow rate. Differences in the relative velocity components were as large as 0.12 m/sec for the radial component and 0.38 m/sec for the tangential component, at the impeller exit. The magnitude of these variations was roughly 25% of the magnitude of the average radial and tangential velocities at the impeller exit. These asymmetries were even more pronounced at off design flow rates. The velocity field was also used to determine the location of the tongue stagnation point and to calculate the slip within the impeller. The stagnation point moved from the discharge side of the tongue to the impeller side of the tongue, as the flow rate increased from below design flow to above design flow. At design flow, values of slip ranged from 0.96 to 0.71, from impeller inlet to impeller exit. For all three types of data (velocity profiles, stagnation point location, and slip factor) comparison was made to laser velocimeter data, taken for the same pump. At the design flow, the computational and experimental results agreed to within 17% for the velocity magnitude, and 2° for the flow angle. The stagnation point locations coincided for the computational and experimental results, and the values for slip agreed to within 10%.


2015 ◽  
Vol 25 (6) ◽  
pp. 870-908 ◽  
Author(s):  
NIKOLAOS FOUNTOULAKIS ◽  
MEGHA KHOSLA ◽  
KONSTANTINOS PANAGIOTOU

Ak-uniform hypergraphH= (V, E) is called ℓ-orientable if there is an assignment of each edgee∈Eto one of its verticesv∈esuch that no vertex is assigned more than ℓ edges. LetHn,m,kbe a hypergraph, drawn uniformly at random from the set of allk-uniform hypergraphs withnvertices andmedges. In this paper we establish the threshold for the ℓ-orientability ofHn,m,kfor allk⩾ 3 and ℓ ⩾ 2, that is, we determine a critical quantityc*k,ℓsuch that with probability 1 −o(1) the graphHn,cn,khas an ℓ-orientation ifc<c*k,ℓ, but fails to do so ifc>c*k,ℓ.Our result has various applications, including sharp load thresholds for cuckoo hashing, load balancing with guaranteed maximum load, and massive parallel access to hard disk arrays.


Sign in / Sign up

Export Citation Format

Share Document