
	Where results make sense

Topic: Parallelizable

Related Topics

Fiber bundle

	Tony's Home (Site not responding. Last check: 2007-10-23)
		Whenever I used the term "parallelizable" for a manifold, I should have said
		"parallelizable with a pseudo-Riemannian metric, invariant under the flat connection naturally associated with the parallelization, whose geodesics are the same as those of that connection".
		For instance, Kervaire [2] proved that a product of spheres is parallelizable as long as at least one of them has odd dimension; most such products are not diffeomorphic to products of Lie groups, since a compact, simply connected Lie group has nontrivial third cohomology.
	www.valdostamuseum.com /hamsmith/tsemailaddress.html (282 words)

	SPEC Glossary
		One example of work that is not vectorizable is adding to each item in an array the value of the preceding item in the array, each calculation is dependent upon the results of the preceding calculation so there is no way to perform the operations at the same time.
		Vectorization is only one subclass (probably one of the most restrictive subclass) of parallelizable programming.
		A period of time prior to when the actual measurement is taken, where the workload has been already started in an effort to get the SUT to a stable and consistent state.
	www.spec.org /spec/glossary (3014 words)

	NC - Wikipedia
		It is unknown whether NC = P, but most researchers suspect this to be false, meaning that there are some tractable problems which are "inherently sequential" and cannot significantly be sped up by using parallelism.
		Just as the class NP-Complete can be thought of as "probably intractable", so the class P-Complete can be thought of as "probably not parallelizable" or "probably inherently sequential".
		The parallel computer in the definition can be assumed to be a parallel, random-access machine (PRAM[?]).
	www.web-dictionary.org /encyclopedia/nc/NC.html (329 words)

	PMAC - A Parallelizable MAC - Background - Rogaway
		And modern processors which offer up lots of registers and instruction-dispatch units will be limited by the amount of parallelism there is to exploit in the underlying block cipher.
		In saying that PMAC is fully parallelizable we mean that you are effectively unlimited in how much parallelism you can extract.
		In particular, one route towards making a parallelizable MAC is the "Carter-Wegman approach" (which you can read about in the paper on UMAC, for example).
	www.cs.ucdavis.edu /~rogaway/ocb/pmac-bak.htm (1592 words)

	Novel, Perfectly Parallelizable, Linearly Scaling Method for Electron Correlation (Site not responding. Last check: 2007-10-23)
		Novel, Perfectly Parallelizable, Linearly Scaling Method for Electron Correlation
		David R. "Chip" Kent IV Michael T. Feldmann
		Such electrons have been shown to yield the majority of the correlation energy of the system.
	www.wag.caltech.edu /anmeeting/2000/presentations/chip (137 words)

	List of Papers, John R. Black
		PMAC is a new mode of operation for AES (or any block cipher) to provide fast, parallelizable, and provably-secure message authentication.
		We describe a parallelizable mode of operation for authenticity and privacy.
		OCB is aggressively optimized to a minimum of block-cipher calls, cheap offset calculations which are fast on virtually any computing platform, only one block-cipher key, and it requires only a nonce for initialization (as opposed to a random IV).
	www.cs.colorado.edu /~jrblack/papers.html (1314 words)

Try your search on: Qwika (all wikis)