Sciweavers

TC
1998
13 years 3 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
MST
1998
91views more  MST 1998»
13 years 3 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
FGCS
2000
105views more  FGCS 2000»
13 years 3 months ago
Abstract machines for programming language implementation
machines for programming language implementation Stephan Diehla, , Pieter Hartelb , Peter Sestoftc a FB-14 Informatik, Universit
Stephan Diehl, Pieter H. Hartel, Peter Sestoft
CORR
2000
Springer
133views Education» more  CORR 2000»
13 years 3 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
ECCC
2007
62views more  ECCC 2007»
13 years 3 months ago
Space Hierarchy Results for Randomized and Other Semantic Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...
Jeff Kinne, Dieter van Melkebeek
IPL
2008
82views more  IPL 2008»
13 years 3 months ago
Confusion of memory
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
Lawrence S. Moss
EOR
2006
68views more  EOR 2006»
13 years 3 months ago
Cyclic scheduling of a 2-machine robotic cell with tooling constraints
In this study, we deal with the robotic cell scheduling problem with two machines and identical parts. In an ideal FMS, CNC machines are capable of performing all the required ope...
Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan
IANDC
2008
80views more  IANDC 2008»
13 years 3 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 3 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 3 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae