Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
399
Avoiding Concurrency Problems: Avoid Concurrency
"... • I had no idea that one of my classmates was astronaut-to-be! � BS in CS & in ME at Oregon State University, 1981 • Worked my way through with a job at the computer center � Self-employed contract programmer in early 80s • Building control systems, card-access security systems, acoustic navigat ..."
Abstract
- Add to MetaCart
• I had no idea that one of my classmates was astronaut-to-be! � BS in CS & in ME at Oregon State University, 1981 • Worked my way through with a job at the computer center � Self-employed contract programmer in early 80s • Building control systems, card-access security systems, acoustic
Randomized active atomicity violation detection in concurrent programs
- In SIGSOFT ’08/FSE-16: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering
, 2008
"... Atomicity is an important specification that enables programmers to understand atomic blocks of code in a multi-threaded program as if they are sequential. This significantly simplifies the programmer’s job to reason about correctness. Several modern multithreaded programming languages provide no bu ..."
Abstract
-
Cited by 69 (9 self)
- Add to MetaCart
Atomicity is an important specification that enables programmers to understand atomic blocks of code in a multi-threaded program as if they are sequential. This significantly simplifies the programmer’s job to reason about correctness. Several modern multithreaded programming languages provide
Homotopy in Concurrent Processes
, 1998
"... Homotopy in concurrent processes In theories of job scheduling and of distributed computing, there have been many attempts to introduce tools originating from algebraic and combinatorial topology, such as homotopy groups. Informally, the fundamental (or first homotopy) group gives an account of the ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
Homotopy in concurrent processes In theories of job scheduling and of distributed computing, there have been many attempts to introduce tools originating from algebraic and combinatorial topology, such as homotopy groups. Informally, the fundamental (or first homotopy) group gives an account
No Job Name
"... Dissolved oxygen (DO) declines have serious implications for the health of aquatic systems. These declines are often attributed to changes in organic or nutrient loading but are not generally attributed to species invasions. We use an 11-year record of DO in the tidal Hudson River to describe the t ..."
Abstract
- Add to MetaCart
the timing and spatial extent of the DO decline as compared to the timing and spatial extent of the zebra mussel establishment in the river. Furthermore, the system attributes that interact with zebra mussel respiration to moderate DO declines are explored using physical and biological budgets. Concurrent
Gross Worker and Job Flows in a Transition Economy: An Analysis of Estonia.” Labour Economics, forthcoming
, 2001
"... The results and conclusions of this analysis are those of the authors and do not necessarily reflect concurrence by the World Bank. We thank Debabrata Das for superb research assistance. 1 Flexibility in the labor market is an important feature of well-functioning market-based economies. Davis and H ..."
Abstract
-
Cited by 77 (14 self)
- Add to MetaCart
The results and conclusions of this analysis are those of the authors and do not necessarily reflect concurrence by the World Bank. We thank Debabrata Das for superb research assistance. 1 Flexibility in the labor market is an important feature of well-functioning market-based economies. Davis
Scheduling with Concurrency-Based Constraints
, 1995
"... This paper considers scheduling problems with timing constraints of the forms: ! (precedence), (no later than), and : = (concurrence). Scheduling unit-time jobs subject to ! and : = constraints, and scheduling unit-time jobs subject to constraints, are proved NP-complete for fixed k 3 proces ..."
Abstract
- Add to MetaCart
This paper considers scheduling problems with timing constraints of the forms: ! (precedence), (no later than), and : = (concurrence). Scheduling unit-time jobs subject to ! and : = constraints, and scheduling unit-time jobs subject to constraints, are proved NP-complete for fixed k 3
Maintainable Concurrent Software
, 1997
"... Abstract Constructing software that is easy to maintain and reuse is not a trivial task. When the software being constructed exploits concurrency, the task is complicated further. This thesis attempts to determine what shape an object-oriented programming language's concurrency support should t ..."
Abstract
- Add to MetaCart
Abstract Constructing software that is easy to maintain and reuse is not a trivial task. When the software being constructed exploits concurrency, the task is complicated further. This thesis attempts to determine what shape an object-oriented programming language's concurrency support should
A note on the complexity of the concurrent open shop problem
- Integer Programming and Combinatorial Optimization (IPCO
, 2006
"... Abstract The concurrent open shop problem is a relaxation of the well known open job shop problem, where the components of a job can be processed in parallel by dedicated, component specific machines. Recently, the problem has attracted the attention of a number of researchers. In particular, Leung ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
Abstract The concurrent open shop problem is a relaxation of the well known open job shop problem, where the components of a job can be processed in parallel by dedicated, component specific machines. Recently, the problem has attracted the attention of a number of researchers. In particular, Leung
Performance Modeling of Concurrent Systems under Resource Constraints
- in Proeedings Parallel Computing 89
, 1990
"... In this paper, we propose an approximate, iterative algorithm to compute the performance parameters of a resource constrainted computer system running jobs with internal concurrency. ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
In this paper, we propose an approximate, iterative algorithm to compute the performance parameters of a resource constrainted computer system running jobs with internal concurrency.
Quincy: Fair Scheduling for Distributed Computing Clusters
"... This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations close to their data is crucial for performance, is increasingly common and arises in systems such as MapReduce, Hadoop, a ..."
Abstract
-
Cited by 72 (1 self)
- Add to MetaCart
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations close to their data is crucial for performance, is increasingly common and arises in systems such as MapReduce, Hadoop
Results 1 - 10
of
399
