Sciweavers

JSSPP
1997
Springer
13 years 12 months ago
Modeling of Workload in MPPs
In this paper we have characterized the inter-arrival time and service time distributions for jobs at a large MPP supercomputing center. Our findings show that the distributions ...
Joefon Jann, Pratap Pattnaik, Hubertus Franke, Fan...
JSSPP
1997
Springer
13 years 12 months ago
PScheD: Political Scheduling on the CRAY T3E
Large parallel processing environments present serious administrative challenges if high utilization of the available resources is a goal. In many cases there is also the need to ...
Richard N. Lagerstrom, Stephan K. Gipp
JSSPP
1997
Springer
13 years 12 months ago
Memory Usage in the LANL CM-5 Workload
It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory schedulin...
Dror G. Feitelson
JSSPP
1997
Springer
13 years 12 months ago
An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors
In this paper we describe the design, implementation and experimental evaluation of a technique for operating system schedulers called processor pool-based scheduling [51]. Our tec...
Tim Brecht
PODC
1996
ACM
13 years 12 months ago
Atomicity in Electronic Commerce
There is tremendous demand for the ability to be able to electronically buy and sell goods over networks. This field is called electronic commerce, and it has inspired a large var...
J. D. Tygar
PODC
1996
ACM
13 years 12 months ago
Fundamental Challenges in Mobile Computing
This paper is an answer to the question: "What is unique and conceptually different about mobile computing?" The paper begins by describing a set of constraints intrinsi...
Mahadev Satyanarayanan
PODC
1996
ACM
13 years 12 months ago
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
Maged M. Michael, Michael L. Scott
PODC
1996
ACM
13 years 12 months ago
Automated Logical Verification Based on Trace Abstractions
95-53Klarlundetal.:AutomatedLogicalVerificationbasedonTraceAbstractions BRICSBasic Research in Computer Science Automated Logical Verification Trace Abstractions Nils Klarlund Moge...
Nils Klarlund, Mogens Nielsen, Kim Sunesen
PODC
1996
ACM
13 years 12 months ago
Fail-Awareness in Timed Asynchronous Systems
We address the problem of the impossibility of implementing synchronous fault-tolerant service specifications in asynchronous distributed systems. We introduce a method for weaken...
Christof Fetzer, Flaviu Cristian