95
Voted
TC
1998
15 years 12 days ago
1998
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...
112
Voted
MST
1998
15 years 12 days ago
1998
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...
FGCS
2000
15 years 17 days ago
2000
machines for programming language implementation Stephan Diehla, , Pieter Hartelb , Peter Sestoftc a FB-14 Informatik, Universit
CORR
2000
Springer
15 years 17 days ago
2000
Springer
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...
101
Voted
ECCC
2007
15 years 21 days ago
2007
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...
IPL
2008
15 years 22 days ago
2008
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 ...
80
Voted
EOR
2006
15 years 23 days ago
2006
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...
110
Voted
IANDC
2008
15 years 24 days ago
2008
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...
CORR
2010
Springer
15 years 25 days ago
2010
Springer
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...
115
click to vote
ESA
2010
Springer
15 years 28 days ago
2010
Springer
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, ...