Global–Local Incompatibility: The Misperception of Reliability in Judgment Regarding Global Variables

2020 ◽  
Vol 44 (4) ◽  
Author(s):  
Stephen B. Broomell
Keyword(s):  
Global Variables

Feed-forward semantics with generic, greedy, global variables that derive scope and island effects

2016 ◽  
Vol 72 (3) ◽  
Author(s):  
Paul Juinn Bing Tan ◽  
Paul Juinn Bing Tan ◽  
Phillip Potamites
Keyword(s):  
Feed Forward ◽  
Global Variables

scholarly journals The Complexity Landscape of Decompositional Parameters for ILP: Programs with Few Global Variables and Constraints

2021 ◽  
pp. 103561
Author(s):  
Pavel Dvořák ◽  
Eduard Eiben ◽  
Robert Ganian ◽  
Dušan Knop ◽  
Sebastian Ordyniak
Keyword(s):  
Global Variables

scholarly journals Noise-induced forced synchronization of global variables in coupled bistable systems

2007 ◽  
Vol 79 (5) ◽  
pp. 50002 ◽  
Author(s):  
J. M Casado ◽  
J Gómez-Ordóñez ◽  
M Morillo
Keyword(s):  
Global Variables ◽  
Bistable Systems

Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++

2021 ◽  
Author(s):  
Philipp Dominik Schubert ◽  
Florian Sattler ◽  
Fabian Schiebel ◽  
Ben Hermann ◽  
Eric Bodden
Keyword(s):  
Data Flow ◽  
Flow Analysis ◽  
Data Flow Analysis ◽  
Global Variables

Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++

2021 ◽  
Author(s):  
Philipp Dominik Schubert ◽  
Florian Sattler ◽  
Fabian Schiebel ◽  
Ben Hermann ◽  
Eric Bodden
Keyword(s):  
Data Flow ◽  
Flow Analysis ◽  
Data Flow Analysis ◽  
Global Variables

Implementing Parallel Branch-and-Bound with Extended Sisal 2.0

1998 ◽  
Vol 08 (01) ◽  
pp. 41-50
Author(s):  
Yung-Syau Chen ◽  
Jean-Luc Gaudiot
Keyword(s):  
Traveling Salesman Problem ◽  
Branch And Bound ◽  
Optimization Technique ◽  
Traveling Salesman ◽  
Functional Language ◽  
Global Variables ◽  
Parallel Version ◽  
Parallel Branch And Bound ◽  
Hard Problems ◽  
The Traveling Salesman Problem

Parallel branch-and-bound is an optimization technique which renders more efficient the solution of some hard problems such as the puzzle of colored blocks and the traveling-salesman problem. In a functional language such as Sisal 2.0, it is difficult for the programmer to describe a parallel version of this technique due to the lack of imperative features in the language. In this paper, we propose a version of Sisal 2.0 extended with user-declared mutable global variables in order to enable Sisal programmers to apply the parallel branch-and-bound technique. In a simple example (the puzzle of colored blocks), we show that this approach yields better performance than either conventional functional programs or imperative programs. It is easy to see that the same strategy can be used to solve a number of hard problems such as the traveling-salesman problem.

Sign in / Sign up

Export Citation Format

Share Document