scholarly journals From Static Code Distribution to More Shrinkage for the Multiterminal Cut

2005 ◽  
pp. 177-188 ◽  
Author(s):  
Bram De Wachter ◽  
Alexandre Genon ◽  
Thierry Massart
Keyword(s):  
Code Distribution ◽  
Multiterminal Cut

Revisiting a simple algorithm for the planar multiterminal cut problem

2010 ◽  
Vol 38 (4) ◽  
pp. 334-336 ◽  
Author(s):  
Kevin K.H. Cheung ◽  
Kyle Harvey
Keyword(s):  
Simple Algorithm ◽  
Multiterminal Cut

scholarly journals A Linear Algebra Framework for Static High Performance Fortran Code Distribution

1997 ◽  
Vol 6 (1) ◽  
pp. 3-27 ◽  
Author(s):  
Corinne Ancourt ◽  
Fabien Coelho ◽  
FranÇois Irigoin ◽  
Ronan Keryell
Keyword(s):  
Linear Algebra ◽  
High Performance ◽  
Address Space ◽  
Data Parallel ◽  
High Performance Fortran ◽  
Multiple Data ◽  
Fortran Code ◽  
Code Distribution ◽  
Overlap Analysis ◽  
Data Parallel Programming

High Performance Fortran (HPF) was developed to support data parallel programming for single-instruction multiple-data (SIMD) and multiple-instruction multiple-data (MIMD) machines with distributed memory. The programmer is provided a familiar uniform logical address space and specifies the data distribution by directives. The compiler then exploits these directives to allocate arrays in the local memories, to assign computations to elementary processors, and to migrate data between processors when required. We show here that linear algebra is a powerful framework to encode HPF directives and to synthesize distributed code with space-efficient array allocation, tight loop bounds, and vectorized communications forINDEPENDENTloops. The generated code includes traditional optimizations such as guard elimination, message vectorization and aggregation, and overlap analysis. The systematic use of an affine framework makes it possible to prove the compilation scheme correct.

An efficient and secure agent code distribution service

2010 ◽  
pp. n/a-n/a
Author(s):  
J. Cucurull ◽  
G. Navarro-Arribas ◽  
R. Martí ◽  
S. Robles ◽  
J. Borrell
Keyword(s):  
Code Distribution

The node multiterminal cut polyhedron

Networks ◽  
1997 ◽  
Vol 30 (2) ◽  
pp. 133-148
Author(s):  
Bo Yu ◽  
Joseph Cheriyan
Keyword(s):  
Multiterminal Cut

scholarly journals The planar multiterminal cut problem

1998 ◽  
Vol 85 (3) ◽  
pp. 203-222 ◽  
Author(s):  
David Hartvigsen
Keyword(s):  
Multiterminal Cut

The Study on E-Business Authentication Approach in Distributed System

2013 ◽  
Vol 443 ◽  
pp. 546-550
Author(s):  
Guang Ya Li
Keyword(s):  
Distributed System ◽  
Alternative Algebra ◽  
The Internet ◽  
Registration Process ◽  
Is Security ◽  
Distribution Scheme ◽  
Security Problem ◽  
Curve Method ◽  
Code Distribution ◽  
Electronic Authentication

The most important and concerned problem with the Internet electronic registration is security problem. This contribution uses conic curve method to verify the generating license in servers. In order to ensure the validity and security of license, the process of license distribution apply a verifiable code distribution scheme based on conic curve to make the electronic registration process more secure. In this paper, we propose a distributed electronic authentication scheme based on conic curves. As an alternative algebra curve technology, we believe conic deserves the further study in cryptography.

Sign in / Sign up

Export Citation Format

Share Document