Results 1  10
of
2,200,595
Scheduling UnitTime Operation Jobs On Identical Parallel Machines And In A Flow Shop: Complexity And Correlation
, 1998
"... . This paper considers the complexity and the correlation of scheduling unittime jobs on identical parallel machines and unittime flowshop scheduling under precedence constraints. It is shown that, in the case of chainlike precedence constraints, the nonpreemptive parallelmachines problem and t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. This paper considers the complexity and the correlation of scheduling unittime jobs on identical parallel machines and unittime flowshop scheduling under precedence constraints. It is shown that, in the case of chainlike precedence constraints, the nonpreemptive parallelmachines problem
Monitors: An Operating System Structuring Concept
 Communications of the ACM
, 1974
"... This is a digitized copy derived from an ACM copyrighted work. It is not guaranteed to be an accurate copy of the author's original work. This paper develops BrinchHansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization, descri ..."
Abstract

Cited by 561 (0 self)
 Add to MetaCart
This is a digitized copy derived from an ACM copyrighted work. It is not guaranteed to be an accurate copy of the author's original work. This paper develops BrinchHansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization
Unittime Openshop Scheduling Problems with Symmetric Objective Functions
, 1995
"... The paper deals with the openshop problems with unittime operations and nondecreasing symmetric objective functions depending on job completion times. We construct two schedules, one of them is optimal for any symmetric convex function, the other is optimal for any symmetric concave function. Each ..."
Abstract
 Add to MetaCart
The paper deals with the openshop problems with unittime operations and nondecreasing symmetric objective functions depending on job completion times. We construct two schedules, one of them is optimal for any symmetric convex function, the other is optimal for any symmetric concave function
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems
 IN PROCEEDINGS OF THE 1994 WINTER USENIX CONFERENCE
, 1994
"... TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation5000/240's that are connected by a 100Mbps switchbased ATM LAN and a 10Mbps Ethernet. Ou ..."
Abstract

Cited by 527 (17 self)
 Add to MetaCart
. Our objective is to determine the efficiency of a userlevel DSM implementation on commercially available workstations and operating systems. We achieved good speedups on the 8processor ATM network for Jacobi (7.4), TSP (7.2), Quicksort (6.3), and ILINK (5.7). For a slightly modified version
RealTime Dynamic Voltage Scaling for LowPower Embedded Operating Systems
, 2001
"... In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery lif ..."
Abstract

Cited by 498 (4 self)
 Add to MetaCart
the necessary peak computation power in generalpurpose systems. However, for a large class of applications in embedded realtime systems like cellular phones and camcorders, the variable operating frequency interferes with their deadline guarantee mechanisms, and DVS in this context, despite its growing
Sorting networks and their applications
, 1968
"... To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing ..."
Abstract

Cited by 660 (0 self)
 Add to MetaCart
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 550 (3 self)
 Add to MetaCart
scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function of the processor speed s. We give
Toward a model of text comprehension and production
 Psychological Review
, 1978
"... The semantic structure of texts can be described both at the local microlevel and at a more global macrolevel. A model for text comprehension based on this notion accounts for the formation of a coherent semantic text base in terms of a cyclical process constrained by limitations of working memory. ..."
Abstract

Cited by 540 (12 self)
 Add to MetaCart
. Furthermore, the model includes macrooperators, whose purpose is to reduce the information in a text base to its gist, that is, the theoretical macrostructure. These operations are under the control of a schema, which is a theoretical formulation of the comprehender's goals. The macroprocesses
An Extended Set of Fortran Basic Linear Algebra Subprograms
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1986
"... This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers. ..."
Abstract

Cited by 526 (72 self)
 Add to MetaCart
This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers.
A PolynomialTime Algorithm For The TwoMachine UnitTime ReleaseDate JobShop ScheduleLength Problem
 Discrete Appl. Math
, 1997
"... . We consider a polynomialtime algorithm for the following scheduling problem: Given two machines, where each machine can process at most one job at a time; a set of jobs, where each job can start on or after its release date and consists of a chain of unittime operations such that the machines ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
have to process them by turn begining with a given machine; nd a schedule minimizing the maximum job completion time. Formerly, only pseudopolynomialtime algorithms have been proposed for this problem. Key words and phrases. Jobshop scheduling, unittime operations, release dates, due dates
Results 1  10
of
2,200,595