Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.arch.embedded > #26922
| From | "Boudewijn Dijkstra" <sp4mtr4p.boudewijn@indes.com> |
|---|---|
| Newsgroups | comp.arch.embedded |
| Subject | Re: Resource constraints as a bound to complexity |
| Date | 2017-06-22 11:17 +0200 |
| Organization | Indes - IDS B.V. |
| Message-ID | <op.y179e8tqj0diun@thanatos.lan> (permalink) |
| References | <oiabu0$dqi$1@dont-email.me> |
Op Tue, 20 Jun 2017 07:34:16 +0200 schreef Don Y <blockedofcourse@foo.invalid>: > Most of my designs have been ultimately constrained by the > resources available *in* the design (which, in turn, is usually > dictated by price, power and/or size constraints). > > I've been discussing this with colleagues who have invariably > had similar experiences. None of us could "upgrade" a product > after release. You might change the feature set or fix bugs > but the complexity of the product is effectively limited by the > design that is first "sold". > > This differs from things like the desktop market or even high-end > commerce/industry (e.g., where you could install a larger disk, > faster processor, additional peripherals, etc). > > A pleasant consequence of this constraint is that the product/system > is constrained in complexity, as well. You don't start out with a > microwave oven and end up evolving (creeping featurism) to become > a space shuttle! > > How have folks working with more "unconstrained"/open-ended designs > addressed this problem? There are always *some* constraints, some are hard and rational, some are soft and impossible to quantify. If a respected engineer thinks that "design A" is ridiculously complex and is not comfortable with it, then it's probably not a good idea to go ahead with it. -- (Remove the obvious prefix to reply privately.) Gemaakt met Opera's e-mailprogramma: http://www.opera.com/mail/
Back to comp.arch.embedded | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Resource constraints as a bound to complexity Don Y <blockedofcourse@foo.invalid> - 2017-06-19 22:34 -0700
Re: Resource constraints as a bound to complexity Reinhardt Behm <rbehm@hushmail.com> - 2017-06-20 16:04 +0800
Re: Resource constraints as a bound to complexity Don Y <blockedofcourse@foo.invalid> - 2017-06-20 18:07 -0700
Re: Resource constraints as a bound to complexity "Boudewijn Dijkstra" <sp4mtr4p.boudewijn@indes.com> - 2017-06-22 11:17 +0200
Re: Resource constraints as a bound to complexity Don Y <blockedofcourse@foo.invalid> - 2017-06-22 10:17 -0700
Re: Resource constraints as a bound to complexity "Boudewijn Dijkstra" <sp4mtr4p.boudewijn@indes.com> - 2017-07-05 17:08 +0200
Re: Resource constraints as a bound to complexity Don Y <blockedofcourse@foo.invalid> - 2017-07-05 10:25 -0700
csiph-web