Results 1  10
of
209,250
An Approximation Algorithm for the UET TwoMachine OpenShop Problem with Time Delays
"... This paper addresses the problem of scheduling n unit execution time (UET) jobs with time delays considerations on a twomachine openshop environment. The criterion we are considering is the makespan. A simple approximation algorithm, with an asymptotic performance guarantee of 54, is presented and ..."
Abstract
 Add to MetaCart
This paper addresses the problem of scheduling n unit execution time (UET) jobs with time delays considerations on a twomachine openshop environment. The criterion we are considering is the makespan. A simple approximation algorithm, with an asymptotic performance guarantee of 54, is presented
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
. Each of these two schedules is given by an analytically defined function which assigns to each operation the number of a unittime slot for its processing. 1 Introduction We consider the following openshop problem with n jobs N = fJ 1 ; : : : ; J n g and m machines M = fM 1 ; : : : ; Mm g. Each job
SCHEDULING THE TWOMACHINE OPEN SHOP PROBLEM WITH NONSYMMETRIC TIME DELAYS
"... The paper considers a problem of scheduling n jobs in a twomachine open shop model so as to minimize the overall completion time, also called the makespan. When taking into account the time delay between the completion of an operation and the beginning of the next operation of the same job, the res ..."
Abstract
 Add to MetaCart
The paper considers a problem of scheduling n jobs in a twomachine open shop model so as to minimize the overall completion time, also called the makespan. When taking into account the time delay between the completion of an operation and the beginning of the next operation of the same job
Internet time synchronization: The network time protocol
, 1989
"... This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a selforganizing, hierarchi ..."
Abstract

Cited by 617 (15 self)
 Add to MetaCart
This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a self
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
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
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
Network Time Protocol (Version 3) Specification, Implementation and Analysis
, 1992
"... Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings are not ava ..."
Abstract

Cited by 522 (18 self)
 Add to MetaCart
are not available. This document describes the Network Time Protocol (NTP), specifies its formal structure and summarizes information useful for its implementation. NTP provides the mechanisms to synchronize time and coordinate time distribution in a large, diverse internet operating at rates from mundane
Results 1  10
of
209,250