Sciweavers

46 search results - page 1 / 10
» Evaluating Call-By-Need on the Control Stack
Sort
View
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 5 months ago
Evaluating Call-By-Need on the Control Stack
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
Stephen Chang, David Van Horn, Matthias Felleisen
MSS
2005
IEEE
182views Hardware» more  MSS 2005»
13 years 10 months ago
Evaluation of Advanced TCP Stacks in the iSCSI Environment using Simulation Model
Enterprise storage demands have overwhelmed traditional storage mechanisms and have led to the development of Storage Area Networks (SANs). This has resulted in the design of SCSI...
Girish Motwani, K. Gopinath
AINA
2008
IEEE
13 years 11 months ago
Fairness of High-Speed TCP Stacks
We present experimental results evaluating fairness of several proposals to change the TCP congestion control algorithm, in support of operation on high bandwidth-delayproduct (BD...
Dimitrios Miras, Martin Bateman, Saleem N. Bhatti
IPPS
2007
IEEE
13 years 11 months ago
Stack Trace Analysis for Large Scale Debugging
We present the Stack Trace Analysis Tool (STAT) to aid in debugging extreme-scale applications. STAT can reduce problem exploration spaces from thousands of processes to a few by ...
Dorian C. Arnold, Dong H. Ahn, Bronis R. de Supins...
POPL
2009
ACM
14 years 5 months ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry