Scheduling for Reduced CPU Energy - Weiser, Welch, Demers, Shenker (1994)(Correct)(192 citations)
CPU can be stopped altogether by putting it into a mode that wakes up upon an interrupt, such as from a
will draw a small amount of power while in standby mode, and we might not get a one-to-one reduction in
next 30 second period with less than 90% idle. This models the typical power saving features already redwood.snu.ac.kr/~jkpark/courses/mobile/paper/powermanagement/cpu/osdi94.ps
One or more of the query terms is very common - only partial results have been returned. Try Google (CiteSeer).
An Introduction to Least Commitment Planning - Weld (1994)(Correct)(167 citations)
planner (although it can be used in case-based mode as well)3. a description of the possible
while execution is proceeding. Instead, we may model execution as an atomic transformation from one
space to explode, they are useful when used with moderation. Planning with them is very simple. In line www-i5.informatik.rwth-aachen.de/LuFG/Lehre/WS97/PLAN/weld-plan-intro.ps.gz
Dealing With Disaster: Surviving Misbehaved Kernel Extensions - Seltzer (1996)(Correct)(163 citations)
conclude in Section 7. 2 How Grafts Misbehave Our model of grafts is that they are similar to regular
process. The first is that grafts run in supervisor mode. If no special care is taken, grafts have the
system. This problem is shared by other extension models, such as upcalls. Depending on the function that camars.kaist.ac.kr/~dhpark/SIG/Readings/disaster.ps.gz
Online Aggregation - Hellerstein, Haas, Wang (1997)(Correct)(143 citations)
traditional database systems is performed in batch mode: a query is submitted, the system processes a
in a combined extensional /intensional format. This model is different from the type of data browsing we
for online processing, and (ii) an accurate cost model for relational operators within that framework. db.cs.berkeley.edu/papers/sigmod97-online.ps.Z
Embra: Fast and Flexible Machine Simulation - Witchel, Rosenblum (1996)(Correct)(65 citations)
as part of the SimOS simulation environment, Embra models the processors of a MIPS R3000/R4000 machine
simulation statistics reported and the simulation model accuracy with low performance overheads. For
its generated code to include a processor cache model which allows it to compute the cache misses and hing.lcs.mit.edu/pub/witchel/papers/SIGMetrics96-embra.ps.Z
Failure Mode Assumptions and Assumption Coverage - Powell (1995)(Correct)(63 citations)
1 Failure Mode Assumptions and Assumption Coverage David
is proposed for the formal analysis of failure mode assumptions and for the evaluation of the
service delivered by a system or component. Failure mode assumptions are then formalized as assertions on ftp.laas.fr/pub/Publications/1991/91462.ps
Chained Declustering: A New Availability Strategy for.. - Hsiao (1990)(Correct)(62 citations)
3 can be measured in two different operating modes: the normal mode, with no failed components 1
in two different operating modes: the normal mode, with no failed components 1 and the failure
with no failed components 1 and the failure mode, in which one or more processors or disks have www.cs.wisc.edu/~dewitt/papers/paralleldb/dbengin90.ps
Computational Complexity of Terminological Reasoning in BACK - Nebel (1988)(Correct)(59 citations)
Abstract Terminological reasoning is a mode of reasoning all hybrid knowledge representation
introduction of partially defined concepts can be modelled by assuming additional anonymous atomic
standard semantics and gives a precise account-a model theoretic one-for where incompleteness with ftp.informatik.uni-freiburg.de/documents/papers/ki/nebel-aij88.ps.gz
Techniques for Reducing Consistency-Related.. - Carter, Bennett.. (1993)(Correct)(59 citations)
1.1 Background There are two fundamental models for parallel programming and for building
memory or message passing. The shared memory model is a direct extension of the conventional
a direct extension of the conventional uniprocessor model wherein each processor is provided with the www.cs.utah.edu/~retrac/papers/tocs95.ps.Z
Multicluster, Mobile, Multimedia Radio Network - Gerla, Tsai (1995)(Correct)(59 citations)
is carried in a connectionless, i.e. datagram) mode. For connection oriented traffic (voice, video)
VC slot so that two VCs can share the slot in CDMA mode. Feasible" here means that their pairwise power
are supported essentially in a circuit switched mode, it is important to evaluate not only the www.cs.nccu.edu.tw/~ttsai/ps/winet.ps
Proof-Checking a Data Link Protocol - Helmink, Sellink, Vaandrager (1993)(Correct)(52 citations)
developed and used by Philips Electronics is modeled and verified using I/O automata theory.
a higher degree of confidence. The protocol is modeled The work of the first author is partially
deductions, corresponding to errors in the protocol model and to errors in its correctness proof, ftp.phil.uu.nl/pub/logic/PREPRINTS/preprint109.ps.Z
Distributed Packet Switching in Arbitrary Networks - Rabani, Tardos (1996)(Correct)(52 citations)
delay of a packet. We also extend the results to a model of packet traf- Supported in part by the NSF
1996. fic for handling bursty communication. The model is motivated by the new adversarial model
The model is motivated by the new adversarial model suggested by Borodin et al. 1 Introduction simon.cs.cornell.edu/home/eva/STOC96.ps
Disseminating Active Map Information to Mobile Hosts - Schilit, Theimer (1994)(Correct)(50 citations)
plane, etc. A significant aspect of this emerging mode of computing is the frequently changing execution
computing, active maps, and our system model in greater detail. Section 3 presents our design
pair (key =type"value =person"2.3 System Model The context-aware applications, active map ftp.parc.xerox.com/pub/schilit/AMS.ps.Z
The Jalapeño Dynamic Optimizing Compiler for Java - Burke, Choi, Fink.. (1999)(Correct)(47 citations)
im- 2 Though dynamic compilation is the default mode for the Jalape~no Optimizing Compiler, the same
alias information. Synchronization constraints are modeled by introducing synchronization dependence
points. Java exception semantics [29] is modeled by exception dependence edges, which connect www.mcs.newpaltz.edu/~hind/papers/grande99.ps
Analysis of Packet Loss Processes in High-Speed Networks - Cidon, Khamisy, Sidi (1991)(Correct)(46 citations)
queueing system with a finite buffer capacity. The model we use addresses the packet loss probabilities
of fixed or variable size for several arrival models and a several number of sessions. Numerical
a block is related to the Asynchronous Transfer Mode (ATM) emerging standard [2]In ATM, the current www.cse.ucsc.edu/~rom/moshe/PUBS/m_sidi_loss_93.ps.gz
Admission Control and Routing in ATM Networks.. - Courcoubetis.. (1995)(Correct)(40 citations)
for call acceptance and routing does not require models describing the traffic. Each switch estimates
approach. I. Introduction A SYNCHRONOUS transfer mode (ATM) is a form of packet switching that is
overflows. The method we propose does not require models describing the statistics of the traffic. This cheetah.vlsi.uwaterloo.ca/~kesidis/TComm95.ps
OSI IS-IS Intra-domain Routing Protocol - Oran (1990)(Correct)(40 citations)
4 3.1 Reference Model definitions
relies upon the provision of a connectionless-mode underlying service. 1 This Standard specifies: a)
Open Systems Interconnection -Basic Reference Model. ISO 7498/Add.1:1984, Information processing ftp.enst.fr/pub/rfc/11xx/1142.ps.gz
IP Switching and Gigabit Routers - Newman, Minshall, Lyon, Huston (1997)(Correct)(33 citations)
and IP switch solutions use asynchronous transfer mode (ATM) for the switch fabric. In the case of the IP
of packets in the Internet for caching, with a moderate sized cache, to be useful. The silicon
other than output queueing may be mapped into this model.The protocol will need to be extended to www.ipsilon.com/~pn/papers/ieee_comm96.ps
Communication Issues in Parallel Computing across ATM Networks - Huang (1994)(Correct)(33 citations)
underlying network. Although Asynchronous Transfer Mode (ATM) was designed specifically to transport
State University. Keywords: Asynchronous transfer mode, computer networks, distributed parallel
fiber-optic LANs using Asynchronous Transfer Mode (ATM) protocols [3] are now commercially available ftp.cps.msu.edu/pub/crg/PAPERS/msu-cps-94-34.ps.gz