rafaeldff + computing   107

Clarifying the Saga pattern « kellabyte
Sagas have been proposed as a transaction model for long lived activities. A saga is a set of relatively independent (component) transactions T1, T2…Tn which can interleave in any way with component transactions of other sagas. Component transactions within a saga execute in a predefined order which, in the simplest case, is either sequential or parallel (no order).

Each component transaction T1 (0 ≤ i < n) is associated with a compensating transaction CT1. A compensating transaction CT1 undoes, from a semantic point of view, any effects of T1, but does not necessarily restore the database to the state that existed when T1 began executing.
distributed  messaging  patterns  pattern  saga  computing  transaction  transactional  transactions  compensation  reversal  workflow  blog  post  KellySommers 
december 2014 by rafaeldff
Out-of-the-Box Computing – The Belt
A large fraction of the power budget of modern superscalar CPUs is devoted to renaming registers: the CPU must track the dataflow of the executing program, assign physical registers and map them to the logical registers of the program, schedule operations when arguments are available, restore visible state in the event of an exception—all while avoiding register update hazards.

Not all CPU architectures are subject to hazards that require register renaming. Unfortunately, earlier hazard-free designs either require one-at-a-time instruction execution (stack and accumulator machines) or push hazard avoidance off onto the compiler or programmer (VLIWs). The Mill is a new machine architecture that eliminates these problems by adopting a new machine model, the “belt”.

The belt machine model is inherently free of update hazards because all operation results go onto the belt by Single Assignment; in other words, once created they never change their value. Belt machines have no general registers and thus no rename registers that physically embody them. Result addressing is implicit, which produces compact code and easily accommodates operations like integer divide that logically produce multiple results. The machine model integrates naturally with function call, eliminating caller/callee save conventions and complex call preamble and postamble code.

A belt machine has short pipelines because it lacks the extra pipe stages associated with rename; typical misprediction penalty is five cycles (if decode is also fast). Area and power consumption in a belt core is a third that of an equivalent superscalar in large part because a belt lacks the large number of physical rename registers and the interconnect needed to supply register values to the functional units.

The talk explains the belt model as seen by the programmer and the physical internals of a typical implementation.
video  cpu  hardware  InstructionSet  computer  architecture  stack  belt  IvanGodard  superscalar  RegisterRenaming  register  computing  registers  talk  mill  MillArchitecture 
august 2013 by rafaeldff
Quantum Computing Solves Classical Problems | Simons Foundation
Why quantum computing matters even if nobody ever build a non-trivial quantum computer:
quantum  QuantumComputing  QC  computing  computation  theory  CS  ComputerScience  from twitter_favs
december 2012 by rafaeldff
Think Stats: Probability and Statistics for Programmers
Free online book about statistics and probability following a computational approach.
book  statistics  statistic  programming  python  computing  numerical  stats  Probability  AllenBDowney  AllenDowney 
september 2011 by rafaeldff
Phil Windley's Technometria | Alan Kay: Is Computer Science an Oxymoron?
The following two paragraphs taken from a recent talk by Alan Kay (paraphrased by Phil Windley) represent quite closely how I've been thinking about Computer Science lately:

"Much of what is wrong about our field is that many of the ideas that happened before 1975 are still the current paradigm. He has a strong feeling that our field has been mired for some time, but because of Moore’s law, there are plenty of things to work on. The commercialization of personal computing was a tremendous distraction to our field and we haven’t, and may not, recover from it.

[in Computer Science] The basics are still mostly the same. If you go to most campuses, there is a single computer science department and the first course in computer science is almost indistinguishable from the first course in 1960. They’re about data structures and algorithms despite the fact that almost nothing exciting about computing today has to do with data structures and algorithms. "
AlanKay  talk  speech  computerscience  CS  history  academia  research  computing  blog  post  PhilWindley 
january 2009 by rafaeldff
Current State of Java for HPC
About ten years after the Java Grande effort, this paper aims at providing a snapshot of the current status of Java for High Performance Computing. Multi-core chips are becoming mainstream, offering many ways for a Java Virtual Machine (JVM) to take advantage of such systems for critical tasks such as Just-In-Time compilation or Garbage Collection. We first perform some micro benchmarks for various JVMs, showing the overall good performance for basic arithmetic operations. Then we study a Java implementation of the Nas Parallel Benchmarks, using the ProActive middleware for distribution. Comparing this implementation with a Fortran/MPI one, we show that they have similar performance on computation intensive benchmarks, but still have scalability issues when performing intensive communications. Using experiments on clusters and multi-core machines, we show that the performance varies greatly, depending on the [JVM] used (version and vendor) and the kind of computation performed.
paper  Java  Fortran  MPI  benchmark  performance  HPC  JavaGrande  JVM  parallel  scientific  computing  inria  BrianAmedro  VladimirBodnartchouk  DenisCaromel  ChristianDelbe  FabriceHuet  GuillermoTaboada  article 
september 2008 by rafaeldff
Teaching Programming Languages in a Post-Linnaean Age
"Abstract: Programming language ``paradigms'' are a moribund and tedious legacy of a bygone age. Modern language designers pay them no respect, so why do our courses slavishly adhere to them? This paper argues that we should abandon this method of teaching languages, offers an alternative, reconciles an important split in programming language education, and describes a textbook that explores these matters."
paper  ShriramKrishnamurthi  programming  language  teaching  PL  paradigm  paradigms  computing  CS  computerscience  education  PLAI  toread 
august 2008 by rafaeldff
SmugBlog: Don MacAskill » Blog Archive » SkyNet Lives! (aka EC2 @ SmugMug)
How SmugMug (a top-scale photo sharing web site) uses Amazon EC2 (and S3) for their batch jobs. They've set up a pretty cool controller system to dynamically allocate resources (EC2 instances).
blog  post  DonMacAskill  SmugMug  software  architecture  EC2  Amazon  batch  BatchProcessing  distributed  computing  system  cloud  CloudComputing  S3  scaling  scalability  ResourceAllocation 
june 2008 by rafaeldff
Mark Guzdial's Amazon Blog: What should everyone study about computing? Permalink
I have a great quote from Richard Dawkins where he describes biology as a “branch of computer science” since Watson and Crick realized that DNA is basically digital information. -- QOTD
blog  post  MarkGuzdial  computing  computerscience  CS  teaching  education  edu 
april 2008 by rafaeldff
gmane.comp.lang.fortress.general -- Fortress Version 1.0 Released
Still very much a work in progress, but they released an interpreter that fully implements the specification. Beginnings of a standard library are also being released.
Fortress  Sun  prog  amming  language  numerical  scientific  computing  science  announcement  news  release  GuySteele 
april 2008 by rafaeldff
Computer Science Unplugged - Home
Great way to teach CS concepts to children. Have them learn error detection through card tricks, search algorithms by playing battleship, or sorting networks by running around.
site  teaching  education  CS  computerscience  computing  kids  children  programming  activity 
april 2008 by rafaeldff
STEPS Toward The Reinvention of Programming (Viewpoints Research Institute)
Alan Kay's ocean-boiling project completed its first year - this is a report of the work done so far. I've only briefly skimmed the paper, but the ideas described look extremely provocative and insightful.
AlanKay  programming  system  systems  language  research  STEPS  Viewpoints  VRI  sttrp  UI  personal  computing  PC  PersonalComputing  SI  paper  report  IanPiumarta 
march 2008 by rafaeldff
Complexity Theory: A Modern Approach / Sanjeev Arora and Boaz Barak
This is a draft of a textbook on computational complexity theory. It is intended as a text for an advanced undergraduate course or introductory graduate course, or as a reference for researchers and students in computer science and allied fields such as m
book  online  free  computerscience  computing  complexity  theory  computation  ComplexityTheory  Princeton  course  SanjeevArora  BoazBarak  CS  textbook 
february 2008 by rafaeldff
Project Caroline: Platform As A Service ,For Your Service, At Your Service
"Learn how Project Caroline helps SaaS providers develop services rapidly, update them frequently, and automatically flex resource use to match changing runtime demands" - A JavaOne presentation by Sun Research.
presentation  project  Caroline  Sun  research  distributed  computing  systems  deployment  management  ops  operations  DataCenter  Java  scalability  hosting  platform  runtime 
february 2008 by rafaeldff
Farms, Fabrics and Clouds
Presentation about trends in software architecture by HP labs researchers.
toread  presentation  SteveLoughran  JulioGuijarro  grid  cluster  distributed  systems  computing  web  software  architecture  SmartFrog  deployment  megadata  pdf  slides 
december 2007 by rafaeldff
Network - xkcd - A webcomic of romance, sarcasm, math, and language - By Randall Munroe
XKCD is awesome. I know everybody already knows that, but, you know, it needs to be said more often. Like this: "XKCD is awesome". See?
xkcd  comic  network  networking  computing  humor  funny 
november 2007 by rafaeldff
Philosophy of Computer Science, University of Essex
Cool! Lots of bibliography and links to material on the Philosophy of Computer Science.
page  CS  ComputerScience  computing  philosophy  science  fundamentals  link  links  catalog  compendium  list 
november 2007 by rafaeldff
EWD 1305 - Answers to questions from students of Software Engineering
Dijkstra writing (in 2000) about the state of the software industry and education. As usual for a Dijkstra essay, lots of great quotes, many worthwhile insights, and just a touch of self-indulgent grumbling.
dijkstra  EdsgerDijkstra  EWD  EWD1305  letter  missive  column  opinion  essay  article  quotes  software  hardware  computing  computer  ComputerScience  engineering  education  pdf 
october 2007 by rafaeldff
InfoQ: Java Grid, why do we need it!
"Perhaps you can see a pattern here, objects being written to containers, some local some remote but in both cases the container is distributed and the mechanism is hidden from us through the API. This then is what a Java grid is, a distributed container.
article  java  grid  InfoQJohnDavies  C24  GridComputing  computing  distributed  systems  JavaSpaces  Terracotta  Tangosol  Coherence  Gemstone  GigaSpaces  TupleSpace  banking  finance  market  middleware 
october 2007 by rafaeldff
Google Code for Educators - Google: Cluster Computing and MapReduce
"This submission contains video lectures and related course materials from a series of lectures that was taught to Google software engineering interns during the Summer of 2007."
site  page  course  academic  Google  distributed  computing  systems  MapReduce  cluster  parallelism  parallel  GFS  video  catalog  clustering  graph  algorithm  algorithms  HPC  lecture  lectures  movie  scalability  towatch 
october 2007 by rafaeldff
Binary Lambda Calculus and Combinatory Logic | Lambda the Ultimate
"the question of what is the smallest (as measured in binary bits) Turing Machine that can possibly be constructed. John Tromp provides an answer to this question in his always fun Lambda Calculus and Combinatory Logic Playground:"
LtU  thread  post  paper  ChrisRathman  JohnTromp  computerscience  computing  information  theory  complexity  LC  lambda  LambdaCalculus  calculus  calculi  Kolmogorov  KolmogorovComplexity  algorithm  InformationTheory  AIT  AlgorithmicInformationTheory  interpreter  language  Turing  TuringMachine  TM 
september 2007 by rafaeldff
Shtetl-Optimized » Blog Archive » What Google Won’t Find
Interesting non-technical article on the relation between NP-completeness and quantum computing. It also touches on the nature of the relationship between physics and the P=NP problem.
article  ScottAaronson  blog  post  computing  computerscience  mathematics  physics  P=NP  problem  math  quantum  complexity  lecture  transcript 
august 2007 by rafaeldff
Improved Means for Achieving Deteriorated Ends / The State of State
Tim Sweeney (Unreal architect and occasional LtU participant) talks about how STM is more appropriate for large mutable-state-heavy apps and Erlang-like message passing is better for distributed computation where latency is a big deal.
blog  post  email  message  TimSweeney  BritButler  concurrency  STM  messaging  MessagePassing  Erlang  Haskell  functional  programming  state  stateful  computation  distributed  computing  systems 
august 2007 by rafaeldff
Sutter's Mill: The Pit and the Pendulum
Herb Sutter sees a cyclic process in the alternation between centralized and edge computing. It is a good analysis, but (IMHO) fails to take into account the demand side of the equation: what interesting apps are there that will require computing on the e
blog  post  article  analysis  HerbSutter  computing  history  central  centralized  distributed  edge  client  clients  RIA  RichClient  debate  cyclic  desktop  DataCenter  application 
august 2007 by rafaeldff
All Things Distributed: Reading References
Werner Vogels gives some pointers to research on the shifts the current computing and data management marketplaces are undergoing.
blog  post  links  WernerVogels  amazon  distributed  services  data  research  papers  computing 
july 2007 by rafaeldff
Alan Kay: The Computer Revolution hasn't happend yet. Keynote OOPSLA 1997 - Google Video
I don't know why this wasn't already bookmarked. Alan Kay is, as always, excellent. Quote: "arrogance in computer science is measured in nano-Dijkstras".
AlanKay  presentation  video  OOPSLA  keynote  1997  Oopsla1997  OO  Smalltalk  PC  innovation  language  history  computerscience  cs  personal  computer  computing  information 
may 2007 by rafaeldff
SELFMAN Project - SELFMAN Wiki
"making the systems self managing: the systems will reconfigure themselves to handle changes in their environment or requirements....""A major innovation of SELFMAN is to combine the strengths of structured overlay networks and advanced component models."
PeterVanRoy  research  project  CS  ComputerScience  distributed  system  systems  grid  p2p  autonomic  autonomous  computing  self-healing  self-organizing  self-organization  Oz  Mozart  component  CBD 
may 2007 by rafaeldff
lambda.oasis: Observations from DATE 2007
More of the "concurrency is urgent, STM is not a panacea, we need new ideas!" speech. This time, interestingly, coming from the embedded community. Other important points are addressed as well, such as a trend toward less reliable chips.
blog  post  ChristopheVincenz  Christophe  embedded  hardware  EDA  DATE  2007  concurrency  parallelism  parallel  computing  microprocessor  chip  CPU  STM  transactions  via:raganwald 
april 2007 by rafaeldff
ITworld.com - "Home truths" about computing
"The number of utterly impossible things that computers are expected to do automatically, doubles every 18 months." and many more.
article  column  ITWorld  SeanMcGrath  programming  computing  IT  CS  funny  humor  jokes 
march 2007 by rafaeldff
Freedom to Tinker » Blog Archive » Programs vs. Data
A very simple direct explanation of why code and data are the same thing. Can be useful for didactic purposes.
EdFelten  blog  post  article  programming  language  computing  interpreter  code  data  information  CS  ComputerScience 
february 2007 by rafaeldff
OOPS Home — OOPS - Object-Oriented Parallel System
"OOPS is a framework designed to support programming of parallel scientific applications. The high level abstractions provided by OOPS free the programmer from dealing with many parallel implementation details.""However, for performance reasons, paralleli
project  OO  parallel  programming  OOPS  scientific  computing  HPC  EloizaSonoda 
february 2007 by rafaeldff
India: Hole-in-the-Wall
A physicist makes an internet kiosk available in an Indian slum and children just learn how to use it. (this is a copy of a Businessweek article.
article  interview  SugataMitra  businessweek  computing  edu  edtech  literacy  children  DigitalDivide  market  society  economy  internet  web  www  teaching 
february 2007 by rafaeldff
Coding Horror: Microsoft 1978
"Microsoft's first employees, their current net worth"
blog  post  JeffAtwood  Microsoft  history  tech  technology  PC  computing  industry 
january 2007 by rafaeldff
'The world needs only five computers' | Newsmakers | CNET News.com
CNet interview with Sun's CTO on massive processing power consolidation: ""When does it become most of computing?" (...) In terms of (spending on) computing stuff, we'll see the crossover before the end of this decade."
interview  GregPapadopoulos  CNet  Sun  market  strategy  future  computing  consolidation  economy  datacenter  efficiency 
january 2007 by rafaeldff
Turing Equivalent vs. Turing Complete
Turing Equivalence is a property of computing models, Turing Completeness is a (much rarer) property of computations.
blog  post  cs  computation  computing  turing  TuringMachine  turingcompleteness  completeness  complexity  ComputerScience  MarkChu-Carroll  MarkCChu-Carroll  Chu-Carroll 
january 2007 by rafaeldff
Theoretical Computer Science Cheat Sheet (pdf)
Tending more towards algorithm analysis and numerical computing than formal methods, but its still pretty good.
MartinJansche  academic  cheatsheet  computer  computerscience  cs  math  mathematics  reference  formuli  formula  theoretical  theory  complexity  algorithm  analysis  graph  numerical  computing  TeX 
november 2006 by rafaeldff
Designing Distributed Systems - Arima Interview with Ken Arnold
"In this third installment of Bill Venners' interview with Ken Arnold, the discussion centers around designing distributed systems, including the importance of designing for failure, avoiding the "hell" of state, and choosing recovery strategies."
interview  artima  KenArnold  sun  java  jini  j2ee  JavaEE  distributed  system  systems  distributedsystems  computing  transaction  reliability  recovery  robusteness  state  stateless  statelessness  idempotency  failure  design  software  architecture 
november 2006 by rafaeldff
Nelson's Weblog: tech / bad / whySoapSucks
Attack of the RESTafarians!!! (stupid geek humor aside, this is a short blog post by Nelson Minar acknowledging that choosing SOAP for the Google search API was a mistake; not much detail beyond here...)
blog  post  NelsonMinar  REST  WebServices  SOAP  distributed  systems  computing  ws-*  rant  advocacy  API  Google 
november 2006 by rafaeldff
How grid power pays off for HSBC - 26/Sep/2006 - ComputerWeekly.com
Use case. "Grid technology has broken out of the scientific and academic communities' labs and entered the enterprise. Global banking group HSBC is a good example of a commercial organisation that is wrestling with grid technologies, while harnessing thei
new  article  grid  computing  distributedcomputing  distributed  system  HSBC  bank  banking  finance  software  parallel  ComputerWeekly 
october 2006 by rafaeldff
The Algorithm: Idiom of Modern Science
Famous physicists bashing, american history jokes, semiotics and criptography on an excellent introduction to (algorithmic) computer science
BernardChazelle  Princeton  essay  article  introduction  computerscience  cs  computing  complexity  algorithm  algorithms  math  mathematics  linguistics  history  physics  philosophy  science  cryptography  tractability  decidability  NP  analysis  academia  academic 
september 2006 by rafaeldff
/dev/null - Distributed Systems as Organisms
Cameron Purdy's vision of the future of distributed transactional systems. Seems similar to "autonomic computing" in that it envisions intensice replication as a means to avoid complicated recoverability scenarios.
blog  post  CameronPurdy  distributedsystems  distributedcomputing  transaction  2PC  XA  distributed  system  systems  autonomic  computing  algorithm  reliability  clustering  cluster  architecture 
august 2006 by rafaeldff
Making reliable distributed systems in the presence of software errors
Joe Armstrong's - one of Erlang's creators - thesis on fault-tolerant highly concurrent distributed software develpment. The text also apparently gives a good overview of Erlang' and it's main development model.
thesis  paper  JoeArmstrong  Erlang  language  distributed  system  systems  computing  distributedsystems  concurrency  messaging  resiliency  fault-tolerance  fault-tolerant  reliability  durability  ilities  overview  tutorial  server  middleware  pdf 
august 2006 by rafaeldff
Dr. Dobb's | A Conversation with Guy Steele Jr. | March 3, 2005
"DDJ chats with Guy Steele Jr. on topics ranging from programming languages research to programming language implementation."
interview  DrDobbs  GuySteele  lisp  scheme  fortress  sun  mit  harvard  ThinkingMachines  Dobbs  DrDobb's  science  scientific  computing  HiPerf 
august 2006 by rafaeldff
How To Criticize Computer Scientists
2-step process: profile and then zing. Ex: Theorist? "Isn't this just a straightforward extension of an old result by Hartmanis?". Experimentalist? "Isn't it obvious that there's a bottleneck in the system that prevents scaling to arbitrary size?"
funny  article  DouglasComer  Comer  academia  CS  computerscience  computing  criticism  SE  SoftwareEngineering  scalability  Humor 
august 2006 by rafaeldff
Bringing Data Grids to the Masses
Interview with Cameron Purdy on Tangosol's offerings for grid computing.
grid  interview  GridComputing  distributed  system  systems  distributedsystems  computing  CameronPurdy  tangosol  cache  data 
july 2006 by rafaeldff
Symbolic links
Programming through file system symbolic links (not sure if its Turing Complete, or just a FSA simulation). User interface? ls! Example code? Conway's Life!
software  coding  programming  hacking  fun  insanity  unix  computing  compute  machine  automata  hack  model  CS  ComputerScience  Life  ConwayLife  code 
june 2006 by rafaeldff
About Hadoop
Opensource java implementation of MapReduce and a distributed filesystem
distributed  filesystem  google  lucene  MapReduce  software  project  java  apache  nutch  Hadoop  opensource  free  system  systems  computing  FS  DFS  javascript 
may 2006 by rafaeldff
ongoing · On Grids
Tim Bray presents an overview of the Grid computing landscape. A 4x4 grid (heh) categorization of grid technologies is interesting.
grid  computing  article  blog  post  TimBray  distributed  system  systems  GridComputing 
may 2006 by rafaeldff
Tech Talk: Ted Neward on Web Services and Security
Lots of advice about designing effective SOAs (not much detail about web services security, though).
WebServices  SOA  software  architecture  tedneward  video  interview  tss  tsss  distributedsystems  distributed  systems  computing 
april 2006 by rafaeldff
Apostolos Doxiadis
Interview about yet-to-be-published comic book about the history of modern logic by Apostolos Doxiadis and Christos Papadimitriou.
logic  philosophy  computing  cs  computerscience  interview  ApostolosDoxiadis  ChirstosPapadimitriou  book  comics  unreleased 
march 2006 by rafaeldff
Middleware Matters: CORBA did what?
Interesting discussion on the comments of a post in Steve Vinoski's blog about loose coupling, corba and Web Services.
blog  post  SteveVinoski  MarkBaker  MichiHenning  corba  distributed  system  systems  xml  webservices  soap  ws  soa  computing  http 
march 2006 by rafaeldff
REST + SOAP
REST and SOAP viewed in a historical context.
blog  post  SamRuby  networking  internet  oo  REST  SOAP  SOA  xml  distributed  computing  systems  system  software  architecture  history  ibm  web 
march 2006 by rafaeldff
« earlier      
per page:    204080120160

related tags

2PC  80s  academia  academic  access  acm  activity  AdrianBowyer  advocacy  agent  AI  AIT  AlanKay  algebra  algorithm  algorithmic  AlgorithmicInformationTheory  algorithms  Alice  AllenBDowney  AllenDowney  amazon  amming  analysis  announcement  announcements  AnnWollrath  anti  apache  API  ApostolosDoxiadis  apple  application  architecture  arithmethic  arithmetic  arstechnica  article  artilce  artima  automata  autonomic  autonomous  bank  banking  batch  BatchProcessing  bcc  belt  benchmark  BernardChazelle  BillWalster  blackwell  blog  BoazBarak  book  books  BrianAmedro  BritButler  businessweek  C24  cache  calc  calculi  calculus  CameronPurdy  Caroline  catalog  category  CategoryTheory  CBD  central  centralized  cg  Chaitin  chapter  charlespetzold  cheatsheet  children  chip  ChirstosPapadimitriou  ChrisRathman  ChristianDelbe  Christophe  ChristopheVincenz  Chu-Carroll  Church  Clarck  Clark  classic  client  clients  cloud  CloudComputing  cluster  clustering  CNet  code  coding  Coherence  column  Comer  comic  comics  comment  comments  commodity  compendium  compensation  completeness  complexity  ComplexityTheory  component  components  computation  compute  computer  computers  computerscience  ComputerWeekly  computing  concurrency  concurrent  conference  consensus  consolidation  ConwayLife  corba  cost  costs  course  cpu  critic  criticism  critique  cryptography  cs  Curry-Howard  cyclic  DanConnolly  DanCreswell  data  data-centers  datacenter  DATE  DavidWalend  DDClark  debate  decidability  decimal  declarative  DenisCaromel  deployment  design  designpatterns  desktop  DFS  DigitalDivide  dijkstra  distributed  distributedcomputing  distributedsystems  distribution  Dobbs  DonMacAskill  DOS  DouglasComer  DPReed  DrDobb's  DrDobbs  durability  dynamic  EC2  Economics  economy  EDA  EdFelten  edge  EdsgerDijkstra  edtech  edu  education  efficiency  EloizaSonoda  email  embedded  encoding  end-to-end  endtoend  engineering  Erlang  essay  EWD  EWD1305  expansys  FabriceHuet  fail  failure  fault-tolerance  fault-tolerant  figures  filesystem  finance  floatingpoint  flops  formula  formuli  Fortran  fortress  forum  fotrtess  foundations  FranciscoReverbel  free  Frege  FS  fun  functional  fundamentals  funny  future  gc  Gemstone  generic  generics  Gentzen  GeoffWyant  geometry  GFS  GigaSpaces  GJChaitin  google  grammar  grammars  graph  graphical  graphics  GregoryChaitin  GregoryJChaitin  GregPapadopoulos  grid  GridComputing  GuillermoTaboada  Gutemberg  guysteele  hack  hacking  Hadoop  hardware  harvard  Haskell  hd  HerbSutter  highavailability  HiPerf  history  hosting  hp  HPC  HSBC  http  humor  IanPiumarta  ibm  idempotency  ieee  ilities  immutability  import  importing  incompleteness  industry  InfoQJohnDavies  information  InformationTheory  innovation  inria  insanity  InstructionSet  internet  interpreter  interval  interview  introduction  IONA  IT  ITWorld  IvanGodard  j2ee  java  JavaEE  JavaGrande  javascript  JavaSpaces  JeffAtwood  JeffDean  JHSaltzer  JimGray  JimWaldo  jini  job  JoeArmstrong  JohnTromp  JohnVlissides  JohnWoodwark  jokes  JonasBoner  jonathanschwartz  JulioGuijarro  JVM  KellySommers  KenArnold  keynote  kids  km  knowledge  knowledgemanagement  Kolmogorov  KolmogorovComplexity  lambda  LambdaCalculus  language  latency  LC  lecture  lectures  LESLIELAMPORT  letter  Life  linguistics  link  links  lisp  list  literacy  logic  LorenzoPuccetti  LtU  lucene  lucianofloridi  machine  macintosh  magazine  management  MapReduce  MarkBaker  MarkCC  MarkCChu-Carroll  MarkChu-Carroll  MarkChuCarroll  market  marketing  MarkGuzdial  MARSHALLPEASE  MartinJansche  material  math  mathematics  mathmatics  MaximillianDornseif  megadata  message  MessagePassing  messaging  meta  metamathmatics  MichiHenning  microeconomy  microprocessor  microsoft  middleware  mill  MillArchitecture  missive  mit  mobile  model  modeling  movie  Mozart  MPI  NelsonMinar  network  networking  new  neward  news  NewScientist  NP  number  numbers  numerical  nutch  objects  offer  offers  ondemand  online  oo  ood  oop  OOPS  OOPSLA  Oopsla1997  opensource  operations  opinion  ops  oreilly  overview  oxford  Oz  p2p  P=NP  page  paper  papers  paradigm  paradigms  paradim  parallel  parallelism  PatHelland  pattern  patterns  paxos  pc  pdf  performance  personal  PersonalComputer  PersonalComputing  PeterNorvig  PeterVanRoy  PhilipWadler  philosophy  philosophyofcomputing  philosophyofingormation  PhilWindley  physics  pic  picture  PL  PLAI  platform  plugin  plugins  portuguese  post  posts  ppt  precision  presentation  press  pricing  princeton  printing  Probability  problem  prog  programming  project  proof  protocol  pt  pt-br  python  QC  quantum  QuantumComputing  questions  quote  quotes  raid  ralphjohnson  rant  recommendation  recommendations  recovery  Reed  reference  register  RegisterRenaming  registers  release  reliability  report  research  resiliency  ResourceAllocation  resources  rest  reverbel  reversal  review  RIA  RichClient  ROBERTSHOSTAK  robusteness  RoyFielding  runtime  S3  saga  Saltzer  SamRuby  SamuelCKendall  SamuelKendall  SanjeevArora  scalability  scale  scaling  schema  scheme  science  scientific  ScottAaronson  SE  SeanMcGrath  self-healing  self-organization  self-organizing  server  services  ShriramKrishnamurthi  SI  site  slides  smalltalk  SmartFrog  SmugMug  soa  soap  socialsoftware  society  software  SoftwareEngineering  speech  stability  stack  standard  standards  stanford  state  stateful  stateless  statelessness  statistic  statistics  stats  steele  StephenWolfram  STEPS  SteveLoughran  SteveMaine  SteveVinoski  STM  storage  store  strategy  structure  sttrp  SugataMitra  sun  supercomputing  superscalar  system  systems  tag  talk  tangosol  teaching  tech  technicalreport  technology  tedneward  Terracotta  test  TeX  text  textbook  theorem  theoretical  theory  thesis  ThinkingMachines  thread  TimBray  time  times  timing  TimOreiily  TimSweeney  TM  tolerance  toread  towatch  tractability  transaction  transactional  transactions  transcript  transformation  trend  trends  tss  tsss  TupleSpace  TupleSpaces  turing  turingcompleteness  turingmachine  tutorial  type  typing  ubiquity  UCS  UCS-2  UI  Unicode  unix  unreleased  us  UTF-16  utility  UTM  via:raganwald  video  Viewpoints  VladimirBodnartchouk  vlissidies  VRI  w3c  warehouse-scale-computers  web  webservices  WernerVogels  Wolfram  work  workflow  workstation  ws  ws-*  wsdl  www  XA  xkcd  xml 

Copy this bookmark:



description:


tags: